./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:08:23,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:08:23,550 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:08:23,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:08:23,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:08:23,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:08:23,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:08:23,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:08:23,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:08:23,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:08:23,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:08:23,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:08:23,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:08:23,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:08:23,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:08:23,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:08:23,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:08:23,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:08:23,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:08:23,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:08:23,586 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:08:23,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:08:23,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:08:23,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:08:23,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:08:23,592 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:08:23,593 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:08:23,594 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:08:23,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:08:23,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:08:23,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:08:23,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:08:23,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:08:23,598 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:08:23,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:08:23,600 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:08:23,601 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:08:23,620 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:08:23,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:08:23,629 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:08:23,629 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:08:23,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:08:23,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:08:23,630 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:08:23,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:08:23,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:08:23,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:08:23,631 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:08:23,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:08:23,631 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:08:23,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:08:23,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:08:23,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:08:23,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:08:23,632 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:08:23,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:08:23,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:08:23,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:08:23,635 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:08:23,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:08:23,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:08:23,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:08:23,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:08:23,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:08:23,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:08:23,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:08:23,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:08:23,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 [2018-11-28 16:08:23,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:08:23,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:08:23,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:08:23,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:08:23,719 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:08:23,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-28 16:08:23,784 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8831640c7/53412821599c409d9a3d7ade6c86ddc1/FLAGc109e1819 [2018-11-28 16:08:24,333 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:08:24,334 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-28 16:08:24,344 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8831640c7/53412821599c409d9a3d7ade6c86ddc1/FLAGc109e1819 [2018-11-28 16:08:24,638 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8831640c7/53412821599c409d9a3d7ade6c86ddc1 [2018-11-28 16:08:24,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:08:24,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:08:24,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:08:24,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:08:24,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:08:24,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:08:24" (1/1) ... [2018-11-28 16:08:24,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a15a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:24, skipping insertion in model container [2018-11-28 16:08:24,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:08:24" (1/1) ... [2018-11-28 16:08:24,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:08:24,694 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:08:24,992 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:08:25,003 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:08:25,080 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:08:25,100 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:08:25,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25 WrapperNode [2018-11-28 16:08:25,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:08:25,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:08:25,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:08:25,102 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:08:25,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:08:25,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:08:25,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:08:25,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:08:25,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... [2018-11-28 16:08:25,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:08:25,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:08:25,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:08:25,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:08:25,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:08:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:08:25,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:08:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-28 16:08:25,330 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-28 16:08:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-28 16:08:25,331 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-28 16:08:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:08:25,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:08:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:08:25,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:08:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 16:08:25,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 16:08:25,902 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:08:25,902 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 16:08:25,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:25 BoogieIcfgContainer [2018-11-28 16:08:25,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:08:25,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:08:25,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:08:25,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:08:25,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:08:24" (1/3) ... [2018-11-28 16:08:25,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50548d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:08:25, skipping insertion in model container [2018-11-28 16:08:25,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:25" (2/3) ... [2018-11-28 16:08:25,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50548d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:08:25, skipping insertion in model container [2018-11-28 16:08:25,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:25" (3/3) ... [2018-11-28 16:08:25,913 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-28 16:08:25,924 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:08:25,932 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:08:25,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:08:25,992 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:08:25,993 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:08:25,993 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:08:25,993 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:08:25,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:08:25,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:08:25,995 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:08:25,995 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:08:25,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:08:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-28 16:08:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 16:08:26,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:26,029 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:26,031 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:26,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:26,037 INFO L82 PathProgramCache]: Analyzing trace with hash -848954410, now seen corresponding path program 1 times [2018-11-28 16:08:26,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:26,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:26,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 16:08:26,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:26,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:08:26,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:08:26,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:08:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:26,364 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-11-28 16:08:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:26,438 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2018-11-28 16:08:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:08:26,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 16:08:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:26,452 INFO L225 Difference]: With dead ends: 118 [2018-11-28 16:08:26,452 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 16:08:26,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 16:08:26,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-28 16:08:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 16:08:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2018-11-28 16:08:26,503 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2018-11-28 16:08:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:26,505 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2018-11-28 16:08:26,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:08:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2018-11-28 16:08:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 16:08:26,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:26,509 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:26,509 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:26,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:26,510 INFO L82 PathProgramCache]: Analyzing trace with hash -796554308, now seen corresponding path program 1 times [2018-11-28 16:08:26,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:26,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:26,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 16:08:26,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:26,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 16:08:26,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 16:08:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 16:08:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 16:08:26,635 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2018-11-28 16:08:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:26,747 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2018-11-28 16:08:26,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:08:26,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-28 16:08:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:26,753 INFO L225 Difference]: With dead ends: 64 [2018-11-28 16:08:26,753 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 16:08:26,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:08:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 16:08:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-28 16:08:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 16:08:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2018-11-28 16:08:26,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2018-11-28 16:08:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:26,774 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2018-11-28 16:08:26,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 16:08:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2018-11-28 16:08:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 16:08:26,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:26,777 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:26,777 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:26,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:26,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1817622662, now seen corresponding path program 1 times [2018-11-28 16:08:26,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:26,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:26,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:26,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:26,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:27,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:27,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:27,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:27,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:27,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-11-28 16:08:27,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 16:08:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 16:08:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:08:27,325 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 9 states. [2018-11-28 16:08:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:28,177 INFO L93 Difference]: Finished difference Result 147 states and 207 transitions. [2018-11-28 16:08:28,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:08:28,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-28 16:08:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:28,182 INFO L225 Difference]: With dead ends: 147 [2018-11-28 16:08:28,183 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 16:08:28,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:08:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 16:08:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-11-28 16:08:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 16:08:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2018-11-28 16:08:28,210 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 50 [2018-11-28 16:08:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:28,213 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2018-11-28 16:08:28,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 16:08:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2018-11-28 16:08:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 16:08:28,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:28,219 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:28,221 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:28,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash -30301019, now seen corresponding path program 1 times [2018-11-28 16:08:28,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:28,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:28,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:28,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:28,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:28,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:08:28,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-28 16:08:28,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 16:08:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 16:08:28,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 16:08:28,418 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand 4 states. [2018-11-28 16:08:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:28,625 INFO L93 Difference]: Finished difference Result 161 states and 225 transitions. [2018-11-28 16:08:28,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:08:28,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-28 16:08:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:28,630 INFO L225 Difference]: With dead ends: 161 [2018-11-28 16:08:28,630 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 16:08:28,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:08:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 16:08:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-11-28 16:08:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 16:08:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2018-11-28 16:08:28,650 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 55 [2018-11-28 16:08:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:28,651 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2018-11-28 16:08:28,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 16:08:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2018-11-28 16:08:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 16:08:28,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:28,654 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:28,655 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:28,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash 410874573, now seen corresponding path program 1 times [2018-11-28 16:08:28,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:28,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:28,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:28,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:28,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:28,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:28,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:28,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:28,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:28,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:08:28,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-28 16:08:28,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 16:08:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 16:08:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 16:08:28,810 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand 4 states. [2018-11-28 16:08:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:28,913 INFO L93 Difference]: Finished difference Result 175 states and 249 transitions. [2018-11-28 16:08:28,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:08:28,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 16:08:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:28,915 INFO L225 Difference]: With dead ends: 175 [2018-11-28 16:08:28,916 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 16:08:28,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:08:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 16:08:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-11-28 16:08:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 16:08:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2018-11-28 16:08:28,933 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 56 [2018-11-28 16:08:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:28,933 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2018-11-28 16:08:28,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 16:08:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2018-11-28 16:08:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 16:08:28,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:28,936 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:28,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:28,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash -227603191, now seen corresponding path program 1 times [2018-11-28 16:08:28,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:28,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:28,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:29,122 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 16:08:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:29,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:29,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:29,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:29,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 16:08:29,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:08:29,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-11-28 16:08:29,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 16:08:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 16:08:29,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:08:29,361 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand 9 states. [2018-11-28 16:08:29,718 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 16:08:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:30,083 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2018-11-28 16:08:30,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 16:08:30,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-11-28 16:08:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:30,085 INFO L225 Difference]: With dead ends: 185 [2018-11-28 16:08:30,085 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 16:08:30,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-28 16:08:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 16:08:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-11-28 16:08:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 16:08:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2018-11-28 16:08:30,100 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 56 [2018-11-28 16:08:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:30,101 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2018-11-28 16:08:30,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 16:08:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2018-11-28 16:08:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 16:08:30,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:30,102 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:30,102 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:30,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash 743896390, now seen corresponding path program 1 times [2018-11-28 16:08:30,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:30,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:30,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:30,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:30,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:30,457 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 16:08:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:30,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:30,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:30,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:30,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 16:08:30,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:30,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 12 [2018-11-28 16:08:30,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 16:08:30,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 16:08:30,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:08:30,893 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 12 states. [2018-11-28 16:08:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:32,023 INFO L93 Difference]: Finished difference Result 190 states and 258 transitions. [2018-11-28 16:08:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 16:08:32,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-28 16:08:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:32,026 INFO L225 Difference]: With dead ends: 190 [2018-11-28 16:08:32,026 INFO L226 Difference]: Without dead ends: 113 [2018-11-28 16:08:32,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-11-28 16:08:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-28 16:08:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 79. [2018-11-28 16:08:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 16:08:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2018-11-28 16:08:32,043 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 57 [2018-11-28 16:08:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:32,043 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2018-11-28 16:08:32,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 16:08:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2018-11-28 16:08:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 16:08:32,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:32,045 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:32,045 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:32,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2063636268, now seen corresponding path program 1 times [2018-11-28 16:08:32,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:32,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:32,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:32,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:32,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:32,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:32,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:32,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:32,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:32,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 16:08:32,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:08:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:08:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:08:32,330 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand 5 states. [2018-11-28 16:08:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:32,492 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2018-11-28 16:08:32,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 16:08:32,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-28 16:08:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:32,495 INFO L225 Difference]: With dead ends: 157 [2018-11-28 16:08:32,495 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 16:08:32,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:08:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 16:08:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-11-28 16:08:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 16:08:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2018-11-28 16:08:32,517 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 58 [2018-11-28 16:08:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:32,518 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2018-11-28 16:08:32,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:08:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2018-11-28 16:08:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 16:08:32,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:32,519 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:32,519 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:32,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:32,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2121428149, now seen corresponding path program 1 times [2018-11-28 16:08:32,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:32,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:32,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:32,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:32,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:32,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:32,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:32,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:32,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 16:08:32,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:32,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2018-11-28 16:08:32,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 16:08:32,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 16:08:32,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:08:32,947 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand 11 states. [2018-11-28 16:08:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:33,407 INFO L93 Difference]: Finished difference Result 183 states and 241 transitions. [2018-11-28 16:08:33,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 16:08:33,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-28 16:08:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:33,410 INFO L225 Difference]: With dead ends: 183 [2018-11-28 16:08:33,410 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 16:08:33,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-28 16:08:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 16:08:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2018-11-28 16:08:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 16:08:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2018-11-28 16:08:33,423 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 60 [2018-11-28 16:08:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:33,424 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2018-11-28 16:08:33,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 16:08:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2018-11-28 16:08:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 16:08:33,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:33,425 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:33,425 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:33,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash 812533343, now seen corresponding path program 1 times [2018-11-28 16:08:33,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:33,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:33,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:33,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:33,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:33,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:33,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 16:08:33,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 16:08:33,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 16:08:33,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:08:33,786 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2018-11-28 16:08:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:34,243 INFO L93 Difference]: Finished difference Result 152 states and 191 transitions. [2018-11-28 16:08:34,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 16:08:34,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 16:08:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:34,246 INFO L225 Difference]: With dead ends: 152 [2018-11-28 16:08:34,246 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 16:08:34,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:08:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 16:08:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-11-28 16:08:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 16:08:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-11-28 16:08:34,259 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 66 [2018-11-28 16:08:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:34,260 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-11-28 16:08:34,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 16:08:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-11-28 16:08:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 16:08:34,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:34,261 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:34,261 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:34,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash 151306208, now seen corresponding path program 1 times [2018-11-28 16:08:34,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:34,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:34,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:34,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:34,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:34,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 16:08:34,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:34,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2018-11-28 16:08:34,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 16:08:34,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 16:08:34,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-11-28 16:08:34,673 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 15 states. [2018-11-28 16:08:35,528 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 16:08:36,222 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 16:08:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:36,724 INFO L93 Difference]: Finished difference Result 191 states and 248 transitions. [2018-11-28 16:08:36,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 16:08:36,725 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-11-28 16:08:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:36,727 INFO L225 Difference]: With dead ends: 191 [2018-11-28 16:08:36,727 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 16:08:36,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-11-28 16:08:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 16:08:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2018-11-28 16:08:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 16:08:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2018-11-28 16:08:36,746 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 68 [2018-11-28 16:08:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:36,746 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2018-11-28 16:08:36,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 16:08:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2018-11-28 16:08:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 16:08:36,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:36,748 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:36,748 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:36,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1869856774, now seen corresponding path program 1 times [2018-11-28 16:08:36,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:36,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:36,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:37,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:37,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:37,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:37,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:37,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:37,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 16:08:37,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:08:37,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:08:37,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:08:37,373 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand 7 states. [2018-11-28 16:08:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:37,650 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2018-11-28 16:08:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 16:08:37,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-11-28 16:08:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:37,654 INFO L225 Difference]: With dead ends: 199 [2018-11-28 16:08:37,654 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 16:08:37,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:08:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 16:08:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2018-11-28 16:08:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 16:08:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2018-11-28 16:08:37,680 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 69 [2018-11-28 16:08:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:37,680 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2018-11-28 16:08:37,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:08:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2018-11-28 16:08:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 16:08:37,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:37,683 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:37,684 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:37,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash -336734405, now seen corresponding path program 1 times [2018-11-28 16:08:37,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:37,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:37,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:38,517 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 16:08:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:38,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:38,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:38,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:38,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-28 16:08:39,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:39,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2018-11-28 16:08:39,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 16:08:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 16:08:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-11-28 16:08:39,080 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 16 states. [2018-11-28 16:08:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:40,732 INFO L93 Difference]: Finished difference Result 218 states and 285 transitions. [2018-11-28 16:08:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 16:08:40,735 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-11-28 16:08:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:40,738 INFO L225 Difference]: With dead ends: 218 [2018-11-28 16:08:40,738 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 16:08:40,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-11-28 16:08:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 16:08:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 99. [2018-11-28 16:08:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 16:08:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2018-11-28 16:08:40,757 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 71 [2018-11-28 16:08:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:40,757 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2018-11-28 16:08:40,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 16:08:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-11-28 16:08:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 16:08:40,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:40,759 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:40,759 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:40,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1685507205, now seen corresponding path program 1 times [2018-11-28 16:08:40,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:40,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:40,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:40,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:40,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:40,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:40,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:40,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:08:40,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:40,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 16:08:40,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 16:08:40,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 16:08:40,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 16:08:40,936 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand 8 states. [2018-11-28 16:08:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:41,476 INFO L93 Difference]: Finished difference Result 218 states and 285 transitions. [2018-11-28 16:08:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 16:08:41,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-11-28 16:08:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:41,480 INFO L225 Difference]: With dead ends: 218 [2018-11-28 16:08:41,481 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 16:08:41,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-28 16:08:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 16:08:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 101. [2018-11-28 16:08:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 16:08:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 132 transitions. [2018-11-28 16:08:41,499 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 132 transitions. Word has length 72 [2018-11-28 16:08:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:41,500 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 132 transitions. [2018-11-28 16:08:41,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 16:08:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2018-11-28 16:08:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 16:08:41,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:41,504 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:41,504 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:41,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1387490822, now seen corresponding path program 1 times [2018-11-28 16:08:41,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:41,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:41,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:41,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 16:08:41,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:41,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:08:41,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:41,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-28 16:08:41,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:41,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-28 16:08:41,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 16:08:41,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 16:08:41,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-11-28 16:08:41,945 INFO L87 Difference]: Start difference. First operand 101 states and 132 transitions. Second operand 16 states. [2018-11-28 16:08:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:42,984 INFO L93 Difference]: Finished difference Result 215 states and 283 transitions. [2018-11-28 16:08:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 16:08:42,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-11-28 16:08:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:42,986 INFO L225 Difference]: With dead ends: 215 [2018-11-28 16:08:42,986 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:08:42,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-11-28 16:08:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:08:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:08:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:08:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:08:42,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2018-11-28 16:08:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:42,990 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:08:42,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 16:08:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:08:42,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:08:42,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:08:43,165 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 96 [2018-11-28 16:08:43,318 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 96 [2018-11-28 16:08:43,476 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 98 [2018-11-28 16:08:43,628 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 98 [2018-11-28 16:08:44,594 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2018-11-28 16:08:45,271 WARN L180 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2018-11-28 16:08:49,703 WARN L180 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-11-28 16:08:50,203 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 22 [2018-11-28 16:08:50,229 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:08:50,229 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:08:50,229 INFO L448 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-28 16:08:50,229 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-28 16:08:50,229 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-28 16:08:50,229 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-28 16:08:50,229 INFO L448 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-28 16:08:50,229 INFO L451 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-28 16:08:50,229 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-28 16:08:50,230 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-28 16:08:50,230 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-28 16:08:50,230 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-28 16:08:50,230 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse0 (exists ((v_mulflt_~a_6 Int)) (< (mod v_mulflt_~a_6 4294967296) (mod |mulflt_#in~b| 4294967296)))) (.cse2 (= mulflt_~b |mulflt_#in~b|)) (.cse1 (= 0 mulflt_~__retres10~1))) (or (and .cse0 .cse1) (and .cse0 (= mulflt_~b |mulflt_#in~a|) (not (= (mod |mulflt_#in~a| 4294967296) 0))) (and (= mulflt_~a |mulflt_#in~a|) .cse2 (not (= 0 (mod |mulflt_#in~b| 4294967296)))) (and .cse2 .cse1))) [2018-11-28 16:08:50,230 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-28 16:08:50,230 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-28 16:08:50,230 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-28 16:08:50,230 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (let ((.cse0 (<= |base2flt_#in~e| base2flt_~e)) (.cse1 (<= base2flt_~e |base2flt_#in~e|))) (or (and (= 0 base2flt_~__retres4~0) .cse0 (= base2flt_~m |base2flt_#in~m|) .cse1) (or (<= (+ |base2flt_#in~m| 4261412865) 0) (<= 16777216 |base2flt_#in~m|)) (and .cse0 (<= (+ |base2flt_#in~e| 128) 0)) (and (<= 127 |base2flt_#in~e|) .cse1) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))))) [2018-11-28 16:08:50,231 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-28 16:08:50,231 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-28 16:08:50,231 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-28 16:08:50,231 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (and (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))) (<= base2flt_~e |base2flt_#in~e|)) [2018-11-28 16:08:50,231 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-28 16:08:50,231 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-28 16:08:50,231 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-28 16:08:50,231 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (or (let ((.cse1 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse1 1))) (and (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or (<= .cse0 0) (<= (+ (* 4294967296 .cse1) 16777216) |base2flt_#in~m|))))) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296))))) [2018-11-28 16:08:50,231 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-28 16:08:50,232 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (let ((.cse2 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse2 1))) (let ((.cse1 (<= .cse0 0))) (and (<= |base2flt_#in~e| base2flt_~e) (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or .cse1 (<= (+ (* 4294967296 .cse2) 16777216) |base2flt_#in~m|)) (or (<= base2flt_~m |base2flt_#in~m|) .cse1))))) [2018-11-28 16:08:50,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:08:50,232 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:08:50,232 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:08:50,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:08:50,232 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-28 16:08:50,232 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-28 16:08:50,232 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-28 16:08:50,232 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-28 16:08:50,232 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-28 16:08:50,233 INFO L448 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-28 16:08:50,233 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-28 16:08:50,233 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-28 16:08:50,233 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-28 16:08:50,233 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-28 16:08:50,233 INFO L448 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-28 16:08:50,233 INFO L451 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-11-28 16:08:50,233 INFO L448 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-28 16:08:50,233 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-28 16:08:50,233 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-28 16:08:50,234 INFO L444 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~tmp___0~0 0)) [2018-11-28 16:08:50,234 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-28 16:08:50,234 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-28 16:08:50,234 INFO L444 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (or (<= (+ main_~sb~0 1) 0) (and (<= (mod main_~b~0 4294967296) 0) (= 0 main_~zero~0)) (and (<= 1 main_~tmp~2) (<= 1 main_~sb~0))) [2018-11-28 16:08:50,234 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-28 16:08:50,234 INFO L444 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-28 16:08:50,234 INFO L448 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-28 16:08:50,234 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-28 16:08:50,234 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-28 16:08:50,234 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-28 16:08:50,235 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-28 16:08:50,235 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-28 16:08:50,235 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-28 16:08:50,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:08:50 BoogieIcfgContainer [2018-11-28 16:08:50,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:08:50,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:08:50,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:08:50,263 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:08:50,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:25" (3/4) ... [2018-11-28 16:08:50,268 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:08:50,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:08:50,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-28 16:08:50,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-28 16:08:50,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:08:50,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 16:08:50,283 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-28 16:08:50,284 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 16:08:50,284 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:08:50,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == __retres4 && \old(e) <= e) && m == \old(m)) && e <= \old(e)) || \old(m) + 4261412865 <= 0 || 16777216 <= \old(m)) || (\old(e) <= e && \old(e) + 128 <= 0)) || (127 <= \old(e) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-11-28 16:08:50,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) && e <= \old(e) [2018-11-28 16:08:50,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(e) <= e && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) [2018-11-28 16:08:50,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(m) <= m || 0 < m / 4294967296 + 1) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-11-28 16:08:50,316 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && 0 == __retres10) || (((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && b == \old(a)) && !(\old(a) % 4294967296 == 0))) || ((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296))) || (b == \old(b) && 0 == __retres10) [2018-11-28 16:08:50,382 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:08:50,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:08:50,383 INFO L168 Benchmark]: Toolchain (without parser) took 25741.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -68.4 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,384 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:08:50,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.82 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,385 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.50 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:08:50,385 INFO L168 Benchmark]: Boogie Preprocessor took 114.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,385 INFO L168 Benchmark]: RCFGBuilder took 643.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,386 INFO L168 Benchmark]: TraceAbstraction took 24357.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 435.2 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:50,386 INFO L168 Benchmark]: Witness Printer took 119.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 16:08:50,388 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 456.82 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.50 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 643.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24357.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 435.2 MB. Max. memory is 11.5 GB. * Witness Printer took 119.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-11-28 16:08:50,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: ((\old(m) <= m || 0 < m / 4294967296 + 1) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 18]: Loop Invariant [2018-11-28 16:08:50,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: ((((((0 == __retres4 && \old(e) <= e) && m == \old(m)) && e <= \old(e)) || \old(m) + 4261412865 <= 0 || 16777216 <= \old(m)) || (\old(e) <= e && \old(e) + 128 <= 0)) || (127 <= \old(e) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 147]: Loop Invariant [2018-11-28 16:08:50,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-28 16:08:50,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] Derived loop invariant: ((((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && 0 == __retres10) || (((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && b == \old(a)) && !(\old(a) % 4294967296 == 0))) || ((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296))) || (b == \old(b) && 0 == __retres10) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((\old(e) <= e && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) - InvariantResult [Line: 27]: Loop Invariant [2018-11-28 16:08:50,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-28 16:08:50,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) && e <= \old(e) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. SAFE Result, 24.2s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 7.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 942 SDtfs, 601 SDslu, 5111 SDs, 0 SdLazy, 2742 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 993 GetRequests, 808 SyntacticMatches, 8 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 241 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 334 PreInvPairs, 900 NumberOfFragments, 261 HoareAnnotationTreeSize, 334 FomulaSimplifications, 1989200 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 18 FomulaSimplificationsInter, 11290 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1722 NumberOfCodeBlocks, 1722 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1694 ConstructedInterpolants, 19 QuantifiedInterpolants, 223304 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2232 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 728/1074 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...