/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_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:53:20,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:53:20,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:53:20,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:53:20,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:53:20,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:53:20,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:53:20,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:53:20,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:53:20,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:53:20,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:53:20,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:53:20,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:53:20,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:53:20,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:53:20,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:53:20,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:53:20,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:53:20,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:53:20,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:53:20,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:53:20,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:53:20,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:53:20,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:53:20,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:53:20,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:53:20,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:53:20,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:53:20,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:53:20,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:53:20,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:53:20,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:53:20,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:53:20,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:53:20,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:53:20,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:53:20,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:53:20,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:53:20,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:53:20,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:53:20,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:53:20,700 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:53:20,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:53:20,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:53:20,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:53:20,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:53:20,733 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:53:20,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:53:20,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:53:20,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:53:20,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:53:20,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:53:20,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:53:20,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:53:20,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:53:20,739 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:53:20,739 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:53:20,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:53:20,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:53:20,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:53:20,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:53:20,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:53:20,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:53:20,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:53:20,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:53:20,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:53:20,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:53:20,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:53:20,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:53:20,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:53:20,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:53:20,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:53:21,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:53:21,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:53:21,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:53:21,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:53:21,052 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:53:21,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label59.c [2019-11-23 20:53:21,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3f7214e/f0886008f92c4c909032e79f8c757da5/FLAGe848aae98 [2019-11-23 20:53:21,717 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:53:21,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label59.c [2019-11-23 20:53:21,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3f7214e/f0886008f92c4c909032e79f8c757da5/FLAGe848aae98 [2019-11-23 20:53:22,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3f7214e/f0886008f92c4c909032e79f8c757da5 [2019-11-23 20:53:22,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:53:22,032 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:53:22,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:22,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:53:22,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:53:22,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:22,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2372ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22, skipping insertion in model container [2019-11-23 20:53:22,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:22,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:53:22,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:53:22,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:22,656 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:53:22,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:22,810 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:53:22,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22 WrapperNode [2019-11-23 20:53:22,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:22,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:22,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:53:22,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:53:22,824 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:53:22" (1/1) ... [2019-11-23 20:53:22,867 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:53:22" (1/1) ... [2019-11-23 20:53:22,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:22,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:53:22,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:53:22,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:53:22,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:22,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:22,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:22,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:23,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:23,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:23,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22" (1/1) ... [2019-11-23 20:53:23,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:53:23,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:53:23,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:53:23,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:53:23,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53: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:53:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:53:23,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:53:24,421 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:53:24,421 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:53:24,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:24 BoogieIcfgContainer [2019-11-23 20:53:24,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:53:24,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:53:24,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:53:24,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:53:24,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:53:22" (1/3) ... [2019-11-23 20:53:24,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d249bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:24, skipping insertion in model container [2019-11-23 20:53:24,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:22" (2/3) ... [2019-11-23 20:53:24,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d249bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:24, skipping insertion in model container [2019-11-23 20:53:24,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:24" (3/3) ... [2019-11-23 20:53:24,436 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label59.c [2019-11-23 20:53:24,446 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:53:24,455 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:53:24,467 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:53:24,517 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:53:24,518 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:53:24,518 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:53:24,518 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:53:24,519 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:53:24,520 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:53:24,520 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:53:24,520 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:53:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:53:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 20:53:24,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:24,570 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] [2019-11-23 20:53:24,570 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:24,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash 806224438, now seen corresponding path program 1 times [2019-11-23 20:53:24,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:24,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988834157] [2019-11-23 20:53:24,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:25,006 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:53:25,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988834157] [2019-11-23 20:53:25,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:25,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:25,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041954684] [2019-11-23 20:53:25,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:25,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:25,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:25,034 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:53:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:26,267 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:53:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:26,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-23 20:53:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:26,285 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:53:26,286 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:53:26,290 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:53:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:53:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-23 20:53:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-23 20:53:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-23 20:53:26,362 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 89 [2019-11-23 20:53:26,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:26,363 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-23 20:53:26,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-23 20:53:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 20:53:26,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:26,368 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] [2019-11-23 20:53:26,368 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:26,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1182931709, now seen corresponding path program 1 times [2019-11-23 20:53:26,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:26,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758872630] [2019-11-23 20:53:26,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:26,509 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:53:26,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758872630] [2019-11-23 20:53:26,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:26,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:26,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754765028] [2019-11-23 20:53:26,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:26,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:26,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:26,514 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 3 states. [2019-11-23 20:53:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:27,139 INFO L93 Difference]: Finished difference Result 1185 states and 1654 transitions. [2019-11-23 20:53:27,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:27,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-23 20:53:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:27,146 INFO L225 Difference]: With dead ends: 1185 [2019-11-23 20:53:27,146 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:53:27,150 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:53:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:53:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-23 20:53:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-23 20:53:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-23 20:53:27,188 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 96 [2019-11-23 20:53:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:27,189 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-23 20:53:27,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-23 20:53:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 20:53:27,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:27,193 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:53:27,194 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2032630224, now seen corresponding path program 1 times [2019-11-23 20:53:27,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:27,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268895402] [2019-11-23 20:53:27,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:53:27,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268895402] [2019-11-23 20:53:27,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:27,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:27,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478594179] [2019-11-23 20:53:27,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:27,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:27,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:27,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:27,263 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-23 20:53:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:27,899 INFO L93 Difference]: Finished difference Result 1971 states and 2548 transitions. [2019-11-23 20:53:27,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:27,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 20:53:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:27,905 INFO L225 Difference]: With dead ends: 1971 [2019-11-23 20:53:27,906 INFO L226 Difference]: Without dead ends: 1183 [2019-11-23 20:53:27,908 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:53:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-23 20:53:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2019-11-23 20:53:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-23 20:53:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1485 transitions. [2019-11-23 20:53:27,974 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1485 transitions. Word has length 102 [2019-11-23 20:53:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:27,975 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1485 transitions. [2019-11-23 20:53:27,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1485 transitions. [2019-11-23 20:53:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 20:53:27,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:27,992 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:27,992 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:27,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1446444757, now seen corresponding path program 1 times [2019-11-23 20:53:27,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:27,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995447412] [2019-11-23 20:53:27,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:53:28,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995447412] [2019-11-23 20:53:28,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:28,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:53:28,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751173696] [2019-11-23 20:53:28,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:28,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:28,084 INFO L87 Difference]: Start difference. First operand 1183 states and 1485 transitions. Second operand 3 states. [2019-11-23 20:53:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:28,651 INFO L93 Difference]: Finished difference Result 3019 states and 3821 transitions. [2019-11-23 20:53:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:28,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 20:53:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:28,660 INFO L225 Difference]: With dead ends: 3019 [2019-11-23 20:53:28,660 INFO L226 Difference]: Without dead ends: 1707 [2019-11-23 20:53:28,663 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:53:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-23 20:53:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-23 20:53:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:53:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1661 transitions. [2019-11-23 20:53:28,702 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1661 transitions. Word has length 104 [2019-11-23 20:53:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:28,702 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1661 transitions. [2019-11-23 20:53:28,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1661 transitions. [2019-11-23 20:53:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-23 20:53:28,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:28,705 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-23 20:53:28,706 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1854334615, now seen corresponding path program 1 times [2019-11-23 20:53:28,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:28,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178532619] [2019-11-23 20:53:28,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:53:28,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178532619] [2019-11-23 20:53:28,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:28,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:28,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990155128] [2019-11-23 20:53:28,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:28,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:28,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:28,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:28,838 INFO L87 Difference]: Start difference. First operand 1445 states and 1661 transitions. Second operand 4 states. [2019-11-23 20:53:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:29,397 INFO L93 Difference]: Finished difference Result 3024 states and 3467 transitions. [2019-11-23 20:53:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:29,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-23 20:53:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:29,405 INFO L225 Difference]: With dead ends: 3024 [2019-11-23 20:53:29,405 INFO L226 Difference]: Without dead ends: 1581 [2019-11-23 20:53:29,407 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:53:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2019-11-23 20:53:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1576. [2019-11-23 20:53:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-23 20:53:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1795 transitions. [2019-11-23 20:53:29,440 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1795 transitions. Word has length 112 [2019-11-23 20:53:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:29,440 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1795 transitions. [2019-11-23 20:53:29,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1795 transitions. [2019-11-23 20:53:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-23 20:53:29,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:29,443 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-23 20:53:29,444 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1664786527, now seen corresponding path program 1 times [2019-11-23 20:53:29,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:29,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330913639] [2019-11-23 20:53:29,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:29,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330913639] [2019-11-23 20:53:29,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:29,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:29,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078762171] [2019-11-23 20:53:29,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:29,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:29,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:29,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:29,532 INFO L87 Difference]: Start difference. First operand 1576 states and 1795 transitions. Second operand 4 states. [2019-11-23 20:53:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:30,207 INFO L93 Difference]: Finished difference Result 3805 states and 4379 transitions. [2019-11-23 20:53:30,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:30,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-23 20:53:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:30,219 INFO L225 Difference]: With dead ends: 3805 [2019-11-23 20:53:30,220 INFO L226 Difference]: Without dead ends: 2362 [2019-11-23 20:53:30,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:53:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-23 20:53:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-11-23 20:53:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:53:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-11-23 20:53:30,264 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 116 [2019-11-23 20:53:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:30,264 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-11-23 20:53:30,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-11-23 20:53:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 20:53:30,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:30,268 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:30,268 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2107396270, now seen corresponding path program 1 times [2019-11-23 20:53:30,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:30,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827075268] [2019-11-23 20:53:30,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:30,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827075268] [2019-11-23 20:53:30,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:30,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 20:53:30,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149256554] [2019-11-23 20:53:30,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:53:30,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:53:30,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:53:30,512 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 8 states. [2019-11-23 20:53:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:31,419 INFO L93 Difference]: Finished difference Result 3716 states and 4094 transitions. [2019-11-23 20:53:31,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:53:31,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-11-23 20:53:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:31,428 INFO L225 Difference]: With dead ends: 3716 [2019-11-23 20:53:31,428 INFO L226 Difference]: Without dead ends: 2142 [2019-11-23 20:53:31,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:53:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-23 20:53:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-11-23 20:53:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:53:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2009 transitions. [2019-11-23 20:53:31,471 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2009 transitions. Word has length 122 [2019-11-23 20:53:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:31,471 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2009 transitions. [2019-11-23 20:53:31,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:53:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2009 transitions. [2019-11-23 20:53:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 20:53:31,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:31,475 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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] [2019-11-23 20:53:31,475 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1246749755, now seen corresponding path program 1 times [2019-11-23 20:53:31,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:31,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559984985] [2019-11-23 20:53:31,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:31,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559984985] [2019-11-23 20:53:31,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:31,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:31,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672141430] [2019-11-23 20:53:31,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:31,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:31,647 INFO L87 Difference]: Start difference. First operand 1838 states and 2009 transitions. Second operand 4 states. [2019-11-23 20:53:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:32,332 INFO L93 Difference]: Finished difference Result 3805 states and 4174 transitions. [2019-11-23 20:53:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:32,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 20:53:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:32,341 INFO L225 Difference]: With dead ends: 3805 [2019-11-23 20:53:32,342 INFO L226 Difference]: Without dead ends: 2100 [2019-11-23 20:53:32,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:53:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-23 20:53:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-11-23 20:53:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-23 20:53:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2260 transitions. [2019-11-23 20:53:32,387 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2260 transitions. Word has length 148 [2019-11-23 20:53:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:32,387 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2260 transitions. [2019-11-23 20:53:32,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2260 transitions. [2019-11-23 20:53:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 20:53:32,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:32,392 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-23 20:53:32,393 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:32,393 INFO L82 PathProgramCache]: Analyzing trace with hash 691080292, now seen corresponding path program 1 times [2019-11-23 20:53:32,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:32,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961704738] [2019-11-23 20:53:32,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:33,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961704738] [2019-11-23 20:53:33,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:33,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 20:53:33,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896530335] [2019-11-23 20:53:33,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:53:33,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:53:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:53:33,018 INFO L87 Difference]: Start difference. First operand 2100 states and 2260 transitions. Second operand 13 states. [2019-11-23 20:53:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:34,635 INFO L93 Difference]: Finished difference Result 4515 states and 4867 transitions. [2019-11-23 20:53:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:53:34,635 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2019-11-23 20:53:34,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:34,645 INFO L225 Difference]: With dead ends: 4515 [2019-11-23 20:53:34,645 INFO L226 Difference]: Without dead ends: 2400 [2019-11-23 20:53:34,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:53:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2019-11-23 20:53:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2135. [2019-11-23 20:53:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-11-23 20:53:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2292 transitions. [2019-11-23 20:53:34,691 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2292 transitions. Word has length 161 [2019-11-23 20:53:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:34,692 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2292 transitions. [2019-11-23 20:53:34,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:53:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2292 transitions. [2019-11-23 20:53:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 20:53:34,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:34,696 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-23 20:53:34,696 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2108776820, now seen corresponding path program 1 times [2019-11-23 20:53:34,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:34,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670133576] [2019-11-23 20:53:34,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:34,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670133576] [2019-11-23 20:53:34,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:34,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 20:53:34,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806689280] [2019-11-23 20:53:34,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:53:34,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:34,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:53:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:53:34,845 INFO L87 Difference]: Start difference. First operand 2135 states and 2292 transitions. Second operand 6 states. [2019-11-23 20:53:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:35,812 INFO L93 Difference]: Finished difference Result 4152 states and 4463 transitions. [2019-11-23 20:53:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:35,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-11-23 20:53:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:35,827 INFO L225 Difference]: With dead ends: 4152 [2019-11-23 20:53:35,827 INFO L226 Difference]: Without dead ends: 2150 [2019-11-23 20:53:35,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:53:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-11-23 20:53:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2135. [2019-11-23 20:53:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-11-23 20:53:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2269 transitions. [2019-11-23 20:53:35,866 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2269 transitions. Word has length 163 [2019-11-23 20:53:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:35,867 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2269 transitions. [2019-11-23 20:53:35,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:53:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2269 transitions. [2019-11-23 20:53:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 20:53:35,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:35,879 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-23 20:53:35,879 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:35,880 INFO L82 PathProgramCache]: Analyzing trace with hash -263540360, now seen corresponding path program 1 times [2019-11-23 20:53:35,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:35,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552623406] [2019-11-23 20:53:35,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 20:53:36,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552623406] [2019-11-23 20:53:36,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:36,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:36,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599651441] [2019-11-23 20:53:36,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:36,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:36,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:36,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:36,051 INFO L87 Difference]: Start difference. First operand 2135 states and 2269 transitions. Second operand 4 states. [2019-11-23 20:53:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:36,730 INFO L93 Difference]: Finished difference Result 4921 states and 5237 transitions. [2019-11-23 20:53:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:36,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-23 20:53:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:36,732 INFO L225 Difference]: With dead ends: 4921 [2019-11-23 20:53:36,732 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:53:36,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:53:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:53:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:53:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:53:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:53:36,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-11-23 20:53:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:36,738 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:53:36,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:53:36,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:53:36,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:53:37,375 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-11-23 20:53:37,863 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-11-23 20:53:37,866 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:53:37,866 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:53:37,867 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:53:37,868 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:53:37,868 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:53:37,868 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:53:37,868 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,868 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,868 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,868 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,868 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,869 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,869 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:53:37,869 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:53:37,869 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:53:37,869 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:53:37,869 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:53:37,870 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:53:37,871 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:53:37,872 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:53:37,872 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:53:37,872 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:53:37,872 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:53:37,872 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse10 (= ~a20~0 1)) (.cse1 (= 15 ~a8~0))) (let ((.cse2 (= ~a16~0 5)) (.cse0 (= 1 ~a7~0)) (.cse9 (not .cse1)) (.cse8 (= ~a16~0 4)) (.cse3 (not .cse10)) (.cse11 (= 13 ~a8~0)) (.cse4 (= ~a17~0 1)) (.cse5 (= ~a12~0 8)) (.cse7 (<= ~a17~0 0)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and (= 2 ULTIMATE.start_calculate_output_~input) .cse3 .cse4 .cse5 .cse6 .cse1) (and .cse7 .cse2) (and .cse4 .cse5 .cse6 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2) (and .cse8 .cse9 .cse7) (and .cse0 .cse4 .cse6) (and .cse8 .cse9 .cse5 .cse4 .cse6 .cse10) (and .cse0 .cse11) (and .cse0 .cse9 .cse7) (and .cse3 .cse4 .cse5 .cse6 .cse1 (not .cse8)) (and .cse3 .cse4 .cse5 .cse6 .cse1 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (and .cse11 .cse5 .cse4 .cse6 .cse10) (and .cse5 .cse7 .cse6 .cse1)))) [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:53:37,873 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:53:37,874 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:53:37,875 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:53:37,875 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,875 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,875 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,875 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,875 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,875 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:53:37,875 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:53:37,875 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,876 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:53:37,877 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:53:37,878 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:53:37,878 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:53:37,878 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:53:37,878 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:53:37,878 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:53:37,878 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:53:37,878 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:53:37,878 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,879 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse10 (= ~a20~0 1)) (.cse3 (= 15 ~a8~0))) (let ((.cse4 (= ~a16~0 5)) (.cse5 (= 1 ~a7~0)) (.cse9 (not .cse3)) (.cse8 (= ~a16~0 4)) (.cse6 (not .cse10)) (.cse11 (= 13 ~a8~0)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse7 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and (= 2 ULTIMATE.start_calculate_output_~input) .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse7 .cse4) (and .cse8 .cse9 .cse7) (and .cse5 .cse0 .cse2) (and .cse8 .cse9 .cse1 .cse0 .cse2 .cse10) (and .cse5 .cse11) (and .cse5 .cse9 .cse7) (and .cse6 .cse0 .cse1 .cse2 .cse3 (not .cse8)) (and .cse6 .cse0 .cse1 .cse2 .cse3 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (and .cse11 .cse1 .cse0 .cse2 .cse10) (and .cse1 .cse7 .cse2 .cse3)))) [2019-11-23 20:53:37,879 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,879 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,879 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,879 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,879 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:53:37,879 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:53:37,879 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:53:37,879 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:53:37,880 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:53:37,880 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:53:37,880 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:53:37,880 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:53:37,880 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,880 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,880 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,880 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:53:37,881 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,882 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:53:37,883 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,884 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:53:37,885 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 443) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:53:37,886 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:53:37,887 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:53:37,888 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:53:37,888 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:53:37,888 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:53:37,888 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:53:37,888 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:53:37,888 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:53:37,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:53:37 BoogieIcfgContainer [2019-11-23 20:53:37,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:53:37,914 INFO L168 Benchmark]: Toolchain (without parser) took 15882.21 ms. Allocated memory was 138.9 MB in the beginning and 458.2 MB in the end (delta: 319.3 MB). Free memory was 100.2 MB in the beginning and 253.2 MB in the end (delta: -153.0 MB). Peak memory consumption was 282.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:37,915 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 138.9 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 20:53:37,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.30 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 162.8 MB in the end (delta: -62.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:37,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.80 ms. Allocated memory is still 203.4 MB. Free memory was 162.8 MB in the beginning and 157.0 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:53:37,918 INFO L168 Benchmark]: Boogie Preprocessor took 108.55 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 153.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:37,919 INFO L168 Benchmark]: RCFGBuilder took 1357.22 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 152.2 MB in the beginning and 163.5 MB in the end (delta: -11.3 MB). Peak memory consumption was 71.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:37,920 INFO L168 Benchmark]: TraceAbstraction took 13486.74 ms. Allocated memory was 237.0 MB in the beginning and 458.2 MB in the end (delta: 221.2 MB). Free memory was 163.5 MB in the beginning and 253.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 248.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:37,924 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.55 ms. Allocated memory is still 138.9 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.30 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 162.8 MB in the end (delta: -62.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 145.80 ms. Allocated memory is still 203.4 MB. Free memory was 162.8 MB in the beginning and 157.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.55 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 153.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1357.22 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 152.2 MB in the beginning and 163.5 MB in the end (delta: -11.3 MB). Peak memory consumption was 71.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13486.74 ms. Allocated memory was 237.0 MB in the beginning and 458.2 MB in the end (delta: 221.2 MB). Free memory was 163.5 MB in the beginning and 253.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 248.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: 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 && 15 == a8) && a16 == 5) || (((((2 == input && !(a20 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || (a17 <= 0 && a16 == 5)) || (((((a17 == 1 && a12 == 8) && a21 == 1) && !(1 == input)) && 15 == a8) && a16 == 5)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0)) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((a16 == 4 && !(15 == a8)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (1 == a7 && 13 == a8)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && ((3 == input || 6 == input) || 5 == input))) || ((((13 == a8 && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5) || ((1 == a7 && 15 == a8) && a16 == 5)) || (((((2 == input && !(a20 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || (a17 <= 0 && a16 == 5)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0)) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((a16 == 4 && !(15 == a8)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (1 == a7 && 13 == a8)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && ((3 == input || 6 == input) || 5 == input))) || ((((13 == a8 && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.3s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 845 SDtfs, 3285 SDslu, 143 SDs, 0 SdLazy, 6607 SolverSat, 895 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2135occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1637 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 385 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5690 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 688 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1425 NumberOfCodeBlocks, 1425 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1414 ConstructedInterpolants, 0 QuantifiedInterpolants, 931189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 627/627 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...