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/Problem16_label16.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:32:41,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:32:41,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:32:41,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:32:41,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:32:41,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:32:41,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:32:41,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:32:41,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:32:41,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:32:41,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:32:41,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:32:41,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:32:41,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:32:41,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:32:41,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:32:41,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:32:41,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:32:41,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:32:41,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:32:41,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:32:41,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:32:41,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:32:41,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:32:41,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:32:41,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:32:41,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:32:41,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:32:41,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:32:41,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:32:41,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:32:41,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:32:41,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:32:41,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:32:41,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:32:41,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:32:41,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:32:41,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:32:41,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:32:41,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:32:41,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:32:41,772 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 01:32:41,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:32:41,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:32:41,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:32:41,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:32:41,788 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:32:41,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:32:41,788 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:32:41,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:32:41,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:32:41,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:32:41,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:32:41,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:32:41,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:32:41,789 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:32:41,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:32:41,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:32:41,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:32:41,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:32:41,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:32:41,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:32:41,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:32:41,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:32:41,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:32:41,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:32:41,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:32:41,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:32:41,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:32:41,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:32:41,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:32:41,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:32:41,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:32:41,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:32:41,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:32:41,852 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:32:41,852 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label16.c [2019-10-02 01:32:41,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2f1f8f2/a6b70aaaad2c43ca98336379ce1c2b1d/FLAGe7b5228af [2019-10-02 01:32:42,594 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:32:42,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label16.c [2019-10-02 01:32:42,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2f1f8f2/a6b70aaaad2c43ca98336379ce1c2b1d/FLAGe7b5228af [2019-10-02 01:32:42,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2f1f8f2/a6b70aaaad2c43ca98336379ce1c2b1d [2019-10-02 01:32:42,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:32:42,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:32:42,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:32:42,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:32:42,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:32:42,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:32:42" (1/1) ... [2019-10-02 01:32:42,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8bf277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:42, skipping insertion in model container [2019-10-02 01:32:42,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:32:42" (1/1) ... [2019-10-02 01:32:42,788 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:32:42,878 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:32:43,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:32:43,989 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:32:44,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:32:44,262 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:32:44,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44 WrapperNode [2019-10-02 01:32:44,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:32:44,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:32:44,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:32:44,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:32:44,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (1/1) ... [2019-10-02 01:32:44,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (1/1) ... [2019-10-02 01:32:44,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (1/1) ... [2019-10-02 01:32:44,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (1/1) ... [2019-10-02 01:32:44,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (1/1) ... [2019-10-02 01:32:44,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (1/1) ... [2019-10-02 01:32:44,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (1/1) ... [2019-10-02 01:32:44,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:32:44,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:32:44,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:32:44,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:32:44,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (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 01:32:44,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:32:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:32:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:32:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:32:44,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:32:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:32:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:32:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:32:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:32:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:32:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:32:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:32:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:32:47,207 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:32:47,208 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:32:47,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:32:47 BoogieIcfgContainer [2019-10-02 01:32:47,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:32:47,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:32:47,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:32:47,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:32:47,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:32:42" (1/3) ... [2019-10-02 01:32:47,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610251a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:32:47, skipping insertion in model container [2019-10-02 01:32:47,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:44" (2/3) ... [2019-10-02 01:32:47,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610251a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:32:47, skipping insertion in model container [2019-10-02 01:32:47,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:32:47" (3/3) ... [2019-10-02 01:32:47,221 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label16.c [2019-10-02 01:32:47,236 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:32:47,249 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:32:47,275 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:32:47,340 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:32:47,341 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:32:47,341 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:32:47,341 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:32:47,342 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:32:47,342 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:32:47,342 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:32:47,342 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:32:47,343 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:32:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 01:32:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 01:32:47,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:47,404 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] [2019-10-02 01:32:47,408 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1899898085, now seen corresponding path program 1 times [2019-10-02 01:32:47,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:47,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:47,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:47,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:47,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:47,919 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 01:32:47,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:32:47,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:32:47,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:32:47,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:32:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:32:47,947 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-10-02 01:32:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:50,198 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-10-02 01:32:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:32:50,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-02 01:32:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:50,223 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 01:32:50,223 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 01:32:50,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:32:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 01:32:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-10-02 01:32:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 01:32:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1154 transitions. [2019-10-02 01:32:50,338 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1154 transitions. Word has length 48 [2019-10-02 01:32:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:50,339 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1154 transitions. [2019-10-02 01:32:50,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:32:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1154 transitions. [2019-10-02 01:32:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 01:32:50,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:50,347 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, 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] [2019-10-02 01:32:50,348 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:50,348 INFO L82 PathProgramCache]: Analyzing trace with hash 301606541, now seen corresponding path program 1 times [2019-10-02 01:32:50,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:50,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:50,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:50,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:50,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:32:50,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:32:50,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:32:50,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:32:50,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:32:50,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:32:50,599 INFO L87 Difference]: Start difference. First operand 682 states and 1154 transitions. Second operand 6 states. [2019-10-02 01:32:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:56,128 INFO L93 Difference]: Finished difference Result 2808 states and 4912 transitions. [2019-10-02 01:32:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:32:56,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 01:32:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:56,167 INFO L225 Difference]: With dead ends: 2808 [2019-10-02 01:32:56,167 INFO L226 Difference]: Without dead ends: 2132 [2019-10-02 01:32:56,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:32:56,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-10-02 01:32:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2087. [2019-10-02 01:32:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-10-02 01:32:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3381 transitions. [2019-10-02 01:32:56,391 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3381 transitions. Word has length 123 [2019-10-02 01:32:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:56,392 INFO L475 AbstractCegarLoop]: Abstraction has 2087 states and 3381 transitions. [2019-10-02 01:32:56,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:32:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3381 transitions. [2019-10-02 01:32:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 01:32:56,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:56,397 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, 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] [2019-10-02 01:32:56,397 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1614630469, now seen corresponding path program 1 times [2019-10-02 01:32:56,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:56,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:56,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:32:56,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:32:56,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:32:56,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:32:56,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:32:56,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:32:56,635 INFO L87 Difference]: Start difference. First operand 2087 states and 3381 transitions. Second operand 6 states. [2019-10-02 01:32:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:59,962 INFO L93 Difference]: Finished difference Result 5623 states and 9425 transitions. [2019-10-02 01:32:59,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 01:32:59,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-10-02 01:32:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:59,993 INFO L225 Difference]: With dead ends: 5623 [2019-10-02 01:32:59,994 INFO L226 Difference]: Without dead ends: 3542 [2019-10-02 01:33:00,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:33:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2019-10-02 01:33:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 3503. [2019-10-02 01:33:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-10-02 01:33:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5697 transitions. [2019-10-02 01:33:00,154 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5697 transitions. Word has length 127 [2019-10-02 01:33:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:00,164 INFO L475 AbstractCegarLoop]: Abstraction has 3503 states and 5697 transitions. [2019-10-02 01:33:00,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:33:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5697 transitions. [2019-10-02 01:33:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 01:33:00,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:00,174 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, 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] [2019-10-02 01:33:00,174 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash 939099681, now seen corresponding path program 1 times [2019-10-02 01:33:00,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:00,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:00,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:33:00,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:33:00,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:33:00,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:33:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:33:00,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:33:00,369 INFO L87 Difference]: Start difference. First operand 3503 states and 5697 transitions. Second operand 6 states. [2019-10-02 01:33:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:02,937 INFO L93 Difference]: Finished difference Result 7817 states and 13132 transitions. [2019-10-02 01:33:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:33:02,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 01:33:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:02,967 INFO L225 Difference]: With dead ends: 7817 [2019-10-02 01:33:02,968 INFO L226 Difference]: Without dead ends: 4320 [2019-10-02 01:33:02,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 01:33:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2019-10-02 01:33:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 4279. [2019-10-02 01:33:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4279 states. [2019-10-02 01:33:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 6768 transitions. [2019-10-02 01:33:03,183 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 6768 transitions. Word has length 129 [2019-10-02 01:33:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:03,183 INFO L475 AbstractCegarLoop]: Abstraction has 4279 states and 6768 transitions. [2019-10-02 01:33:03,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:33:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 6768 transitions. [2019-10-02 01:33:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 01:33:03,185 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:03,186 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, 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] [2019-10-02 01:33:03,186 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1902020488, now seen corresponding path program 1 times [2019-10-02 01:33:03,186 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:03,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:03,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:03,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:03,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:33:03,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:33:03,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:33:03,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:33:03,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:33:03,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:33:03,306 INFO L87 Difference]: Start difference. First operand 4279 states and 6768 transitions. Second operand 6 states. [2019-10-02 01:33:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:06,019 INFO L93 Difference]: Finished difference Result 11663 states and 19030 transitions. [2019-10-02 01:33:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:33:06,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-02 01:33:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:06,059 INFO L225 Difference]: With dead ends: 11663 [2019-10-02 01:33:06,060 INFO L226 Difference]: Without dead ends: 7390 [2019-10-02 01:33:06,073 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 01:33:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7390 states. [2019-10-02 01:33:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7390 to 7362. [2019-10-02 01:33:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7362 states. [2019-10-02 01:33:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 10905 transitions. [2019-10-02 01:33:06,265 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 10905 transitions. Word has length 132 [2019-10-02 01:33:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:06,266 INFO L475 AbstractCegarLoop]: Abstraction has 7362 states and 10905 transitions. [2019-10-02 01:33:06,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:33:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 10905 transitions. [2019-10-02 01:33:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 01:33:06,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:06,269 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, 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] [2019-10-02 01:33:06,269 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1440393839, now seen corresponding path program 1 times [2019-10-02 01:33:06,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:06,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:06,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:06,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:33:06,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:33:06,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:33:06,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:33:06,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:33:06,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:33:06,402 INFO L87 Difference]: Start difference. First operand 7362 states and 10905 transitions. Second operand 6 states. [2019-10-02 01:33:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:08,828 INFO L93 Difference]: Finished difference Result 16133 states and 24072 transitions. [2019-10-02 01:33:08,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:33:08,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-10-02 01:33:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:08,877 INFO L225 Difference]: With dead ends: 16133 [2019-10-02 01:33:08,877 INFO L226 Difference]: Without dead ends: 8777 [2019-10-02 01:33:08,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 01:33:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8777 states. [2019-10-02 01:33:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8777 to 7746. [2019-10-02 01:33:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7746 states. [2019-10-02 01:33:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7746 states to 7746 states and 10527 transitions. [2019-10-02 01:33:09,103 INFO L78 Accepts]: Start accepts. Automaton has 7746 states and 10527 transitions. Word has length 137 [2019-10-02 01:33:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:09,104 INFO L475 AbstractCegarLoop]: Abstraction has 7746 states and 10527 transitions. [2019-10-02 01:33:09,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:33:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7746 states and 10527 transitions. [2019-10-02 01:33:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 01:33:09,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:09,107 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, 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] [2019-10-02 01:33:09,107 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:09,107 INFO L82 PathProgramCache]: Analyzing trace with hash -37681811, now seen corresponding path program 1 times [2019-10-02 01:33:09,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:09,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:09,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 01:33:09,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:09,240 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 01:33:09,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:09,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:33:09,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:33:09,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:33:09,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 01:33:09,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:33:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:33:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:33:09,410 INFO L87 Difference]: Start difference. First operand 7746 states and 10527 transitions. Second operand 5 states. [2019-10-02 01:33:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:12,812 INFO L93 Difference]: Finished difference Result 22655 states and 31444 transitions. [2019-10-02 01:33:12,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:33:12,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-02 01:33:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:12,882 INFO L225 Difference]: With dead ends: 22655 [2019-10-02 01:33:12,882 INFO L226 Difference]: Without dead ends: 14915 [2019-10-02 01:33:12,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:33:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14915 states. [2019-10-02 01:33:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14915 to 12484. [2019-10-02 01:33:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12484 states. [2019-10-02 01:33:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12484 states to 12484 states and 16371 transitions. [2019-10-02 01:33:13,289 INFO L78 Accepts]: Start accepts. Automaton has 12484 states and 16371 transitions. Word has length 139 [2019-10-02 01:33:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:13,289 INFO L475 AbstractCegarLoop]: Abstraction has 12484 states and 16371 transitions. [2019-10-02 01:33:13,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:33:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 12484 states and 16371 transitions. [2019-10-02 01:33:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-10-02 01:33:13,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:13,317 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:13,317 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1505126243, now seen corresponding path program 1 times [2019-10-02 01:33:13,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:13,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:13,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:13,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:13,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 314 proven. 155 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-10-02 01:33:14,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:14,303 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:33:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:14,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:33:14,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 536 proven. 2 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-02 01:33:14,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:33:14,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:33:14,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:33:14,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:33:14,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:33:14,794 INFO L87 Difference]: Start difference. First operand 12484 states and 16371 transitions. Second operand 9 states. [2019-10-02 01:33:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:20,769 INFO L93 Difference]: Finished difference Result 28615 states and 39436 transitions. [2019-10-02 01:33:20,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 01:33:20,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 598 [2019-10-02 01:33:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:20,845 INFO L225 Difference]: With dead ends: 28615 [2019-10-02 01:33:20,846 INFO L226 Difference]: Without dead ends: 16137 [2019-10-02 01:33:20,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:33:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2019-10-02 01:33:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 16121. [2019-10-02 01:33:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16121 states. [2019-10-02 01:33:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16121 states to 16121 states and 21564 transitions. [2019-10-02 01:33:21,333 INFO L78 Accepts]: Start accepts. Automaton has 16121 states and 21564 transitions. Word has length 598 [2019-10-02 01:33:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:21,334 INFO L475 AbstractCegarLoop]: Abstraction has 16121 states and 21564 transitions. [2019-10-02 01:33:21,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:33:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 16121 states and 21564 transitions. [2019-10-02 01:33:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-10-02 01:33:21,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:21,405 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:33:21,405 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:21,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1134290441, now seen corresponding path program 1 times [2019-10-02 01:33:21,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:21,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 546 proven. 233 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 01:33:22,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:22,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:33:22,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:22,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:33:22,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-10-02 01:33:23,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:33:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 01:33:23,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:33:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:33:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:33:23,019 INFO L87 Difference]: Start difference. First operand 16121 states and 21564 transitions. Second operand 9 states. [2019-10-02 01:33:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:27,594 INFO L93 Difference]: Finished difference Result 37026 states and 49155 transitions. [2019-10-02 01:33:27,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 01:33:27,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 732 [2019-10-02 01:33:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:27,664 INFO L225 Difference]: With dead ends: 37026 [2019-10-02 01:33:27,664 INFO L226 Difference]: Without dead ends: 20911 [2019-10-02 01:33:27,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 740 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:33:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-10-02 01:33:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 16121. [2019-10-02 01:33:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16121 states. [2019-10-02 01:33:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16121 states to 16121 states and 20270 transitions. [2019-10-02 01:33:28,049 INFO L78 Accepts]: Start accepts. Automaton has 16121 states and 20270 transitions. Word has length 732 [2019-10-02 01:33:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:28,050 INFO L475 AbstractCegarLoop]: Abstraction has 16121 states and 20270 transitions. [2019-10-02 01:33:28,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:33:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16121 states and 20270 transitions. [2019-10-02 01:33:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2019-10-02 01:33:28,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:28,126 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:33:28,126 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash -596998699, now seen corresponding path program 1 times [2019-10-02 01:33:28,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:28,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:28,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 1043 trivial. 0 not checked. [2019-10-02 01:33:29,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:33:29,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:33:29,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:33:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:33:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:33:29,236 INFO L87 Difference]: Start difference. First operand 16121 states and 20270 transitions. Second operand 4 states. [2019-10-02 01:33:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:32,320 INFO L93 Difference]: Finished difference Result 40440 states and 51302 transitions. [2019-10-02 01:33:32,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:33:32,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 856 [2019-10-02 01:33:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:32,403 INFO L225 Difference]: With dead ends: 40440 [2019-10-02 01:33:32,403 INFO L226 Difference]: Without dead ends: 24325 [2019-10-02 01:33:32,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:33:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24325 states. [2019-10-02 01:33:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24325 to 21936. [2019-10-02 01:33:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21936 states. [2019-10-02 01:33:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21936 states to 21936 states and 27272 transitions. [2019-10-02 01:33:33,023 INFO L78 Accepts]: Start accepts. Automaton has 21936 states and 27272 transitions. Word has length 856 [2019-10-02 01:33:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:33,024 INFO L475 AbstractCegarLoop]: Abstraction has 21936 states and 27272 transitions. [2019-10-02 01:33:33,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:33:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 21936 states and 27272 transitions. [2019-10-02 01:33:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2019-10-02 01:33:33,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:33,103 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:33,104 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:33,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:33,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2023413244, now seen corresponding path program 1 times [2019-10-02 01:33:33,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:33,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:33,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:33,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:33,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 523 proven. 164 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2019-10-02 01:33:34,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:34,734 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:33:34,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:34,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:33:35,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 1407 proven. 2 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-10-02 01:33:35,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:33:35,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:33:35,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:33:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:33:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:33:35,438 INFO L87 Difference]: Start difference. First operand 21936 states and 27272 transitions. Second operand 9 states. [2019-10-02 01:33:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:41,341 INFO L93 Difference]: Finished difference Result 47167 states and 61086 transitions. [2019-10-02 01:33:41,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:33:41,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 967 [2019-10-02 01:33:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:41,440 INFO L225 Difference]: With dead ends: 47167 [2019-10-02 01:33:41,440 INFO L226 Difference]: Without dead ends: 25237 [2019-10-02 01:33:41,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:33:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25237 states. [2019-10-02 01:33:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25237 to 24888. [2019-10-02 01:33:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24888 states. [2019-10-02 01:33:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24888 states to 24888 states and 31464 transitions. [2019-10-02 01:33:42,113 INFO L78 Accepts]: Start accepts. Automaton has 24888 states and 31464 transitions. Word has length 967 [2019-10-02 01:33:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:42,114 INFO L475 AbstractCegarLoop]: Abstraction has 24888 states and 31464 transitions. [2019-10-02 01:33:42,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:33:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 24888 states and 31464 transitions. [2019-10-02 01:33:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1004 [2019-10-02 01:33:42,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:42,228 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:33:42,228 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash 462476918, now seen corresponding path program 1 times [2019-10-02 01:33:42,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:42,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:42,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1047 proven. 434 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2019-10-02 01:33:43,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:43,348 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:33:43,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:43,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:33:43,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1458 proven. 2 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2019-10-02 01:33:44,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:33:44,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:33:44,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:33:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:33:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:33:44,676 INFO L87 Difference]: Start difference. First operand 24888 states and 31464 transitions. Second operand 9 states. [2019-10-02 01:33:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:49,906 INFO L93 Difference]: Finished difference Result 55375 states and 70822 transitions. [2019-10-02 01:33:49,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:33:49,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1003 [2019-10-02 01:33:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:50,022 INFO L225 Difference]: With dead ends: 55375 [2019-10-02 01:33:50,023 INFO L226 Difference]: Without dead ends: 26434 [2019-10-02 01:33:50,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 1008 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:33:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26434 states. [2019-10-02 01:33:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26434 to 25306. [2019-10-02 01:33:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25306 states. [2019-10-02 01:33:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25306 states to 25306 states and 28322 transitions. [2019-10-02 01:33:50,929 INFO L78 Accepts]: Start accepts. Automaton has 25306 states and 28322 transitions. Word has length 1003 [2019-10-02 01:33:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:50,930 INFO L475 AbstractCegarLoop]: Abstraction has 25306 states and 28322 transitions. [2019-10-02 01:33:50,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:33:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 25306 states and 28322 transitions. [2019-10-02 01:33:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1497 [2019-10-02 01:33:50,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:51,000 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-10-02 01:33:51,000 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash 10447826, now seen corresponding path program 1 times [2019-10-02 01:33:51,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:51,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:51,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3701 backedges. 842 proven. 644 refuted. 0 times theorem prover too weak. 2215 trivial. 0 not checked. [2019-10-02 01:33:56,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:56,431 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:33:56,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:56,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1875 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:33:56,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3701 backedges. 1178 proven. 0 refuted. 0 times theorem prover too weak. 2523 trivial. 0 not checked. [2019-10-02 01:33:57,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:33:57,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 01:33:57,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:33:57,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:33:57,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:33:57,809 INFO L87 Difference]: Start difference. First operand 25306 states and 28322 transitions. Second operand 14 states. [2019-10-02 01:34:00,725 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 01:34:01,029 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-02 01:34:01,462 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-02 01:34:03,232 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-02 01:34:04,234 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-02 01:34:05,388 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-02 01:34:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:05,872 INFO L93 Difference]: Finished difference Result 47450 states and 52236 transitions. [2019-10-02 01:34:05,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 01:34:05,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1496 [2019-10-02 01:34:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:05,914 INFO L225 Difference]: With dead ends: 47450 [2019-10-02 01:34:05,914 INFO L226 Difference]: Without dead ends: 24854 [2019-10-02 01:34:05,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1568 GetRequests, 1523 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=489, Invalid=1581, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 01:34:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24854 states. [2019-10-02 01:34:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24854 to 24146. [2019-10-02 01:34:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24146 states. [2019-10-02 01:34:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24146 states to 24146 states and 25942 transitions. [2019-10-02 01:34:06,353 INFO L78 Accepts]: Start accepts. Automaton has 24146 states and 25942 transitions. Word has length 1496 [2019-10-02 01:34:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:06,354 INFO L475 AbstractCegarLoop]: Abstraction has 24146 states and 25942 transitions. [2019-10-02 01:34:06,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:34:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 24146 states and 25942 transitions. [2019-10-02 01:34:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1828 [2019-10-02 01:34:06,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:06,426 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:34:06,426 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:06,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1265903826, now seen corresponding path program 1 times [2019-10-02 01:34:06,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:06,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:06,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6851 backedges. 3340 proven. 2045 refuted. 0 times theorem prover too weak. 1466 trivial. 0 not checked. [2019-10-02 01:34:13,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:34:13,420 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:34:13,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:13,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 2324 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 01:34:13,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:34:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:34:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6851 backedges. 2874 proven. 5 refuted. 0 times theorem prover too weak. 3972 trivial. 0 not checked. [2019-10-02 01:34:15,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:34:15,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8] total 32 [2019-10-02 01:34:15,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 01:34:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 01:34:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-10-02 01:34:15,678 INFO L87 Difference]: Start difference. First operand 24146 states and 25942 transitions. Second operand 32 states. [2019-10-02 01:34:29,629 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-10-02 01:34:35,768 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-02 01:34:36,778 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-02 01:34:38,770 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-02 01:34:53,443 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-10-02 01:34:55,299 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-02 01:34:55,669 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-02 01:35:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:01,109 INFO L93 Difference]: Finished difference Result 47540 states and 51608 transitions. [2019-10-02 01:35:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-10-02 01:35:01,110 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1827 [2019-10-02 01:35:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:01,111 INFO L225 Difference]: With dead ends: 47540 [2019-10-02 01:35:01,112 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:35:01,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2103 GetRequests, 1929 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11881 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=3307, Invalid=27493, Unknown=0, NotChecked=0, Total=30800 [2019-10-02 01:35:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:35:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:35:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:35:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:35:01,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1827 [2019-10-02 01:35:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:01,167 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:35:01,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 01:35:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:35:01,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:35:01,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:35:04,711 WARN L191 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 734 DAG size of output: 610 [2019-10-02 01:35:08,548 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 734 DAG size of output: 610 [2019-10-02 01:35:14,743 WARN L191 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 583 DAG size of output: 116 [2019-10-02 01:35:18,752 WARN L191 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 451 DAG size of output: 101 [2019-10-02 01:35:22,472 WARN L191 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 445 DAG size of output: 101 [2019-10-02 01:35:26,699 WARN L191 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 469 DAG size of output: 115 [2019-10-02 01:35:33,010 WARN L191 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 583 DAG size of output: 116 [2019-10-02 01:35:33,013 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:35:33,013 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:35:33,013 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:35:33,013 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,013 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:35:33,013 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,013 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,014 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,014 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,014 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,014 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,014 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,014 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,014 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,014 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,015 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,016 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,016 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,016 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,016 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,016 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,016 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,016 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,016 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,017 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse11 (= 9 |old(~a12~0)|)) (.cse25 (= ~a12~0 9)) (.cse14 (= ~a12~0 |old(~a12~0)|)) (.cse21 (= 8 |old(~a16~0)|)) (.cse9 (= 7 |old(~a12~0)|)) (.cse10 (= 4 |old(~a15~0)|)) (.cse23 (= ~a12~0 7)) (.cse13 (= ~a16~0 |old(~a16~0)|)) (.cse15 (= ~a18~0 |old(~a18~0)|)) (.cse16 (= ~a15~0 |old(~a15~0)|))) (let ((.cse7 (and .cse23 .cse13 .cse15 .cse16)) (.cse0 (not .cse10)) (.cse8 (not .cse9)) (.cse1 (not .cse21)) (.cse5 (= 12 |old(~a16~0)|)) (.cse19 (not (= 5 |old(~a12~0)|))) (.cse20 (and .cse13 (= ~a12~0 5) .cse15 .cse16)) (.cse12 (not (<= 6 |old(~a12~0)|))) (.cse17 (and .cse14 .cse13 .cse15 .cse16)) (.cse22 (and .cse13 .cse15 .cse25 .cse16)) (.cse3 (not (<= (+ |old(~a18~0)| 87) 0))) (.cse18 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse24 (not (= 3 |old(~a15~0)|))) (.cse6 (= 10 |old(~a16~0)|)) (.cse2 (and .cse16 .cse13 .cse15 .cse25)) (.cse4 (not .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (or .cse5 .cse6 .cse3) .cse7 .cse8) (or (or .cse9 .cse10 .cse11) .cse12 (and .cse13 .cse14 .cse15 .cse16)) (or .cse1 .cse9 .cse12 .cse11 .cse17 .cse18) (or .cse19 .cse20 .cse10) (or .cse1 .cse17 (or (not (<= 135 |old(~a18~0)|)) .cse9 .cse10)) (or .cse1 .cse12 .cse11 .cse3 .cse17) (or .cse0 .cse1 .cse7 .cse8 .cse18) (or (or .cse5 .cse9 .cse11 .cse6 .cse21) .cse12 .cse17) (or .cse0 .cse5 .cse6 .cse22 .cse21 .cse4) (or .cse2 .cse0 .cse1 .cse18 .cse4) (or .cse5 (and .cse13 .cse15 .cse16 (= ~a12~0 6)) (not (= 6 |old(~a12~0)|)) .cse21) (or (and (and .cse23 .cse13 .cse15) .cse16) (or .cse5 .cse8 .cse18 .cse6 .cse21)) (or .cse1 (or .cse10 (not (<= |old(~a12~0)| 5))) (and (and .cse14 .cse13 .cse15) .cse16)) (or .cse5 .cse19 .cse20) (or (or .cse10 .cse11 .cse6 .cse21) .cse12 .cse17) (or .cse22 (or .cse10 .cse6 .cse21 .cse3) .cse4) (or .cse24 .cse2 (or .cse6 .cse21) .cse18 .cse4) (or .cse24 .cse6 (not (<= (+ |old(~a18~0)| 156) 0)) .cse2 .cse4)))) [2019-10-02 01:35:33,017 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,017 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,017 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,017 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,018 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,019 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,019 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,019 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,019 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-10-02 01:35:33,019 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,019 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,019 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,019 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,020 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:35:33,021 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:35:33,021 INFO L439 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse7 (= 9 |old(~a12~0)|)) (.cse25 (= ~a12~0 9)) (.cse6 (= 4 |old(~a15~0)|)) (.cse23 (= 8 |old(~a16~0)|)) (.cse5 (= 7 |old(~a12~0)|)) (.cse10 (= ~a12~0 |old(~a12~0)|)) (.cse12 (= ~a15~0 |old(~a15~0)|)) (.cse24 (= ~a12~0 7)) (.cse9 (= ~a16~0 |old(~a16~0)|)) (.cse11 (= ~a18~0 |old(~a18~0)|))) (let ((.cse4 (and .cse12 .cse24 .cse9 .cse11)) (.cse13 (and .cse10 .cse12 .cse9 .cse11)) (.cse2 (not .cse5)) (.cse15 (and .cse9 (= ~a12~0 5) .cse11 .cse12)) (.cse16 (and .cse10 .cse9 .cse11 .cse12)) (.cse17 (not (<= (+ |old(~a18~0)| 87) 0))) (.cse1 (not .cse23)) (.cse14 (not (= 5 |old(~a12~0)|))) (.cse3 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse0 (not .cse6)) (.cse20 (= 12 |old(~a16~0)|)) (.cse8 (not (<= 6 |old(~a12~0)|))) (.cse22 (= ~a12~0 6)) (.cse26 (<= ~a18~0 134)) (.cse27 (not (= 3 |old(~a15~0)|))) (.cse21 (= 10 |old(~a16~0)|)) (.cse19 (and .cse12 .cse9 .cse11 .cse25)) (.cse18 (not .cse7))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (or .cse5 .cse6 .cse7) .cse8 (and .cse9 .cse10 .cse11 .cse12)) (or .cse1 .cse5 .cse8 .cse7 .cse13 .cse3) (or .cse14 .cse15 .cse6) (or .cse1 .cse16 (or (not (<= 135 |old(~a18~0)|)) .cse5 .cse6)) (or .cse0 .cse1 .cse17 .cse18 .cse19) (or (or .cse20 .cse21 .cse17) .cse4 .cse2) (or .cse1 .cse8 .cse7 .cse13 .cse17) (or .cse20 (not (= 6 |old(~a12~0)|)) (and .cse9 .cse11 .cse12 .cse22) .cse23) (or (and (and .cse24 .cse9 .cse11) .cse12) (or .cse20 .cse2 .cse3 .cse21 .cse23)) (or .cse1 (or .cse6 (not (<= |old(~a12~0)| 5))) (and (and .cse10 .cse9 .cse11) .cse12)) (or .cse20 .cse14 .cse15) (or (or .cse6 .cse7 .cse21 .cse23) .cse8 .cse16) (or (and .cse9 .cse11 .cse25 .cse12) (or .cse6 .cse21 .cse23 .cse17) .cse18) (or .cse0 .cse1 .cse19 .cse3 .cse18) (or .cse0 .cse1 .cse14 (or .cse26 (not (= 3 calculate_output_~input)))) (or .cse27 .cse19 (or .cse21 .cse23) .cse3 .cse18) (or (or .cse0 .cse20 .cse5 .cse21 .cse23) .cse8 (and .cse10 .cse9 .cse11 .cse12 (or (not (= calculate_output_~input 6)) (not .cse22) .cse26 (not (= ~a16~0 9))))) (or .cse27 .cse21 (not (<= (+ |old(~a18~0)| 156) 0)) .cse19 .cse18)))) [2019-10-02 01:35:33,021 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,021 INFO L443 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2019-10-02 01:35:33,021 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,021 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,021 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,021 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,021 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,022 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,023 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,023 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,023 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,023 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,023 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,023 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,023 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,023 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,024 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,025 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,026 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,027 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,028 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,029 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,030 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,031 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse11 (= 9 |old(~a12~0)|)) (.cse25 (= ~a12~0 9)) (.cse14 (= ~a12~0 |old(~a12~0)|)) (.cse21 (= 8 |old(~a16~0)|)) (.cse9 (= 7 |old(~a12~0)|)) (.cse10 (= 4 |old(~a15~0)|)) (.cse23 (= ~a12~0 7)) (.cse13 (= ~a16~0 |old(~a16~0)|)) (.cse15 (= ~a18~0 |old(~a18~0)|)) (.cse16 (= ~a15~0 |old(~a15~0)|))) (let ((.cse7 (and .cse23 .cse13 .cse15 .cse16)) (.cse0 (not .cse10)) (.cse8 (not .cse9)) (.cse1 (not .cse21)) (.cse5 (= 12 |old(~a16~0)|)) (.cse19 (not (= 5 |old(~a12~0)|))) (.cse20 (and .cse13 (= ~a12~0 5) .cse15 .cse16)) (.cse12 (not (<= 6 |old(~a12~0)|))) (.cse17 (and .cse14 .cse13 .cse15 .cse16)) (.cse22 (and .cse13 .cse15 .cse25 .cse16)) (.cse3 (not (<= (+ |old(~a18~0)| 87) 0))) (.cse18 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse24 (not (= 3 |old(~a15~0)|))) (.cse6 (= 10 |old(~a16~0)|)) (.cse2 (and .cse16 .cse13 .cse15 .cse25)) (.cse4 (not .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (or .cse5 .cse6 .cse3) .cse7 .cse8) (or (or .cse9 .cse10 .cse11) .cse12 (and .cse13 .cse14 .cse15 .cse16)) (or .cse1 .cse9 .cse12 .cse11 .cse17 .cse18) (or .cse19 .cse20 .cse10) (or .cse1 .cse17 (or (not (<= 135 |old(~a18~0)|)) .cse9 .cse10)) (or .cse1 .cse12 .cse11 .cse3 .cse17) (or .cse0 .cse1 .cse7 .cse8 .cse18) (or (or .cse5 .cse9 .cse11 .cse6 .cse21) .cse12 .cse17) (or .cse0 .cse5 .cse6 .cse22 .cse21 .cse4) (or .cse2 .cse0 .cse1 .cse18 .cse4) (or .cse5 (and .cse13 .cse15 .cse16 (= ~a12~0 6)) (not (= 6 |old(~a12~0)|)) .cse21) (or (and (and .cse23 .cse13 .cse15) .cse16) (or .cse5 .cse8 .cse18 .cse6 .cse21)) (or .cse1 (or .cse10 (not (<= |old(~a12~0)| 5))) (and (and .cse14 .cse13 .cse15) .cse16)) (or .cse5 .cse19 .cse20) (or (or .cse10 .cse11 .cse6 .cse21) .cse12 .cse17) (or .cse22 (or .cse10 .cse6 .cse21 .cse3) .cse4) (or .cse24 .cse2 (or .cse6 .cse21) .cse18 .cse4) (or .cse24 .cse6 (not (<= (+ |old(~a18~0)| 156) 0)) .cse2 .cse4)))) [2019-10-02 01:35:33,031 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,031 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,031 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,031 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,031 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,032 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,033 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,034 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,035 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,036 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,037 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:35:33,038 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,039 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,039 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,039 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,039 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,039 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,039 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,039 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,039 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,040 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,041 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,042 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,042 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,042 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,042 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,042 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,042 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,042 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,042 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,043 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,044 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,044 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,044 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,044 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-10-02 01:35:33,044 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,044 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,044 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:35:33,044 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,045 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:35:33,046 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:35:33,047 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,048 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,049 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,050 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,051 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,052 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,053 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-10-02 01:35:33,053 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:35:33,053 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 8)) (not (= 12 ~a16~0)) (= ~a12~0 5) (not (= 10 ~a16~0)) (= (+ ~a18~0 87) 0) (not (= 4 ~a15~0))) [2019-10-02 01:35:33,053 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:35:33,053 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:35:33,053 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (= 12 |old(~a16~0)|) (and (= ~a12~0 5) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|)) (not (= 5 |old(~a12~0)|)) (= 4 |old(~a15~0)|) (not (= (+ |old(~a18~0)| 87) 0)) (= 10 |old(~a16~0)|) (= 8 |old(~a16~0)|)) [2019-10-02 01:35:33,053 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:35:33,054 INFO L439 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse13 (= ~a16~0 8))) (let ((.cse3 (not .cse13)) (.cse4 (not (= 10 ~a16~0))) (.cse16 (not (= 7 ~a12~0)))) (let ((.cse18 (= ~a15~0 |old(~a15~0)|)) (.cse2 (= ~a12~0 5)) (.cse19 (= ~a16~0 |old(~a16~0)|)) (.cse8 (= ~a15~0 4)) (.cse20 (+ ~a18~0 87)) (.cse0 (= 3 |old(~a15~0)|)) (.cse21 (and .cse3 .cse4 .cse16)) (.cse12 (not (= 4 ~a15~0)))) (let ((.cse14 (= ~a15~0 3)) (.cse15 (and .cse0 (and .cse21 .cse12))) (.cse10 (= ~a12~0 9)) (.cse17 (<= ~a12~0 5)) (.cse9 (<= .cse20 0)) (.cse5 (not (= 9 ~a12~0))) (.cse11 (or (= ~a16~0 9) (<= ~a18~0 134) (not (= 3 calculate_output_~input)) (and (or .cse8 .cse18) (or (and (or (= ~a12~0 |old(~a12~0)|) .cse2) (or .cse13 .cse19)) (not .cse8))))) (.cse1 (not (= 12 ~a16~0))) (.cse6 (< 0 (+ ~a18~0 79))) (.cse7 (<= 6 ~a12~0))) (or (not (= (+ |old(~a18~0)| 87) 0)) (and .cse0 .cse1 .cse2) (and (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6) .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse0 .cse7) (and .cse0 .cse3 .cse1 (= ~a12~0 6)) (and .cse8 .cse1 .cse4 .cse6 .cse0 .cse10) (and .cse11 (and .cse0 (= ~a12~0 7) .cse3 .cse4 .cse12)) (and (and .cse13 (<= (+ ~a18~0 156) 0)) .cse0 .cse14) (and .cse15 .cse2) (and .cse13 (and .cse0 .cse16 (<= 135 ~a18~0) .cse12)) (= 10 |old(~a16~0)|) (and (and .cse9 .cse0 .cse3 .cse4 .cse12) .cse10) (and .cse13 (and (and .cse9 .cse17) .cse18)) (and .cse19 .cse2 (= .cse20 0) .cse18) (not (= 5 |old(~a12~0)|)) (and (and .cse0 (and .cse16 .cse5 .cse12)) .cse7) (and .cse14 (and .cse15 .cse6) .cse10) (= 4 |old(~a15~0)|) (and .cse13 (and .cse0 (and .cse17 .cse12))) (= 8 |old(~a16~0)|) (= 12 |old(~a16~0)|) (and .cse0 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7) (and (and .cse0 (and .cse9 .cse4 .cse5 .cse12)) .cse7) (and .cse8 .cse0 .cse21 .cse1 .cse7) (and .cse8 .cse11 .cse1 .cse6 .cse0 (not (= ~a16~0 10)) .cse7)))))) [2019-10-02 01:35:33,054 INFO L443 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2019-10-02 01:35:33,054 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-10-02 01:35:33,055 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse13 (= ~a16~0 8))) (let ((.cse3 (not .cse13)) (.cse4 (not (= 10 ~a16~0))) (.cse16 (not (= 7 ~a12~0)))) (let ((.cse18 (= ~a15~0 |old(~a15~0)|)) (.cse2 (= ~a12~0 5)) (.cse19 (= ~a16~0 |old(~a16~0)|)) (.cse8 (= ~a15~0 4)) (.cse20 (+ ~a18~0 87)) (.cse0 (= 3 |old(~a15~0)|)) (.cse21 (and .cse3 .cse4 .cse16)) (.cse12 (not (= 4 ~a15~0)))) (let ((.cse14 (= ~a15~0 3)) (.cse15 (and .cse0 (and .cse21 .cse12))) (.cse10 (= ~a12~0 9)) (.cse17 (<= ~a12~0 5)) (.cse9 (<= .cse20 0)) (.cse5 (not (= 9 ~a12~0))) (.cse11 (or (= ~a16~0 9) (<= ~a18~0 134) (not (= 3 calculate_output_~input)) (and (or .cse8 .cse18) (or (and (or (= ~a12~0 |old(~a12~0)|) .cse2) (or .cse13 .cse19)) (not .cse8))))) (.cse1 (not (= 12 ~a16~0))) (.cse6 (< 0 (+ ~a18~0 79))) (.cse7 (<= 6 ~a12~0))) (or (not (= (+ |old(~a18~0)| 87) 0)) (and .cse0 .cse1 .cse2) (and (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6) .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse0 .cse7) (and .cse0 .cse3 .cse1 (= ~a12~0 6)) (and .cse8 .cse1 .cse4 .cse6 .cse0 .cse10) (and .cse11 (and .cse0 (= ~a12~0 7) .cse3 .cse4 .cse12)) (and (and .cse13 (<= (+ ~a18~0 156) 0)) .cse0 .cse14) (and .cse15 .cse2) (and .cse13 (and .cse0 .cse16 (<= 135 ~a18~0) .cse12)) (= 10 |old(~a16~0)|) (and (and .cse9 .cse0 .cse3 .cse4 .cse12) .cse10) (and .cse13 (and (and .cse9 .cse17) .cse18)) (and .cse19 .cse2 (= .cse20 0) .cse18) (not (= 5 |old(~a12~0)|)) (and (and .cse0 (and .cse16 .cse5 .cse12)) .cse7) (and .cse14 (and .cse15 .cse6) .cse10) (= 4 |old(~a15~0)|) (and .cse13 (and .cse0 (and .cse17 .cse12))) (= 8 |old(~a16~0)|) (= 12 |old(~a16~0)|) (and .cse0 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7) (and (and .cse0 (and .cse9 .cse4 .cse5 .cse12)) .cse7) (and .cse8 .cse0 .cse21 .cse1 .cse7) (and .cse8 .cse11 .cse1 .cse6 .cse0 (not (= ~a16~0 10)) .cse7)))))) [2019-10-02 01:35:33,055 INFO L443 ceAbstractionStarter]: For program point L1773-3(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:35:33,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:35:33 BoogieIcfgContainer [2019-10-02 01:35:33,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:35:33,084 INFO L168 Benchmark]: Toolchain (without parser) took 170313.84 ms. Allocated memory was 139.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 82.4 MB in the beginning and 1.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-10-02 01:35:33,085 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:35:33,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1492.05 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 82.0 MB in the beginning and 121.9 MB in the end (delta: -39.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2019-10-02 01:35:33,087 INFO L168 Benchmark]: Boogie Preprocessor took 202.84 ms. Allocated memory is still 203.4 MB. Free memory was 121.9 MB in the beginning and 111.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-10-02 01:35:33,087 INFO L168 Benchmark]: RCFGBuilder took 2745.52 ms. Allocated memory was 203.4 MB in the beginning and 271.6 MB in the end (delta: 68.2 MB). Free memory was 111.7 MB in the beginning and 142.4 MB in the end (delta: -30.6 MB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. [2019-10-02 01:35:33,091 INFO L168 Benchmark]: TraceAbstraction took 165869.19 ms. Allocated memory was 271.6 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 142.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:35:33,095 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.38 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1492.05 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 82.0 MB in the beginning and 121.9 MB in the end (delta: -39.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.84 ms. Allocated memory is still 203.4 MB. Free memory was 121.9 MB in the beginning and 111.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2745.52 ms. Allocated memory was 203.4 MB in the beginning and 271.6 MB in the end (delta: 68.2 MB). Free memory was 111.7 MB in the beginning and 142.4 MB in the end (delta: -30.6 MB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 165869.19 ms. Allocated memory was 271.6 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 142.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 1773]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(\old(a18) + 87 == 0) || ((3 == \old(a15) && !(12 == a16)) && a12 == 5)) || ((((((3 == \old(a15) && !(a16 == 8)) && !(12 == a16)) && !(10 == a16)) && !(9 == a12)) && 0 < a18 + 79) && 6 <= a12)) || (((((a15 == 4 && !(12 == a16)) && !(10 == a16)) && a18 + 87 <= 0) && 3 == \old(a15)) && 6 <= a12)) || (((3 == \old(a15) && !(a16 == 8)) && !(12 == a16)) && a12 == 6)) || (((((a15 == 4 && !(12 == a16)) && !(10 == a16)) && 0 < a18 + 79) && 3 == \old(a15)) && a12 == 9)) || ((((a16 == 9 || a18 <= 134) || !(3 == input)) || ((a15 == 4 || a15 == \old(a15)) && (((a12 == \old(a12) || a12 == 5) && (a16 == 8 || a16 == \old(a16))) || !(a15 == 4)))) && (((3 == \old(a15) && a12 == 7) && !(a16 == 8)) && !(10 == a16)) && !(4 == a15))) || (((a16 == 8 && a18 + 156 <= 0) && 3 == \old(a15)) && a15 == 3)) || ((3 == \old(a15) && ((!(a16 == 8) && !(10 == a16)) && !(7 == a12)) && !(4 == a15)) && a12 == 5)) || (a16 == 8 && ((3 == \old(a15) && !(7 == a12)) && 135 <= a18) && !(4 == a15))) || 10 == \old(a16)) || (((((a18 + 87 <= 0 && 3 == \old(a15)) && !(a16 == 8)) && !(10 == a16)) && !(4 == a15)) && a12 == 9)) || (a16 == 8 && (a18 + 87 <= 0 && a12 <= 5) && a15 == \old(a15))) || (((a16 == \old(a16) && a12 == 5) && a18 + 87 == 0) && a15 == \old(a15))) || !(5 == \old(a12))) || ((3 == \old(a15) && (!(7 == a12) && !(9 == a12)) && !(4 == a15)) && 6 <= a12)) || ((a15 == 3 && (3 == \old(a15) && ((!(a16 == 8) && !(10 == a16)) && !(7 == a12)) && !(4 == a15)) && 0 < a18 + 79) && a12 == 9)) || 4 == \old(a15)) || (a16 == 8 && 3 == \old(a15) && a12 <= 5 && !(4 == a15))) || 8 == \old(a16)) || 12 == \old(a16)) || ((((((3 == \old(a15) && !(12 == a16)) && !(7 == a12)) && !(10 == a16)) && !(9 == a12)) && 0 < a18 + 79) && 6 <= a12)) || ((3 == \old(a15) && ((a18 + 87 <= 0 && !(10 == a16)) && !(9 == a12)) && !(4 == a15)) && 6 <= a12)) || ((((a15 == 4 && 3 == \old(a15)) && (!(a16 == 8) && !(10 == a16)) && !(7 == a12)) && !(12 == a16)) && 6 <= a12)) || ((((((a15 == 4 && (((a16 == 9 || a18 <= 134) || !(3 == input)) || ((a15 == 4 || a15 == \old(a15)) && (((a12 == \old(a12) || a12 == 5) && (a16 == 8 || a16 == \old(a16))) || !(a15 == 4))))) && !(12 == a16)) && 0 < a18 + 79) && 3 == \old(a15)) && !(a16 == 10)) && 6 <= a12) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 409 locations, 1 error locations. SAFE Result, 165.7s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 101.6s AutomataDifference, 0.0s DeadEndRemovalTime, 31.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1314 SDtfs, 33552 SDslu, 3257 SDs, 0 SdLazy, 83733 SolverSat, 8990 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7260 GetRequests, 6936 SyntacticMatches, 9 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12531 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25306occurred in iteration=12, 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: 4.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 12995 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 3263 PreInvPairs, 3974 NumberOfFragments, 2836 HoareAnnotationTreeSize, 3263 FomulaSimplifications, 981694 FormulaSimplificationTreeSizeReduction, 7.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 279067 FormulaSimplificationTreeSizeReductionInter, 24.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 15076 NumberOfCodeBlocks, 15076 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 15055 ConstructedInterpolants, 0 QuantifiedInterpolants, 72111596 SizeOfPredicates, 7 NumberOfNonLiveVariables, 9000 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 30355/34079 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...