/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label00.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:50:20,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:50:20,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:50:20,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:50:20,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:50:20,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:50:20,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:50:20,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:50:20,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:50:20,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:50:20,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:50:20,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:50:20,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:50:20,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:50:20,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:50:20,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:50:20,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:50:20,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:50:20,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:50:20,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:50:20,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:50:20,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:50:20,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:50:20,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:50:20,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:50:20,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:50:20,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:50:20,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:50:20,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:50:20,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:50:20,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:50:20,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:50:20,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:50:20,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:50:20,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:50:20,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:50:20,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:50:20,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:50:20,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:50:20,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:50:20,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:50:20,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:50:20,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:50:20,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:50:20,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:50:20,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:50:20,514 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:50:20,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:50:20,515 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:50:20,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:50:20,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:50:20,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:50:20,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:50:20,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:50:20,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:50:20,517 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:50:20,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:50:20,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:50:20,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:50:20,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:50:20,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:50:20,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:50:20,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:50:20,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:50:20,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:50:20,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:50:20,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:50:20,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:50:20,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:50:20,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:50:20,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:50:20,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:50:20,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:50:20,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:50:20,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:50:20,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:50:20,794 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:50:20,795 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label00.c [2019-11-23 20:50:20,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f1560b/0de25820235349d79d71421009e95e4d/FLAG0b0dd3da2 [2019-11-23 20:50:21,450 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:50:21,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label00.c [2019-11-23 20:50:21,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f1560b/0de25820235349d79d71421009e95e4d/FLAG0b0dd3da2 [2019-11-23 20:50:21,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785f1560b/0de25820235349d79d71421009e95e4d [2019-11-23 20:50:21,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:50:21,726 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:50:21,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:50:21,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:50:21,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:50:21,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:21" (1/1) ... [2019-11-23 20:50:21,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634a231b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:21, skipping insertion in model container [2019-11-23 20:50:21,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:21" (1/1) ... [2019-11-23 20:50:21,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:50:21,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:50:22,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:50:22,429 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:50:22,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:50:22,532 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:50:22,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22 WrapperNode [2019-11-23 20:50:22,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:50:22,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:50:22,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:50:22,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:50:22,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:50:22,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:50:22,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:50:22,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:50:22,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (1/1) ... [2019-11-23 20:50:22,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:50:22,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:50:22,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:50:22,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:50:22,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (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 [2019-11-23 20:50:22,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:50:22,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:50:23,995 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:50:23,995 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:50:23,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:23 BoogieIcfgContainer [2019-11-23 20:50:23,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:50:23,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:50:23,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:50:24,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:50:24,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:50:21" (1/3) ... [2019-11-23 20:50:24,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26834f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:50:24, skipping insertion in model container [2019-11-23 20:50:24,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:22" (2/3) ... [2019-11-23 20:50:24,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26834f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:50:24, skipping insertion in model container [2019-11-23 20:50:24,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:23" (3/3) ... [2019-11-23 20:50:24,004 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label00.c [2019-11-23 20:50:24,013 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:50:24,020 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:50:24,032 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:50:24,059 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:50:24,059 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:50:24,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:50:24,060 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:50:24,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:50:24,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:50:24,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:50:24,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:50:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:50:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 20:50:24,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:24,095 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:24,096 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1766677921, now seen corresponding path program 1 times [2019-11-23 20:50:24,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:24,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424004425] [2019-11-23 20:50:24,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:24,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424004425] [2019-11-23 20:50:24,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:24,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:50:24,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443307095] [2019-11-23 20:50:24,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:24,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:24,660 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:50:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:25,919 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:50:25,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:50:25,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-23 20:50:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:25,938 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:50:25,938 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:50:25,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:50:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-23 20:50:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-23 20:50:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-23 20:50:26,016 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 108 [2019-11-23 20:50:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:26,017 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-23 20:50:26,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:50:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-23 20:50:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-23 20:50:26,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:26,022 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:26,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1731030898, now seen corresponding path program 1 times [2019-11-23 20:50:26,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:26,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938467649] [2019-11-23 20:50:26,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:26,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938467649] [2019-11-23 20:50:26,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:26,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:50:26,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955527556] [2019-11-23 20:50:26,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:26,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:26,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:26,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:26,087 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-23 20:50:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:26,902 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-23 20:50:26,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:50:26,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-23 20:50:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:26,909 INFO L225 Difference]: With dead ends: 1054 [2019-11-23 20:50:26,909 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:50:26,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:50:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:50:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:50:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-23 20:50:26,954 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 114 [2019-11-23 20:50:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:26,955 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-23 20:50:26,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:50:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-23 20:50:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 20:50:26,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:26,960 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:26,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1128519054, now seen corresponding path program 1 times [2019-11-23 20:50:26,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:26,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324762137] [2019-11-23 20:50:26,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:27,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324762137] [2019-11-23 20:50:27,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:27,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:50:27,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705239957] [2019-11-23 20:50:27,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:27,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:27,151 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2019-11-23 20:50:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:28,000 INFO L93 Difference]: Finished difference Result 1578 states and 2134 transitions. [2019-11-23 20:50:28,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:50:28,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-23 20:50:28,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:28,007 INFO L225 Difference]: With dead ends: 1578 [2019-11-23 20:50:28,007 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:50:28,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:50:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:50:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:50:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 994 transitions. [2019-11-23 20:50:28,030 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 994 transitions. Word has length 115 [2019-11-23 20:50:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:28,030 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 994 transitions. [2019-11-23 20:50:28,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:50:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 994 transitions. [2019-11-23 20:50:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-23 20:50:28,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:28,035 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:28,035 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:28,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash -544120587, now seen corresponding path program 1 times [2019-11-23 20:50:28,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:28,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816663946] [2019-11-23 20:50:28,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:50:28,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816663946] [2019-11-23 20:50:28,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:28,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:50:28,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216243256] [2019-11-23 20:50:28,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:28,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:28,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:28,103 INFO L87 Difference]: Start difference. First operand 790 states and 994 transitions. Second operand 3 states. [2019-11-23 20:50:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:28,617 INFO L93 Difference]: Finished difference Result 2233 states and 2809 transitions. [2019-11-23 20:50:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:28,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-23 20:50:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:28,675 INFO L225 Difference]: With dead ends: 2233 [2019-11-23 20:50:28,675 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:50:28,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:50:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-23 20:50:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-23 20:50:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1429 transitions. [2019-11-23 20:50:28,714 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1429 transitions. Word has length 126 [2019-11-23 20:50:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:28,715 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1429 transitions. [2019-11-23 20:50:28,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1429 transitions. [2019-11-23 20:50:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 20:50:28,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:28,718 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:28,719 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1267766409, now seen corresponding path program 1 times [2019-11-23 20:50:28,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:28,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713118969] [2019-11-23 20:50:28,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 20:50:28,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713118969] [2019-11-23 20:50:28,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:28,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:50:28,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294331081] [2019-11-23 20:50:28,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:28,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:28,849 INFO L87 Difference]: Start difference. First operand 1183 states and 1429 transitions. Second operand 4 states. [2019-11-23 20:50:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:29,484 INFO L93 Difference]: Finished difference Result 2500 states and 3010 transitions. [2019-11-23 20:50:29,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:50:29,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-23 20:50:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:29,491 INFO L225 Difference]: With dead ends: 2500 [2019-11-23 20:50:29,492 INFO L226 Difference]: Without dead ends: 1319 [2019-11-23 20:50:29,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:50:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-23 20:50:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2019-11-23 20:50:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-23 20:50:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1566 transitions. [2019-11-23 20:50:29,528 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1566 transitions. Word has length 134 [2019-11-23 20:50:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:29,529 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1566 transitions. [2019-11-23 20:50:29,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:50:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1566 transitions. [2019-11-23 20:50:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-23 20:50:29,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:29,533 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:29,534 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:29,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1620959425, now seen corresponding path program 1 times [2019-11-23 20:50:29,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:29,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264668436] [2019-11-23 20:50:29,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 20:50:29,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264668436] [2019-11-23 20:50:29,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:29,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:50:29,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370288497] [2019-11-23 20:50:29,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:50:29,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:29,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:50:29,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:50:29,674 INFO L87 Difference]: Start difference. First operand 1314 states and 1566 transitions. Second operand 5 states. [2019-11-23 20:50:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:30,627 INFO L93 Difference]: Finished difference Result 2626 states and 3160 transitions. [2019-11-23 20:50:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:50:30,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-11-23 20:50:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:30,635 INFO L225 Difference]: With dead ends: 2626 [2019-11-23 20:50:30,635 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:50:30,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:50:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:50:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-23 20:50:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:50:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1691 transitions. [2019-11-23 20:50:30,672 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1691 transitions. Word has length 138 [2019-11-23 20:50:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:30,672 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1691 transitions. [2019-11-23 20:50:30,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:50:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1691 transitions. [2019-11-23 20:50:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 20:50:30,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:30,676 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:30,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash -633054500, now seen corresponding path program 1 times [2019-11-23 20:50:30,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:30,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769778150] [2019-11-23 20:50:30,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 20:50:30,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769778150] [2019-11-23 20:50:30,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:30,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:50:30,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219758557] [2019-11-23 20:50:30,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:30,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:30,750 INFO L87 Difference]: Start difference. First operand 1445 states and 1691 transitions. Second operand 3 states. [2019-11-23 20:50:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:31,202 INFO L93 Difference]: Finished difference Result 3281 states and 3857 transitions. [2019-11-23 20:50:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:31,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-23 20:50:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:31,210 INFO L225 Difference]: With dead ends: 3281 [2019-11-23 20:50:31,211 INFO L226 Difference]: Without dead ends: 1707 [2019-11-23 20:50:31,213 INFO L630 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 [2019-11-23 20:50:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-23 20:50:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-23 20:50:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:50:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1559 transitions. [2019-11-23 20:50:31,242 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1559 transitions. Word has length 141 [2019-11-23 20:50:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:31,242 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1559 transitions. [2019-11-23 20:50:31,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1559 transitions. [2019-11-23 20:50:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 20:50:31,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:31,246 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2019-11-23 20:50:31,247 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 728477792, now seen corresponding path program 1 times [2019-11-23 20:50:31,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:31,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827537516] [2019-11-23 20:50:31,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 20:50:31,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827537516] [2019-11-23 20:50:31,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:31,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:50:31,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420492402] [2019-11-23 20:50:31,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:31,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:31,329 INFO L87 Difference]: Start difference. First operand 1445 states and 1559 transitions. Second operand 3 states. [2019-11-23 20:50:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:31,826 INFO L93 Difference]: Finished difference Result 3543 states and 3847 transitions. [2019-11-23 20:50:31,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:31,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 20:50:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:31,834 INFO L225 Difference]: With dead ends: 3543 [2019-11-23 20:50:31,835 INFO L226 Difference]: Without dead ends: 2231 [2019-11-23 20:50:31,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-23 20:50:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1838. [2019-11-23 20:50:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:50:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1972 transitions. [2019-11-23 20:50:31,874 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1972 transitions. Word has length 156 [2019-11-23 20:50:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:31,874 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1972 transitions. [2019-11-23 20:50:31,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1972 transitions. [2019-11-23 20:50:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 20:50:31,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:31,880 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 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] [2019-11-23 20:50:31,880 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash -519802284, now seen corresponding path program 1 times [2019-11-23 20:50:31,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:31,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406753993] [2019-11-23 20:50:31,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:50:32,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406753993] [2019-11-23 20:50:32,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924878173] [2019-11-23 20:50:32,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:32,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:50:32,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-23 20:50:32,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:50:32,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:50:32,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497116553] [2019-11-23 20:50:32,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:32,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:50:32,257 INFO L87 Difference]: Start difference. First operand 1838 states and 1972 transitions. Second operand 3 states. [2019-11-23 20:50:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:32,675 INFO L93 Difference]: Finished difference Result 1969 states and 2119 transitions. [2019-11-23 20:50:32,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:32,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-23 20:50:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:32,676 INFO L225 Difference]: With dead ends: 1969 [2019-11-23 20:50:32,677 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:50:32,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:50:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:50:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:50:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:50:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:50:32,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2019-11-23 20:50:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:32,680 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:50:32,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:50:32,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:50:32,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:32,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:50:33,096 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:50:33,096 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:50:33,096 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,096 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,096 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:50:33,097 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:50:33,098 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:50:33,098 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:50:33,098 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:50:33,098 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:50:33,098 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,098 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,098 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,099 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,099 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,099 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,099 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:50:33,099 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:50:33,099 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:50:33,100 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:50:33,101 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:50:33,101 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:50:33,101 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:50:33,101 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,101 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,101 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,101 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,102 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,102 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:50:33,102 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:50:33,102 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:50:33,102 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:50:33,102 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:50:33,102 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:50:33,102 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:50:33,103 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:50:33,103 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:50:33,103 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (not (= ~a16~0 5)))) (or (and .cse0 .cse1) (and .cse0 (<= ~a21~0 0) .cse2) (= ~a16~0 4) (and .cse2 (= ~a21~0 1) .cse1) (not (= 13 ~a8~0)))) [2019-11-23 20:50:33,103 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,103 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:50:33,104 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:50:33,105 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:50:33,105 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:50:33,105 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:50:33,105 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:50:33,105 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:50:33,105 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:50:33,105 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:50:33,106 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:50:33,106 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,106 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,106 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,106 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,106 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,106 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:50:33,106 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,107 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,108 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,108 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,108 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:50:33,108 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,108 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:50:33,108 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:50:33,108 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:50:33,108 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:50:33,109 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:50:33,110 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:50:33,110 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,110 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (not (= ~a16~0 5)))) (or (and .cse0 .cse1) (and .cse0 (<= ~a21~0 0) .cse2) (= ~a16~0 4) (and .cse2 (= ~a21~0 1) .cse1) (not (= 13 ~a8~0)))) [2019-11-23 20:50:33,110 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,110 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,110 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,110 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,110 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:50:33,110 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:50:33,111 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:50:33,111 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:50:33,111 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:50:33,111 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:50:33,111 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:50:33,111 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:50:33,111 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,111 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:50:33,112 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,113 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:50:33,114 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:50:33,115 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:50:33,115 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:50:33,115 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:50:33,115 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:50:33,115 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:50:33,116 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:50:33,116 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:50:33,116 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:50:33,116 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:50:33,116 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,116 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,116 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:50:33,117 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:50:33,118 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:50:33,118 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:50:33,118 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:50:33,118 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:50:33,118 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:50:33,118 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:50:33,118 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 500) no Hoare annotation was computed. [2019-11-23 20:50:33,118 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:33,119 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:50:33,120 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:50:33,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:50:33 BoogieIcfgContainer [2019-11-23 20:50:33,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:50:33,149 INFO L168 Benchmark]: Toolchain (without parser) took 11423.00 ms. Allocated memory was 137.9 MB in the beginning and 391.1 MB in the end (delta: 253.2 MB). Free memory was 100.6 MB in the beginning and 271.4 MB in the end (delta: -170.8 MB). Peak memory consumption was 82.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:33,150 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:50:33,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.92 ms. Allocated memory was 137.9 MB in the beginning and 208.7 MB in the end (delta: 70.8 MB). Free memory was 100.4 MB in the beginning and 174.6 MB in the end (delta: -74.2 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:33,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.27 ms. Allocated memory is still 208.7 MB. Free memory was 174.6 MB in the beginning and 168.8 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:33,155 INFO L168 Benchmark]: Boogie Preprocessor took 62.60 ms. Allocated memory is still 208.7 MB. Free memory was 168.8 MB in the beginning and 163.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:33,158 INFO L168 Benchmark]: RCFGBuilder took 1320.56 ms. Allocated memory was 208.7 MB in the beginning and 239.6 MB in the end (delta: 30.9 MB). Free memory was 163.6 MB in the beginning and 173.2 MB in the end (delta: -9.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:33,161 INFO L168 Benchmark]: TraceAbstraction took 9147.15 ms. Allocated memory was 239.6 MB in the beginning and 391.1 MB in the end (delta: 151.5 MB). Free memory was 173.2 MB in the beginning and 271.4 MB in the end (delta: -98.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:33,167 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.92 ms. Allocated memory was 137.9 MB in the beginning and 208.7 MB in the end (delta: 70.8 MB). Free memory was 100.4 MB in the beginning and 174.6 MB in the end (delta: -74.2 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.27 ms. Allocated memory is still 208.7 MB. Free memory was 174.6 MB in the beginning and 168.8 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.60 ms. Allocated memory is still 208.7 MB. Free memory was 168.8 MB in the beginning and 163.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1320.56 ms. Allocated memory was 208.7 MB in the beginning and 239.6 MB in the end (delta: 30.9 MB). Free memory was 163.6 MB in the beginning and 173.2 MB in the end (delta: -9.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9147.15 ms. Allocated memory was 239.6 MB in the beginning and 391.1 MB in the end (delta: 151.5 MB). Free memory was 173.2 MB in the beginning and 271.4 MB in the end (delta: -98.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 500]: 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: 30]: Loop Invariant Derived loop invariant: ((((1 == a7 && !(a16 == 5)) || ((1 == a7 && a21 <= 0) && a17 == 1)) || a16 == 4) || ((a17 == 1 && a21 == 1) && !(a16 == 5))) || !(13 == a8) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((1 == a7 && !(a16 == 5)) || ((1 == a7 && a21 <= 0) && a17 == 1)) || a16 == 4) || ((a17 == 1 && a21 == 1) && !(a16 == 5))) || !(13 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 830 SDtfs, 1953 SDslu, 93 SDs, 0 SdLazy, 4427 SolverSat, 786 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 75 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1188 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 162 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1402 NumberOfCodeBlocks, 1402 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 487642 SizeOfPredicates, 1 NumberOfNonLiveVariables, 329 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 450/477 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...