java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:45:33,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:45:33,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:45:33,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:45:33,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:45:33,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:45:33,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:45:33,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:45:33,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:45:33,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:45:33,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:45:33,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:45:33,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:45:33,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:45:33,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:45:33,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:45:33,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:45:33,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:45:33,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:45:33,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:45:33,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:45:33,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:45:33,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:45:33,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:45:33,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:45:33,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:45:33,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:45:33,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:45:33,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:45:33,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:45:33,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:45:33,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:45:33,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:45:33,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:45:33,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:45:33,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:45:33,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:45:33,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:45:33,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:45:33,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:45:33,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:45:33,744 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-10-02 00:45:33,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:45:33,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:45:33,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:45:33,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:45:33,760 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:45:33,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:45:33,760 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:45:33,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:45:33,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:45:33,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:45:33,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:45:33,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:45:33,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:45:33,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:45:33,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:45:33,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:45:33,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:45:33,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:45:33,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:45:33,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:45:33,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:45:33,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:45:33,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:45:33,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:45:33,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:45:33,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:45:33,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:45:33,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:45:33,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:45:33,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:45:33,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:45:33,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:45:33,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:45:33,810 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:45:33,811 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05.c [2019-10-02 00:45:33,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c01ec2a6/f53493e49ebe4556a47de9238eeec947/FLAGce0f6b711 [2019-10-02 00:45:34,478 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:45:34,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label05.c [2019-10-02 00:45:34,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c01ec2a6/f53493e49ebe4556a47de9238eeec947/FLAGce0f6b711 [2019-10-02 00:45:34,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c01ec2a6/f53493e49ebe4556a47de9238eeec947 [2019-10-02 00:45:34,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:45:34,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:45:34,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:45:34,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:45:34,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:45:34,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:45:34" (1/1) ... [2019-10-02 00:45:34,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356f6b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:34, skipping insertion in model container [2019-10-02 00:45:34,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:45:34" (1/1) ... [2019-10-02 00:45:34,706 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:45:34,759 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:45:35,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:45:35,381 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:45:35,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:45:35,468 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:45:35,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35 WrapperNode [2019-10-02 00:45:35,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:45:35,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:45:35,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:45:35,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:45:35,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (1/1) ... [2019-10-02 00:45:35,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (1/1) ... [2019-10-02 00:45:35,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (1/1) ... [2019-10-02 00:45:35,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (1/1) ... [2019-10-02 00:45:35,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (1/1) ... [2019-10-02 00:45:35,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (1/1) ... [2019-10-02 00:45:35,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (1/1) ... [2019-10-02 00:45:35,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:45:35,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:45:35,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:45:35,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:45:35,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (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-10-02 00:45:35,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:45:35,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:45:35,649 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:45:35,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:45:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:45:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:45:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:45:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:45:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:45:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:45:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:45:36,864 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:45:36,864 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:45:36,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:45:36 BoogieIcfgContainer [2019-10-02 00:45:36,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:45:36,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:45:36,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:45:36,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:45:36,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:45:34" (1/3) ... [2019-10-02 00:45:36,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50529bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:45:36, skipping insertion in model container [2019-10-02 00:45:36,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:35" (2/3) ... [2019-10-02 00:45:36,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50529bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:45:36, skipping insertion in model container [2019-10-02 00:45:36,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:45:36" (3/3) ... [2019-10-02 00:45:36,875 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label05.c [2019-10-02 00:45:36,885 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:45:36,895 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:45:36,912 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:45:36,946 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:45:36,946 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:45:36,947 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:45:36,947 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:45:36,947 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:45:36,947 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:45:36,947 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:45:36,948 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:45:36,948 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:45:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 00:45:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 00:45:36,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:36,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:45:36,985 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2092008314, now seen corresponding path program 1 times [2019-10-02 00:45:36,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:36,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:37,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:37,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:45:37,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:45:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:45:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:45:37,481 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 00:45:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:38,325 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-02 00:45:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:45:38,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-02 00:45:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:38,358 INFO L225 Difference]: With dead ends: 618 [2019-10-02 00:45:38,358 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:45:38,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:45:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:45:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:45:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:45:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 00:45:38,468 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 132 [2019-10-02 00:45:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:38,469 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 00:45:38,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:45:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 00:45:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 00:45:38,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:38,475 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:45:38,476 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:38,476 INFO L82 PathProgramCache]: Analyzing trace with hash 682738721, now seen corresponding path program 1 times [2019-10-02 00:45:38,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:38,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:38,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:38,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:38,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:38,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:38,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:45:38,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:45:38,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:45:38,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:45:38,827 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 00:45:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:39,506 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-02 00:45:39,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:45:39,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-10-02 00:45:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:39,514 INFO L225 Difference]: With dead ends: 721 [2019-10-02 00:45:39,514 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:45:39,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-02 00:45:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:45:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:45:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:45:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 00:45:39,550 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 140 [2019-10-02 00:45:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:39,550 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 00:45:39,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:45:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 00:45:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 00:45:39,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:39,559 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:45:39,560 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2067720747, now seen corresponding path program 1 times [2019-10-02 00:45:39,560 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:39,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:39,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:39,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:39,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:39,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:39,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:45:39,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:45:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:45:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:45:39,938 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 00:45:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:40,569 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-02 00:45:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:45:40,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-02 00:45:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:40,576 INFO L225 Difference]: With dead ends: 717 [2019-10-02 00:45:40,576 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:45:40,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-02 00:45:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:45:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:45:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:45:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 00:45:40,594 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 146 [2019-10-02 00:45:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:40,595 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 00:45:40,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:45:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 00:45:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 00:45:40,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:40,598 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:45:40,598 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1033618530, now seen corresponding path program 1 times [2019-10-02 00:45:40,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:40,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:40,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:40,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:40,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:40,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:45:40,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:45:40,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:45:40,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:45:40,705 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 00:45:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:41,548 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-02 00:45:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:45:41,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-10-02 00:45:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:41,552 INFO L225 Difference]: With dead ends: 951 [2019-10-02 00:45:41,552 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 00:45:41,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:45:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 00:45:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 00:45:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:45:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-02 00:45:41,576 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 154 [2019-10-02 00:45:41,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:41,577 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-02 00:45:41,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:45:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-02 00:45:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 00:45:41,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:41,580 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:45:41,580 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1394591014, now seen corresponding path program 1 times [2019-10-02 00:45:41,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:41,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:41,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:41,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:45:41,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:45:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:45:41,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:45:41,796 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-02 00:45:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:42,420 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2019-10-02 00:45:42,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:45:42,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-02 00:45:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:42,424 INFO L225 Difference]: With dead ends: 1330 [2019-10-02 00:45:42,424 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:45:42,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-02 00:45:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:45:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:45:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:45:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-02 00:45:42,444 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 156 [2019-10-02 00:45:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:42,445 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-02 00:45:42,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:45:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-02 00:45:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 00:45:42,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:42,448 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:45:42,448 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash 124353046, now seen corresponding path program 1 times [2019-10-02 00:45:42,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:42,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:42,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:42,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:42,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:42,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:42,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:45:42,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:45:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:45:42,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:45:42,640 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-02 00:45:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:43,301 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2019-10-02 00:45:43,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:45:43,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-02 00:45:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:43,306 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 00:45:43,306 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:45:43,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-02 00:45:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:45:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:45:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:45:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-02 00:45:43,329 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 158 [2019-10-02 00:45:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:43,329 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-02 00:45:43,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:45:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-02 00:45:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 00:45:43,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:43,332 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:45:43,333 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:43,333 INFO L82 PathProgramCache]: Analyzing trace with hash 660846734, now seen corresponding path program 1 times [2019-10-02 00:45:43,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:43,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:43,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:43,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:43,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:43,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:43,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:45:43,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:45:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:45:43,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:45:43,412 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-02 00:45:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:44,260 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2019-10-02 00:45:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:45:44,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-10-02 00:45:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:44,277 INFO L225 Difference]: With dead ends: 1858 [2019-10-02 00:45:44,278 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 00:45:44,283 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:45:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 00:45:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 00:45:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 00:45:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-02 00:45:44,372 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 162 [2019-10-02 00:45:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:44,372 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-02 00:45:44,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:45:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-02 00:45:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 00:45:44,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:44,378 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 00:45:44,378 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:44,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash -390409458, now seen corresponding path program 1 times [2019-10-02 00:45:44,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:44,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:44,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:44,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:45:44,510 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:45:44,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:44,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:45:44,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:45:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 00:45:44,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:45:44,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:45:44,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:45:44,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:45:44,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:45:44,743 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 7 states. [2019-10-02 00:45:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:46,054 INFO L93 Difference]: Finished difference Result 3800 states and 5317 transitions. [2019-10-02 00:45:46,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:45:46,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2019-10-02 00:45:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:46,056 INFO L225 Difference]: With dead ends: 3800 [2019-10-02 00:45:46,056 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:45:46,065 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:45:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:45:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:45:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:45:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:45:46,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 196 [2019-10-02 00:45:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:46,067 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:45:46,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:45:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:45:46,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:45:46,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:45:46,781 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-10-02 00:45:46,933 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:45:46,933 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-02 00:45:46,933 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:45:46,933 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,933 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,933 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,933 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,934 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,934 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-02 00:45:46,934 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-02 00:45:46,934 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-02 00:45:46,934 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-02 00:45:46,934 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-02 00:45:46,934 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-02 00:45:46,934 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-02 00:45:46,935 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-02 00:45:46,935 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-02 00:45:46,935 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-02 00:45:46,935 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:45:46,935 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:45:46,935 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-02 00:45:46,935 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,935 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,936 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,936 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,936 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-02 00:45:46,936 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,936 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-02 00:45:46,936 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-02 00:45:46,936 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 00:45:46,936 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-02 00:45:46,937 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-02 00:45:46,937 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-02 00:45:46,937 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-02 00:45:46,937 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:45:46,937 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:45:46,937 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-02 00:45:46,937 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-02 00:45:46,937 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-02 00:45:46,938 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,939 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,940 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,940 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,940 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,940 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-02 00:45:46,940 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-02 00:45:46,940 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-02 00:45:46,940 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-02 00:45:46,941 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-02 00:45:46,941 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-02 00:45:46,941 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-02 00:45:46,941 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-02 00:45:46,941 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-02 00:45:46,941 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-02 00:45:46,941 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-02 00:45:46,941 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-02 00:45:46,942 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-02 00:45:46,942 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,942 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,942 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,942 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,942 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,942 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-02 00:45:46,942 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-02 00:45:46,943 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,944 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,945 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,946 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-02 00:45:46,946 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-02 00:45:46,946 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-02 00:45:46,946 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-02 00:45:46,946 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 00:45:46,946 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-02 00:45:46,946 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-02 00:45:46,946 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,947 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,948 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-02 00:45:46,948 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-02 00:45:46,948 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-02 00:45:46,948 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-02 00:45:46,948 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-02 00:45:46,948 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-02 00:45:46,948 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-02 00:45:46,948 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-02 00:45:46,949 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-02 00:45:46,950 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,951 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,951 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,951 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse12 (= 1 |old(~a11~0)|)) (.cse5 (= ~a17~0 8)) (.cse6 (= ~a11~0 1)) (.cse15 (= ~a19~0 |old(~a19~0)|)) (.cse16 (= ~a28~0 |old(~a28~0)|)) (.cse7 (= ~a25~0 |old(~a25~0)|)) (.cse17 (= 1 |old(~a19~0)|)) (.cse14 (= 1 |old(~a25~0)|))) (let ((.cse1 (not .cse14)) (.cse2 (not .cse17)) (.cse8 (and .cse15 .cse16 .cse7)) (.cse10 (= 9 |old(~a28~0)|)) (.cse13 (not (= 1 ~a11~0))) (.cse0 (not (= 1 ~a21~0))) (.cse11 (not (= 7 |old(~a28~0)|))) (.cse9 (and .cse5 .cse6)) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse4 (not .cse12))) (and (or .cse0 (not (= 10 |old(~a28~0)|)) .cse1 .cse2 .cse3 .cse4 (and (= ~a28~0 10) .cse5 (= ~a19~0 1) .cse6 .cse7)) (or .cse0 (not (<= |old(~a28~0)| 9)) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse9 (not .cse10) .cse4) (or .cse0 .cse11 .cse1 .cse2 (and (= ~a17~0 7) .cse6) .cse4 (not (= 7 |old(~a17~0)|))) (or .cse0 .cse12 .cse2 .cse13) (or .cse8 .cse0 .cse14) (or .cse0 .cse12 .cse13 .cse14) (or .cse0 .cse12 .cse10 (and .cse13 .cse15 .cse16 .cse7)) (or .cse17 .cse0 .cse11 .cse9 .cse3 .cse4 .cse14)))) [2019-10-02 00:45:46,951 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,951 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,951 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,952 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-02 00:45:46,952 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-02 00:45:46,952 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-02 00:45:46,952 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-02 00:45:46,952 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-02 00:45:46,952 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-02 00:45:46,952 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-02 00:45:46,952 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,953 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-02 00:45:46,954 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-02 00:45:46,955 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-02 00:45:46,955 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-02 00:45:46,955 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:45:46,955 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:45:46,955 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-02 00:45:46,955 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2019-10-02 00:45:46,955 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-02 00:45:46,956 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-02 00:45:46,956 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,956 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,956 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,956 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,956 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:45:46,956 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-02 00:45:46,956 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-02 00:45:46,957 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-02 00:45:46,957 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-02 00:45:46,957 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-02 00:45:46,957 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-02 00:45:46,957 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-02 00:45:46,957 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-02 00:45:46,957 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-02 00:45:46,957 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-02 00:45:46,958 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:45:46,959 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (not (= ~a25~0 1)) (= ~a19~0 1) (= ~a21~0 1) (<= ~a28~0 9) (not (= ~a28~0 9))) [2019-10-02 00:45:46,959 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:45:46,959 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:45:46,959 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (not (<= |old(~a28~0)| 9)) (not (= 1 |old(~a19~0)|)) (= 9 |old(~a28~0)|) (= 1 |old(~a25~0)|) (and (not (= 1 ~a11~0)) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|))) [2019-10-02 00:45:46,959 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (or (not (= 1 ~a21~0)) (<= ~a28~0 9) (= 9 |old(~a28~0)|) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (not (<= |old(~a28~0)| 9)) (not (= 1 ~a11~0)) (not (= 1 |old(~a19~0)|)) (and (= ~a28~0 10) (= ~a17~0 8) (= ~a19~0 1)) (not (= ~a25~0 1))) [2019-10-02 00:45:46,959 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:45:46,959 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:45:46,960 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (or (not (= 1 ~a21~0)) (<= ~a28~0 9) (= 9 |old(~a28~0)|) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (not (<= |old(~a28~0)| 9)) (not (= 1 ~a11~0)) (not (= 1 |old(~a19~0)|)) (and (= ~a28~0 10) (= ~a17~0 8) (= ~a19~0 1)) (not (= ~a25~0 1))) [2019-10-02 00:45:46,960 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-02 00:45:46,960 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-02 00:45:46,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:45:46 BoogieIcfgContainer [2019-10-02 00:45:46,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:45:46,978 INFO L168 Benchmark]: Toolchain (without parser) took 12284.67 ms. Allocated memory was 129.5 MB in the beginning and 500.2 MB in the end (delta: 370.7 MB). Free memory was 83.8 MB in the beginning and 255.9 MB in the end (delta: -172.1 MB). Peak memory consumption was 198.6 MB. Max. memory is 7.1 GB. [2019-10-02 00:45:46,979 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 129.5 MB. Free memory was 103.6 MB in the beginning and 103.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:45:46,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.60 ms. Allocated memory was 129.5 MB in the beginning and 200.3 MB in the end (delta: 70.8 MB). Free memory was 83.6 MB in the beginning and 164.4 MB in the end (delta: -80.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. [2019-10-02 00:45:46,981 INFO L168 Benchmark]: Boogie Preprocessor took 106.63 ms. Allocated memory is still 200.3 MB. Free memory was 164.4 MB in the beginning and 159.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:45:46,982 INFO L168 Benchmark]: RCFGBuilder took 1289.08 ms. Allocated memory was 200.3 MB in the beginning and 217.6 MB in the end (delta: 17.3 MB). Free memory was 159.4 MB in the beginning and 175.2 MB in the end (delta: -15.8 MB). Peak memory consumption was 97.1 MB. Max. memory is 7.1 GB. [2019-10-02 00:45:46,983 INFO L168 Benchmark]: TraceAbstraction took 10108.91 ms. Allocated memory was 217.6 MB in the beginning and 500.2 MB in the end (delta: 282.6 MB). Free memory was 175.2 MB in the beginning and 255.9 MB in the end (delta: -80.7 MB). Peak memory consumption was 201.9 MB. Max. memory is 7.1 GB. [2019-10-02 00:45:46,988 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.21 ms. Allocated memory is still 129.5 MB. Free memory was 103.6 MB in the beginning and 103.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.60 ms. Allocated memory was 129.5 MB in the beginning and 200.3 MB in the end (delta: 70.8 MB). Free memory was 83.6 MB in the beginning and 164.4 MB in the end (delta: -80.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.63 ms. Allocated memory is still 200.3 MB. Free memory was 164.4 MB in the beginning and 159.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1289.08 ms. Allocated memory was 200.3 MB in the beginning and 217.6 MB in the end (delta: 17.3 MB). Free memory was 159.4 MB in the beginning and 175.2 MB in the end (delta: -15.8 MB). Peak memory consumption was 97.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10108.91 ms. Allocated memory was 217.6 MB in the beginning and 500.2 MB in the end (delta: 282.6 MB). Free memory was 175.2 MB in the beginning and 255.9 MB in the end (delta: -80.7 MB). Peak memory consumption was 201.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((!(1 == a21) || a28 <= 9) || 9 == \old(a28)) || 1 == \old(a25)) || 1 == \old(a11)) || !(\old(a28) <= 9)) || !(1 == a11)) || !(1 == \old(a19))) || ((a28 == 10 && a17 == 8) && a19 == 1)) || !(a25 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 10.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 472 SDtfs, 3813 SDslu, 370 SDs, 0 SdLazy, 4725 SolverSat, 904 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1218occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 64 PreInvPairs, 126 NumberOfFragments, 384 HoareAnnotationTreeSize, 64 FomulaSimplifications, 1906 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 831 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1440 NumberOfCodeBlocks, 1440 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1431 ConstructedInterpolants, 0 QuantifiedInterpolants, 1358792 SizeOfPredicates, 2 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 280/282 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...