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_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:34:12,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:34:12,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:34:12,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:34:12,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:34:12,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:34:12,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:34:12,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:34:12,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:34:12,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:34:12,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:34:12,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:34:12,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:34:12,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:34:12,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:34:12,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:34:12,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:34:12,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:34:12,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:34:12,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:34:12,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:34:12,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:34:12,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:34:12,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:34:12,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:34:12,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:34:12,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:34:12,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:34:12,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:34:12,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:34:12,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:34:12,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:34:12,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:34:12,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:34:12,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:34:12,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:34:12,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:34:12,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:34:12,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:34:12,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:34:12,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:34:12,737 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:34:12,755 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:34:12,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:34:12,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:34:12,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:34:12,756 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:34:12,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:34:12,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:34:12,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:34:12,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:34:12,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:34:12,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:34:12,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:34:12,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:34:12,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:34:12,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:34:12,759 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:34:12,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:34:12,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:34:12,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:34:12,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:34:12,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:34:12,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:34:12,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:34:12,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:34:12,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:34:12,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:34:12,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:34:12,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:34:12,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:34:12,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:34:12,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:34:12,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:34:12,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:34:12,809 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:34:12,810 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label28.c [2019-10-02 01:34:12,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf9940e5/fe84652d899d46c2983a3512d97601f0/FLAGcd1ffdab3 [2019-10-02 01:34:13,562 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:34:13,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label28.c [2019-10-02 01:34:13,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf9940e5/fe84652d899d46c2983a3512d97601f0/FLAGcd1ffdab3 [2019-10-02 01:34:13,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf9940e5/fe84652d899d46c2983a3512d97601f0 [2019-10-02 01:34:13,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:34:13,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:34:13,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:34:13,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:34:13,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:34:13,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:34:13" (1/1) ... [2019-10-02 01:34:13,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d79651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:13, skipping insertion in model container [2019-10-02 01:34:13,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:34:13" (1/1) ... [2019-10-02 01:34:13,754 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:34:13,837 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:34:14,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:34:14,619 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:34:15,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:34:15,241 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:34:15,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15 WrapperNode [2019-10-02 01:34:15,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:34:15,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:34:15,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:34:15,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:34:15,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (1/1) ... [2019-10-02 01:34:15,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (1/1) ... [2019-10-02 01:34:15,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (1/1) ... [2019-10-02 01:34:15,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (1/1) ... [2019-10-02 01:34:15,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (1/1) ... [2019-10-02 01:34:15,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (1/1) ... [2019-10-02 01:34:15,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (1/1) ... [2019-10-02 01:34:15,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:34:15,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:34:15,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:34:15,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:34:15,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (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:34:15,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:34:15,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:34:15,515 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:34:15,515 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:34:15,515 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:34:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:34:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:34:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:34:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:34:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:34:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:34:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:34:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:34:17,833 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:34:17,833 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:34:17,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:34:17 BoogieIcfgContainer [2019-10-02 01:34:17,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:34:17,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:34:17,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:34:17,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:34:17,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:34:13" (1/3) ... [2019-10-02 01:34:17,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8886e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:34:17, skipping insertion in model container [2019-10-02 01:34:17,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:15" (2/3) ... [2019-10-02 01:34:17,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8886e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:34:17, skipping insertion in model container [2019-10-02 01:34:17,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:34:17" (3/3) ... [2019-10-02 01:34:17,844 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label28.c [2019-10-02 01:34:17,854 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:34:17,863 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:34:17,881 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:34:17,917 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:34:17,918 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:34:17,918 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:34:17,918 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:34:17,918 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:34:17,918 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:34:17,919 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:34:17,919 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:34:17,919 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:34:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 01:34:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 01:34:17,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:17,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:34:17,961 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash 259572933, now seen corresponding path program 1 times [2019-10-02 01:34:17,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:17,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:18,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:18,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:18,357 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:34:18,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:34:18,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:34:18,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:34:18,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:34:18,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:34:18,382 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-10-02 01:34:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:21,167 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-10-02 01:34:21,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:34:21,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-02 01:34:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:21,193 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 01:34:21,193 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 01:34:21,203 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:34:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 01:34:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-10-02 01:34:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 01:34:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1166 transitions. [2019-10-02 01:34:21,315 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1166 transitions. Word has length 72 [2019-10-02 01:34:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:21,317 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1166 transitions. [2019-10-02 01:34:21,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:34:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1166 transitions. [2019-10-02 01:34:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 01:34:21,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:21,335 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, 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] [2019-10-02 01:34:21,335 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1254837677, now seen corresponding path program 1 times [2019-10-02 01:34:21,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:21,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:21,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:21,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:21,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:34:21,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:34:21,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:34:21,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:34:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:34:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:34:21,658 INFO L87 Difference]: Start difference. First operand 682 states and 1166 transitions. Second operand 6 states. [2019-10-02 01:34:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:24,841 INFO L93 Difference]: Finished difference Result 1733 states and 2953 transitions. [2019-10-02 01:34:24,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:34:24,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-10-02 01:34:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:24,854 INFO L225 Difference]: With dead ends: 1733 [2019-10-02 01:34:24,854 INFO L226 Difference]: Without dead ends: 1057 [2019-10-02 01:34:24,857 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:34:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-10-02 01:34:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1039. [2019-10-02 01:34:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-10-02 01:34:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1701 transitions. [2019-10-02 01:34:24,929 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1701 transitions. Word has length 179 [2019-10-02 01:34:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:24,931 INFO L475 AbstractCegarLoop]: Abstraction has 1039 states and 1701 transitions. [2019-10-02 01:34:24,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:34:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1701 transitions. [2019-10-02 01:34:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 01:34:24,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:24,938 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, 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] [2019-10-02 01:34:24,938 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:24,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:24,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1819152172, now seen corresponding path program 1 times [2019-10-02 01:34:24,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:24,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:24,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:34:25,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:34:25,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:34:25,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:34:25,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:34:25,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:34:25,188 INFO L87 Difference]: Start difference. First operand 1039 states and 1701 transitions. Second operand 6 states. [2019-10-02 01:34:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:27,899 INFO L93 Difference]: Finished difference Result 3130 states and 5158 transitions. [2019-10-02 01:34:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:34:27,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-10-02 01:34:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:27,918 INFO L225 Difference]: With dead ends: 3130 [2019-10-02 01:34:27,918 INFO L226 Difference]: Without dead ends: 2097 [2019-10-02 01:34:27,922 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:34:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2019-10-02 01:34:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2081. [2019-10-02 01:34:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-10-02 01:34:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3125 transitions. [2019-10-02 01:34:27,995 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3125 transitions. Word has length 182 [2019-10-02 01:34:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:28,004 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3125 transitions. [2019-10-02 01:34:28,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:34:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3125 transitions. [2019-10-02 01:34:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 01:34:28,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:28,009 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:34:28,010 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash 244891436, now seen corresponding path program 1 times [2019-10-02 01:34:28,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:28,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:28,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:28,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:28,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 130 proven. 106 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:34:28,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:34:28,300 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:34:28,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:28,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:34:28,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:34:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:34:28,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:34:28,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:34:28,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:34:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:34:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:34:28,616 INFO L87 Difference]: Start difference. First operand 2081 states and 3125 transitions. Second operand 9 states. [2019-10-02 01:34:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:36,467 INFO L93 Difference]: Finished difference Result 6988 states and 10576 transitions. [2019-10-02 01:34:36,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 01:34:36,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2019-10-02 01:34:36,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:36,498 INFO L225 Difference]: With dead ends: 6988 [2019-10-02 01:34:36,498 INFO L226 Difference]: Without dead ends: 4913 [2019-10-02 01:34:36,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-10-02 01:34:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4913 states. [2019-10-02 01:34:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4913 to 4195. [2019-10-02 01:34:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-02 01:34:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 5213 transitions. [2019-10-02 01:34:36,656 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 5213 transitions. Word has length 297 [2019-10-02 01:34:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:36,656 INFO L475 AbstractCegarLoop]: Abstraction has 4195 states and 5213 transitions. [2019-10-02 01:34:36,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:34:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 5213 transitions. [2019-10-02 01:34:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-10-02 01:34:36,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:36,675 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:36,675 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash -175166981, now seen corresponding path program 1 times [2019-10-02 01:34:36,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:36,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:36,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:36,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:36,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 366 proven. 242 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-10-02 01:34:38,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:34:38,083 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:34:38,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:38,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:34:38,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:34:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 754 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-10-02 01:34:38,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:34:38,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-02 01:34:38,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 01:34:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 01:34:38,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:34:38,633 INFO L87 Difference]: Start difference. First operand 4195 states and 5213 transitions. Second operand 12 states. [2019-10-02 01:34:46,093 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-10-02 01:34:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:46,483 INFO L93 Difference]: Finished difference Result 10890 states and 13909 transitions. [2019-10-02 01:34:46,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 01:34:46,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 634 [2019-10-02 01:34:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:46,522 INFO L225 Difference]: With dead ends: 10890 [2019-10-02 01:34:46,522 INFO L226 Difference]: Without dead ends: 6701 [2019-10-02 01:34:46,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 657 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 01:34:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6701 states. [2019-10-02 01:34:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6701 to 6637. [2019-10-02 01:34:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6637 states. [2019-10-02 01:34:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6637 states to 6637 states and 8216 transitions. [2019-10-02 01:34:46,709 INFO L78 Accepts]: Start accepts. Automaton has 6637 states and 8216 transitions. Word has length 634 [2019-10-02 01:34:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:46,710 INFO L475 AbstractCegarLoop]: Abstraction has 6637 states and 8216 transitions. [2019-10-02 01:34:46,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 01:34:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6637 states and 8216 transitions. [2019-10-02 01:34:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2019-10-02 01:34:46,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:46,748 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:34:46,748 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash 941895881, now seen corresponding path program 1 times [2019-10-02 01:34:46,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:46,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:46,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:46,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:46,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 671 proven. 115 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2019-10-02 01:34:47,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:34:47,824 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:34:47,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:48,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:34:48,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:34:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 1161 proven. 2 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2019-10-02 01:34:48,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:34:48,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:34:48,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:34:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:34:48,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:34:48,469 INFO L87 Difference]: Start difference. First operand 6637 states and 8216 transitions. Second operand 9 states. [2019-10-02 01:34:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:52,828 INFO L93 Difference]: Finished difference Result 14650 states and 18519 transitions. [2019-10-02 01:34:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 01:34:52,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 859 [2019-10-02 01:34:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:52,864 INFO L225 Difference]: With dead ends: 14650 [2019-10-02 01:34:52,865 INFO L226 Difference]: Without dead ends: 8358 [2019-10-02 01:34:52,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 863 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:34:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8358 states. [2019-10-02 01:34:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8358 to 8003. [2019-10-02 01:34:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-10-02 01:34:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 9758 transitions. [2019-10-02 01:34:53,048 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 9758 transitions. Word has length 859 [2019-10-02 01:34:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:53,050 INFO L475 AbstractCegarLoop]: Abstraction has 8003 states and 9758 transitions. [2019-10-02 01:34:53,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:34:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 9758 transitions. [2019-10-02 01:34:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 867 [2019-10-02 01:34:53,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:53,068 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:53,069 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:53,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1925407971, now seen corresponding path program 1 times [2019-10-02 01:34:53,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:53,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:53,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:53,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:53,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1905 backedges. 976 proven. 2 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2019-10-02 01:34:55,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:34:55,209 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:34:55,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:55,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:34:55,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:34:55,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:34:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1905 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2019-10-02 01:34:56,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:34:56,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2019-10-02 01:34:56,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:34:56,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:34:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:34:56,131 INFO L87 Difference]: Start difference. First operand 8003 states and 9758 transitions. Second operand 17 states. [2019-10-02 01:35:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:10,824 INFO L93 Difference]: Finished difference Result 23205 states and 30125 transitions. [2019-10-02 01:35:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-02 01:35:10,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 866 [2019-10-02 01:35:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:10,891 INFO L225 Difference]: With dead ends: 23205 [2019-10-02 01:35:10,891 INFO L226 Difference]: Without dead ends: 15547 [2019-10-02 01:35:10,915 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 919 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1308, Invalid=5334, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 01:35:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15547 states. [2019-10-02 01:35:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15547 to 14299. [2019-10-02 01:35:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14299 states. [2019-10-02 01:35:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14299 states to 14299 states and 17770 transitions. [2019-10-02 01:35:11,211 INFO L78 Accepts]: Start accepts. Automaton has 14299 states and 17770 transitions. Word has length 866 [2019-10-02 01:35:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:11,212 INFO L475 AbstractCegarLoop]: Abstraction has 14299 states and 17770 transitions. [2019-10-02 01:35:11,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:35:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14299 states and 17770 transitions. [2019-10-02 01:35:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2019-10-02 01:35:11,240 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:11,241 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, 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, 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, 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] [2019-10-02 01:35:11,242 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash 432458408, now seen corresponding path program 1 times [2019-10-02 01:35:11,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:11,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:11,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:11,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:11,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 505 proven. 812 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-10-02 01:35:13,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:13,894 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:35:13,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:14,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 01:35:14,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 955 proven. 2 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2019-10-02 01:35:14,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:35:14,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 16 [2019-10-02 01:35:14,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:35:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:35:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:35:14,695 INFO L87 Difference]: Start difference. First operand 14299 states and 17770 transitions. Second operand 16 states. [2019-10-02 01:35:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:23,694 INFO L93 Difference]: Finished difference Result 30695 states and 37975 transitions. [2019-10-02 01:35:23,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 01:35:23,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 973 [2019-10-02 01:35:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:23,742 INFO L225 Difference]: With dead ends: 30695 [2019-10-02 01:35:23,743 INFO L226 Difference]: Without dead ends: 16402 [2019-10-02 01:35:23,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 999 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=471, Invalid=1509, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 01:35:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16402 states. [2019-10-02 01:35:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16402 to 15672. [2019-10-02 01:35:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15672 states. [2019-10-02 01:35:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15672 states to 15672 states and 19162 transitions. [2019-10-02 01:35:24,068 INFO L78 Accepts]: Start accepts. Automaton has 15672 states and 19162 transitions. Word has length 973 [2019-10-02 01:35:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:24,070 INFO L475 AbstractCegarLoop]: Abstraction has 15672 states and 19162 transitions. [2019-10-02 01:35:24,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:35:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 15672 states and 19162 transitions. [2019-10-02 01:35:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2019-10-02 01:35:24,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:24,104 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 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:35:24,105 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:24,105 INFO L82 PathProgramCache]: Analyzing trace with hash 805250488, now seen corresponding path program 1 times [2019-10-02 01:35:24,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:24,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:24,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:24,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:24,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 1092 proven. 2 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2019-10-02 01:35:25,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:25,931 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:35:25,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:26,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:35:26,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:26,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:35:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 1092 proven. 2 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2019-10-02 01:35:26,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:35:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:35:26,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:35:26,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:35:26,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:35:26,913 INFO L87 Difference]: Start difference. First operand 15672 states and 19162 transitions. Second operand 11 states. [2019-10-02 01:35:36,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:36,661 INFO L93 Difference]: Finished difference Result 32632 states and 41326 transitions. [2019-10-02 01:35:36,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 01:35:36,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1076 [2019-10-02 01:35:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:36,699 INFO L225 Difference]: With dead ends: 32632 [2019-10-02 01:35:36,699 INFO L226 Difference]: Without dead ends: 15361 [2019-10-02 01:35:36,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 1099 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 01:35:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15361 states. [2019-10-02 01:35:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15361 to 14100. [2019-10-02 01:35:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14100 states. [2019-10-02 01:35:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14100 states to 14100 states and 15353 transitions. [2019-10-02 01:35:37,023 INFO L78 Accepts]: Start accepts. Automaton has 14100 states and 15353 transitions. Word has length 1076 [2019-10-02 01:35:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:37,025 INFO L475 AbstractCegarLoop]: Abstraction has 14100 states and 15353 transitions. [2019-10-02 01:35:37,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:35:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 14100 states and 15353 transitions. [2019-10-02 01:35:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1346 [2019-10-02 01:35:37,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:37,069 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, 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, 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, 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, 3, 3, 3, 3, 3, 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] [2019-10-02 01:35:37,069 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:37,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:37,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1892379591, now seen corresponding path program 1 times [2019-10-02 01:35:37,070 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:37,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:37,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:37,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:37,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3435 backedges. 981 proven. 286 refuted. 0 times theorem prover too weak. 2168 trivial. 0 not checked. [2019-10-02 01:35:38,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:38,920 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:35:38,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:39,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1727 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:35:39,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3435 backedges. 2401 proven. 2 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2019-10-02 01:35:40,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:35:40,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:35:40,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:35:40,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:35:40,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:35:40,114 INFO L87 Difference]: Start difference. First operand 14100 states and 15353 transitions. Second operand 9 states. [2019-10-02 01:35:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:43,691 INFO L93 Difference]: Finished difference Result 28310 states and 31126 transitions. [2019-10-02 01:35:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:35:43,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1345 [2019-10-02 01:35:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:43,727 INFO L225 Difference]: With dead ends: 28310 [2019-10-02 01:35:43,727 INFO L226 Difference]: Without dead ends: 14555 [2019-10-02 01:35:43,745 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1352 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:35:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14555 states. [2019-10-02 01:35:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14555 to 13763. [2019-10-02 01:35:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13763 states. [2019-10-02 01:35:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13763 states to 13763 states and 14638 transitions. [2019-10-02 01:35:43,956 INFO L78 Accepts]: Start accepts. Automaton has 13763 states and 14638 transitions. Word has length 1345 [2019-10-02 01:35:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:43,957 INFO L475 AbstractCegarLoop]: Abstraction has 13763 states and 14638 transitions. [2019-10-02 01:35:43,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:35:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 13763 states and 14638 transitions. [2019-10-02 01:35:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1348 [2019-10-02 01:35:43,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:43,993 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-10-02 01:35:43,993 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1266078485, now seen corresponding path program 1 times [2019-10-02 01:35:43,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:43,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:43,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 2079 proven. 443 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-10-02 01:35:46,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:46,634 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:35:46,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:46,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1731 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:35:46,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:47,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:35:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 1499 proven. 2 refuted. 0 times theorem prover too weak. 2093 trivial. 0 not checked. [2019-10-02 01:35:48,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:35:48,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-10-02 01:35:48,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:35:48,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:35:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:35:48,204 INFO L87 Difference]: Start difference. First operand 13763 states and 14638 transitions. Second operand 16 states. [2019-10-02 01:36:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:05,359 INFO L93 Difference]: Finished difference Result 31363 states and 33475 transitions. [2019-10-02 01:36:05,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 01:36:05,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1347 [2019-10-02 01:36:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:05,397 INFO L225 Difference]: With dead ends: 31363 [2019-10-02 01:36:05,397 INFO L226 Difference]: Without dead ends: 17267 [2019-10-02 01:36:05,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1461 GetRequests, 1398 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=634, Invalid=3398, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 01:36:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17267 states. [2019-10-02 01:36:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17267 to 16140. [2019-10-02 01:36:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16140 states. [2019-10-02 01:36:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16140 states to 16140 states and 17053 transitions. [2019-10-02 01:36:05,653 INFO L78 Accepts]: Start accepts. Automaton has 16140 states and 17053 transitions. Word has length 1347 [2019-10-02 01:36:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:05,654 INFO L475 AbstractCegarLoop]: Abstraction has 16140 states and 17053 transitions. [2019-10-02 01:36:05,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:36:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16140 states and 17053 transitions. [2019-10-02 01:36:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1403 [2019-10-02 01:36:05,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:05,692 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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:36:05,693 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash 247484914, now seen corresponding path program 1 times [2019-10-02 01:36:05,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:05,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:05,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:05,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3620 backedges. 2043 proven. 756 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2019-10-02 01:36:07,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:07,666 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:36:07,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:08,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:36:08,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3620 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 3147 trivial. 0 not checked. [2019-10-02 01:36:08,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:36:08,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 01:36:08,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:36:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:36:08,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:36:08,761 INFO L87 Difference]: Start difference. First operand 16140 states and 17053 transitions. Second operand 9 states. [2019-10-02 01:36:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:13,821 INFO L93 Difference]: Finished difference Result 35973 states and 38104 transitions. [2019-10-02 01:36:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:36:13,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1402 [2019-10-02 01:36:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:13,824 INFO L225 Difference]: With dead ends: 35973 [2019-10-02 01:36:13,824 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:36:13,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1438 GetRequests, 1419 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:36:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:36:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:36:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:36:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:36:13,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1402 [2019-10-02 01:36:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:13,853 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:36:13,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:36:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:36:13,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:36:13,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:36:15,380 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 609 DAG size of output: 579 [2019-10-02 01:36:17,283 WARN L191 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 609 DAG size of output: 579 [2019-10-02 01:36:23,540 WARN L191 SmtUtils]: Spent 6.23 s on a formula simplification. DAG size of input: 584 DAG size of output: 124 [2019-10-02 01:36:25,601 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 361 DAG size of output: 84 [2019-10-02 01:36:27,639 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 361 DAG size of output: 84 [2019-10-02 01:36:30,606 WARN L191 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 405 DAG size of output: 107 [2019-10-02 01:36:36,825 WARN L191 SmtUtils]: Spent 6.20 s on a formula simplification. DAG size of input: 584 DAG size of output: 124 [2019-10-02 01:36:36,829 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:36:36,829 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:36:36,829 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:36:36,829 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,829 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:36:36,829 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,830 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,830 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,830 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,830 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,830 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,830 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,830 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,830 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,831 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,832 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,832 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,832 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,832 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,832 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,832 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,832 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,832 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,833 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,833 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse20 (= ~a12~0 |old(~a12~0)|)) (.cse19 (= ~a12~0 8)) (.cse15 (= 12 |old(~a16~0)|)) (.cse17 (= 9 |old(~a16~0)|)) (.cse18 (= 4 |old(~a15~0)|)) (.cse8 (= ~a16~0 |old(~a16~0)|)) (.cse9 (= ~a18~0 |old(~a18~0)|)) (.cse10 (= ~a12~0 9)) (.cse7 (= ~a15~0 |old(~a15~0)|))) (let ((.cse0 (not (= 3 |old(~a15~0)|))) (.cse11 (and (not (< 0 (+ |old(~a18~0)| 79))) (or (not (= 7 |old(~a12~0)|)) (not (<= (+ |old(~a18~0)| 156) 0))))) (.cse1 (and .cse8 .cse9 .cse10 .cse7)) (.cse2 (not (<= (+ |old(~a18~0)| 87) 0))) (.cse4 (not (= 9 |old(~a12~0)|))) (.cse3 (or .cse15 .cse17 .cse18)) (.cse5 (not (= 8 |old(~a12~0)|))) (.cse6 (and .cse8 .cse19 .cse9 .cse7)) (.cse14 (not .cse18)) (.cse12 (and .cse20 .cse8 .cse9 .cse7)) (.cse16 (= 10 |old(~a16~0)|)) (.cse13 (not (<= |old(~a12~0)| 7)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4)) (or .cse0 .cse5 .cse6) (or (and .cse7 (and .cse8 .cse9 .cse10)) .cse0 .cse4 .cse11) (or .cse12 (or .cse0 .cse11 .cse13)) (or .cse14 .cse15 .cse1 .cse16 .cse4) (or .cse17 .cse18 .cse1 .cse16 .cse2 .cse4) (or (not (<= |old(~a12~0)| 6)) .cse15 .cse17 .cse12) (or (or .cse5 .cse3) (and .cse8 (and .cse19 .cse9) .cse7)) (or .cse17 .cse18 .cse12 .cse16 .cse13) (or .cse15 .cse5 .cse16 .cse6) (or .cse14 .cse15 .cse12 .cse16 .cse13) (or (and (and .cse20 .cse9) .cse8 .cse7) (or .cse18 (not (<= |old(~a12~0)| 5))))))) [2019-10-02 01:36:36,833 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,834 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,834 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,834 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,834 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,834 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,834 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,834 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:36:36,834 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,835 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,835 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,835 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,835 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,835 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,835 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,835 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,835 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-10-02 01:36:36,836 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,836 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,836 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,836 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,836 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,836 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,836 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,836 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,837 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,837 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,837 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,837 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,837 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,837 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:36:36,837 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,837 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:36:36,838 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:36:36,838 INFO L439 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse4 (= 12 |old(~a16~0)|)) (.cse13 (= 9 |old(~a16~0)|)) (.cse14 (= 4 |old(~a15~0)|)) (.cse5 (= ~a12~0 |old(~a12~0)|)) (.cse6 (= ~a15~0 |old(~a15~0)|)) (.cse7 (= ~a16~0 |old(~a16~0)|)) (.cse8 (= ~a18~0 |old(~a18~0)|)) (.cse0 (not (= 7 |old(~a12~0)|)))) (let ((.cse2 (not (= 3 calculate_output_~input))) (.cse19 (and (not (< 0 (+ |old(~a18~0)| 79))) (or .cse0 (not (<= (+ |old(~a18~0)| 156) 0))))) (.cse18 (and .cse5 .cse6 .cse7 .cse8)) (.cse10 (not (<= |old(~a12~0)| 7))) (.cse1 (not (= 3 |old(~a15~0)|))) (.cse15 (not (<= (+ |old(~a18~0)| 87) 0))) (.cse3 (not .cse14)) (.cse16 (not (= 9 |old(~a12~0)|))) (.cse17 (= ~a12~0 9)) (.cse20 (or .cse4 .cse13 .cse14)) (.cse12 (not (= 8 |old(~a12~0)|))) (.cse9 (= 10 |old(~a16~0)|)) (.cse11 (= ~a12~0 8))) (and (or (or .cse0 (not (= 11 |old(~a16~0)|))) .cse1 (or .cse2 (< 0 (+ ~a18~0 79)))) (or .cse3 .cse4 (and .cse5 (or (not (= ~a16~0 8)) (not (= ~a12~0 7)) .cse2) .cse6 .cse7 .cse8) .cse9 .cse10) (or .cse1 (and .cse6 .cse7 .cse11 .cse8) .cse12) (or .cse13 .cse14 .cse9 .cse15 .cse16 (and .cse6 .cse7 .cse8 .cse17)) (or (and .cse8 (and .cse5 .cse7) .cse6) (or .cse14 (not (<= |old(~a12~0)| 5)))) (or (not (<= |old(~a12~0)| 6)) .cse4 .cse13 .cse18) (or (and .cse5 (= ~a15~0 3) .cse7 .cse8) (or .cse1 .cse19 .cse10)) (or (and (and .cse8 .cse17) .cse7 .cse6) .cse1 .cse16 .cse19) (or .cse18 .cse13 .cse14 .cse9 .cse10) (or .cse1 (and (and .cse7 .cse8 .cse17) .cse6) (or .cse15 .cse20 .cse16)) (or .cse3 .cse4 .cse9 .cse16 (and .cse7 .cse8 .cse17 .cse6)) (or (and (or .cse12 .cse20) (or .cse4 .cse12 .cse9)) (and .cse7 (and .cse8 .cse11) .cse6))))) [2019-10-02 01:36:36,838 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,838 INFO L443 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2019-10-02 01:36:36,838 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:36:36,839 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,840 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,841 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,842 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,843 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,844 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:36:36,845 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,845 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:36:36,845 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,845 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,845 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,845 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,845 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,845 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,846 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,847 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,848 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,849 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,849 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,849 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse20 (= ~a12~0 |old(~a12~0)|)) (.cse19 (= ~a12~0 8)) (.cse15 (= 12 |old(~a16~0)|)) (.cse17 (= 9 |old(~a16~0)|)) (.cse18 (= 4 |old(~a15~0)|)) (.cse8 (= ~a16~0 |old(~a16~0)|)) (.cse9 (= ~a18~0 |old(~a18~0)|)) (.cse10 (= ~a12~0 9)) (.cse7 (= ~a15~0 |old(~a15~0)|))) (let ((.cse0 (not (= 3 |old(~a15~0)|))) (.cse11 (and (not (< 0 (+ |old(~a18~0)| 79))) (or (not (= 7 |old(~a12~0)|)) (not (<= (+ |old(~a18~0)| 156) 0))))) (.cse1 (and .cse8 .cse9 .cse10 .cse7)) (.cse2 (not (<= (+ |old(~a18~0)| 87) 0))) (.cse4 (not (= 9 |old(~a12~0)|))) (.cse3 (or .cse15 .cse17 .cse18)) (.cse5 (not (= 8 |old(~a12~0)|))) (.cse6 (and .cse8 .cse19 .cse9 .cse7)) (.cse14 (not .cse18)) (.cse12 (and .cse20 .cse8 .cse9 .cse7)) (.cse16 (= 10 |old(~a16~0)|)) (.cse13 (not (<= |old(~a12~0)| 7)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4)) (or .cse0 .cse5 .cse6) (or (and .cse7 (and .cse8 .cse9 .cse10)) .cse0 .cse4 .cse11) (or .cse12 (or .cse0 .cse11 .cse13)) (or .cse14 .cse15 .cse1 .cse16 .cse4) (or .cse17 .cse18 .cse1 .cse16 .cse2 .cse4) (or (not (<= |old(~a12~0)| 6)) .cse15 .cse17 .cse12) (or (or .cse5 .cse3) (and .cse8 (and .cse19 .cse9) .cse7)) (or .cse17 .cse18 .cse12 .cse16 .cse13) (or .cse15 .cse5 .cse16 .cse6) (or .cse14 .cse15 .cse12 .cse16 .cse13) (or (and (and .cse20 .cse9) .cse8 .cse7) (or .cse18 (not (<= |old(~a12~0)| 5))))))) [2019-10-02 01:36:36,849 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,849 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,849 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,849 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:36:36,850 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,851 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,852 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:36:36,852 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,852 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:36:36,852 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:36:36,852 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,852 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,852 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,852 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,853 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,853 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,853 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,853 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,853 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,853 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,853 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,853 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,854 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:36:36,854 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:36:36,854 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:36:36,854 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,854 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,854 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,854 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,854 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:36:36,855 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,856 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:36:36,856 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:36:36,856 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,856 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,856 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,859 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,859 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,859 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:36:36,860 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:36:36,861 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2019-10-02 01:36:36,861 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,861 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,861 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,861 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,861 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,861 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:36:36,862 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,863 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,864 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,865 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,866 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:36:36,867 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:36:36,868 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,869 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,870 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,871 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,872 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-10-02 01:36:36,873 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:36:36,874 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 9)) (not (= 12 ~a16~0)) (<= ~a12~0 5) (not (= 10 ~a16~0)) (= (+ ~a18~0 87) 0) (not (= 4 ~a15~0))) [2019-10-02 01:36:36,874 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:36:36,874 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:36:36,874 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (= 12 |old(~a16~0)|) (= 9 |old(~a16~0)|) (= 4 |old(~a15~0)|) (not (= (+ |old(~a18~0)| 87) 0)) (not (<= |old(~a12~0)| 5)) (= 10 |old(~a16~0)|) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|))) [2019-10-02 01:36:36,874 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:36:36,874 INFO L439 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse4 (= 3 |old(~a15~0)|))) (let ((.cse9 (not (= ~a16~0 9))) (.cse5 (not (= 12 ~a16~0))) (.cse10 (not (= 4 ~a15~0))) (.cse17 (+ ~a18~0 87)) (.cse24 (not .cse4)) (.cse25 (not (= 11 |old(~a16~0)|)))) (let ((.cse20 (< 0 (+ ~a18~0 79))) (.cse12 (= ~a12~0 8)) (.cse21 (or .cse24 (<= 0 (+ |old(~a18~0)| 78)) (not (= 6 |old(~a12~0)|)) .cse25)) (.cse8 (<= .cse17 0)) (.cse22 (or .cse24 (not (= 7 |old(~a12~0)|)) .cse25)) (.cse6 (not (= 10 ~a16~0))) (.cse2 (or (and (<= 5 |old(~a12~0)|) (<= 10 |old(~a16~0)|)) (and (<= 9 |old(~a12~0)|) (<= 9 |old(~a16~0)|)))) (.cse23 (and .cse9 .cse5 .cse10)) (.cse16 (<= ~a12~0 7))) (let ((.cse11 (and .cse23 .cse16)) (.cse3 (= ~a15~0 4)) (.cse15 (and .cse5 .cse16 .cse6 .cse2)) (.cse0 (= ~a16~0 8)) (.cse19 (and .cse21 (and .cse8 .cse23 .cse22) .cse2)) (.cse1 (and .cse21 (and .cse5 .cse12 .cse22 .cse10))) (.cse13 (= ~a15~0 3)) (.cse14 (or (and (<= (+ ~a18~0 156) 0) (= ~a12~0 7)) .cse20)) (.cse7 (= ~a12~0 9)) (.cse18 (= ~a15~0 |old(~a15~0)|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (and .cse5 .cse6 .cse2) .cse7) (and .cse4 (and (and (and .cse8 .cse9 .cse6 .cse10) .cse2) .cse7)) (not (= (+ |old(~a18~0)| 87) 0)) (and .cse0 .cse11 .cse2) (and .cse4 (and .cse5 .cse12 .cse6 .cse2)) (and .cse4 (or (and .cse13 .cse14 .cse15) (and (and .cse11 .cse2) .cse13 .cse14))) (= 12 |old(~a16~0)|) (and .cse4 (and (and .cse9 .cse16 .cse6 .cse10) .cse2)) (and .cse3 .cse4 .cse15) (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= .cse17 0) .cse18) (and .cse0 .cse19 .cse7) (and .cse4 (<= ~a12~0 6) (and .cse9 .cse5 .cse2)) (and .cse4 (and .cse2 .cse12) .cse18) (and .cse4 (and (and (<= ~a12~0 5) .cse10) .cse2)) (not (<= |old(~a12~0)| 5)) (and .cse0 (and .cse2 .cse7) .cse13 .cse20) (and .cse4 (and .cse19 .cse7) .cse18) (= 9 |old(~a16~0)|) (and .cse4 (and .cse1 .cse2)) (and (and .cse13 .cse14 .cse2 .cse7) .cse18) (= 4 |old(~a15~0)|) (= 10 |old(~a16~0)|)))))) [2019-10-02 01:36:36,875 INFO L443 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2019-10-02 01:36:36,875 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-10-02 01:36:36,875 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse4 (= 3 |old(~a15~0)|))) (let ((.cse9 (not (= ~a16~0 9))) (.cse5 (not (= 12 ~a16~0))) (.cse10 (not (= 4 ~a15~0))) (.cse17 (+ ~a18~0 87)) (.cse24 (not .cse4)) (.cse25 (not (= 11 |old(~a16~0)|)))) (let ((.cse20 (< 0 (+ ~a18~0 79))) (.cse12 (= ~a12~0 8)) (.cse21 (or .cse24 (<= 0 (+ |old(~a18~0)| 78)) (not (= 6 |old(~a12~0)|)) .cse25)) (.cse8 (<= .cse17 0)) (.cse22 (or .cse24 (not (= 7 |old(~a12~0)|)) .cse25)) (.cse6 (not (= 10 ~a16~0))) (.cse2 (or (and (<= 5 |old(~a12~0)|) (<= 10 |old(~a16~0)|)) (and (<= 9 |old(~a12~0)|) (<= 9 |old(~a16~0)|)))) (.cse23 (and .cse9 .cse5 .cse10)) (.cse16 (<= ~a12~0 7))) (let ((.cse11 (and .cse23 .cse16)) (.cse3 (= ~a15~0 4)) (.cse15 (and .cse5 .cse16 .cse6 .cse2)) (.cse0 (= ~a16~0 8)) (.cse19 (and .cse21 (and .cse8 .cse23 .cse22) .cse2)) (.cse1 (and .cse21 (and .cse5 .cse12 .cse22 .cse10))) (.cse13 (= ~a15~0 3)) (.cse14 (or (and (<= (+ ~a18~0 156) 0) (= ~a12~0 7)) .cse20)) (.cse7 (= ~a12~0 9)) (.cse18 (= ~a15~0 |old(~a15~0)|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (and .cse5 .cse6 .cse2) .cse7) (and .cse4 (and (and (and .cse8 .cse9 .cse6 .cse10) .cse2) .cse7)) (not (= (+ |old(~a18~0)| 87) 0)) (and .cse0 .cse11 .cse2) (and .cse4 (and .cse5 .cse12 .cse6 .cse2)) (and .cse4 (or (and .cse13 .cse14 .cse15) (and (and .cse11 .cse2) .cse13 .cse14))) (= 12 |old(~a16~0)|) (and .cse4 (and (and .cse9 .cse16 .cse6 .cse10) .cse2)) (and .cse3 .cse4 .cse15) (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= .cse17 0) .cse18) (and .cse0 .cse19 .cse7) (and .cse4 (<= ~a12~0 6) (and .cse9 .cse5 .cse2)) (and .cse4 (and .cse2 .cse12) .cse18) (and .cse4 (and (and (<= ~a12~0 5) .cse10) .cse2)) (not (<= |old(~a12~0)| 5)) (and .cse0 (and .cse2 .cse7) .cse13 .cse20) (and .cse4 (and .cse19 .cse7) .cse18) (= 9 |old(~a16~0)|) (and .cse4 (and .cse1 .cse2)) (and (and .cse13 .cse14 .cse2 .cse7) .cse18) (= 4 |old(~a15~0)|) (= 10 |old(~a16~0)|)))))) [2019-10-02 01:36:36,875 INFO L443 ceAbstractionStarter]: For program point L1773-3(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:36:36,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:36:36 BoogieIcfgContainer [2019-10-02 01:36:36,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:36:36,925 INFO L168 Benchmark]: Toolchain (without parser) took 143186.82 ms. Allocated memory was 131.1 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 81.8 MB in the beginning and 1.0 GB in the end (delta: -947.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:36:36,926 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory is still 104.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 01:36:36,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1506.48 ms. Allocated memory was 131.1 MB in the beginning and 200.3 MB in the end (delta: 69.2 MB). Free memory was 81.8 MB in the beginning and 117.6 MB in the end (delta: -35.8 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. [2019-10-02 01:36:36,928 INFO L168 Benchmark]: Boogie Preprocessor took 197.16 ms. Allocated memory is still 200.3 MB. Free memory was 117.6 MB in the beginning and 107.5 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:36:36,931 INFO L168 Benchmark]: RCFGBuilder took 2394.07 ms. Allocated memory was 200.3 MB in the beginning and 275.3 MB in the end (delta: 75.0 MB). Free memory was 107.5 MB in the beginning and 145.0 MB in the end (delta: -37.5 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. [2019-10-02 01:36:36,932 INFO L168 Benchmark]: TraceAbstraction took 139083.88 ms. Allocated memory was 275.3 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 145.0 MB in the beginning and 1.0 GB in the end (delta: -884.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-02 01:36:36,944 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.23 ms. Allocated memory is still 131.1 MB. Free memory is still 104.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1506.48 ms. Allocated memory was 131.1 MB in the beginning and 200.3 MB in the end (delta: 69.2 MB). Free memory was 81.8 MB in the beginning and 117.6 MB in the end (delta: -35.8 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 197.16 ms. Allocated memory is still 200.3 MB. Free memory was 117.6 MB in the beginning and 107.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2394.07 ms. Allocated memory was 200.3 MB in the beginning and 275.3 MB in the end (delta: 75.0 MB). Free memory was 107.5 MB in the beginning and 145.0 MB in the end (delta: -37.5 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139083.88 ms. Allocated memory was 275.3 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 145.0 MB in the beginning and 1.0 GB in the end (delta: -884.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 205]: 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: (((((((((((((((((((((((a16 == 8 && (((!(3 == \old(a15)) || 0 <= \old(a18) + 78) || !(6 == \old(a12))) || !(11 == \old(a16))) && ((!(12 == a16) && a12 == 8) && ((!(3 == \old(a15)) || !(7 == \old(a12))) || !(11 == \old(a16)))) && !(4 == a15)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) || (((a15 == 4 && 3 == \old(a15)) && (!(12 == a16) && !(10 == a16)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 9)) || (3 == \old(a15) && ((((a18 + 87 <= 0 && !(a16 == 9)) && !(10 == a16)) && !(4 == a15)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 9)) || !(\old(a18) + 87 == 0)) || ((a16 == 8 && ((!(a16 == 9) && !(12 == a16)) && !(4 == a15)) && a12 <= 7) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (3 == \old(a15) && ((!(12 == a16) && a12 == 8) && !(10 == a16)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (3 == \old(a15) && (((a15 == 3 && ((a18 + 156 <= 0 && a12 == 7) || 0 < a18 + 79)) && ((!(12 == a16) && a12 <= 7) && !(10 == a16)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) || ((((((!(a16 == 9) && !(12 == a16)) && !(4 == a15)) && a12 <= 7) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a15 == 3) && ((a18 + 156 <= 0 && a12 == 7) || 0 < a18 + 79))))) || 12 == \old(a16)) || (3 == \old(a15) && (((!(a16 == 9) && a12 <= 7) && !(10 == a16)) && !(4 == a15)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((a15 == 4 && 3 == \old(a15)) && ((!(12 == a16) && a12 <= 7) && !(10 == a16)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (((a12 == \old(a12) && a16 == \old(a16)) && a18 + 87 == 0) && a15 == \old(a15))) || ((a16 == 8 && ((((!(3 == \old(a15)) || 0 <= \old(a18) + 78) || !(6 == \old(a12))) || !(11 == \old(a16))) && (a18 + 87 <= 0 && (!(a16 == 9) && !(12 == a16)) && !(4 == a15)) && ((!(3 == \old(a15)) || !(7 == \old(a12))) || !(11 == \old(a16)))) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 9)) || ((3 == \old(a15) && a12 <= 6) && (!(a16 == 9) && !(12 == a16)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((3 == \old(a15) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))) && a12 == 8) && a15 == \old(a15))) || (3 == \old(a15) && (a12 <= 5 && !(4 == a15)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || !(\old(a12) <= 5)) || (((a16 == 8 && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))) && a12 == 9) && a15 == 3) && 0 < a18 + 79)) || ((3 == \old(a15) && (((((!(3 == \old(a15)) || 0 <= \old(a18) + 78) || !(6 == \old(a12))) || !(11 == \old(a16))) && (a18 + 87 <= 0 && (!(a16 == 9) && !(12 == a16)) && !(4 == a15)) && ((!(3 == \old(a15)) || !(7 == \old(a12))) || !(11 == \old(a16)))) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 9) && a15 == \old(a15))) || 9 == \old(a16)) || (3 == \old(a15) && ((((!(3 == \old(a15)) || 0 <= \old(a18) + 78) || !(6 == \old(a12))) || !(11 == \old(a16))) && ((!(12 == a16) && a12 == 8) && ((!(3 == \old(a15)) || !(7 == \old(a12))) || !(11 == \old(a16)))) && !(4 == a15)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((((a15 == 3 && ((a18 + 156 <= 0 && a12 == 7) || 0 < a18 + 79)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 9) && a15 == \old(a15))) || 4 == \old(a15)) || 10 == \old(a16) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 409 locations, 1 error locations. SAFE Result, 138.9s OverallTime, 12 OverallIterations, 8 TraceHistogramMax, 88.5s AutomataDifference, 0.0s DeadEndRemovalTime, 22.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 31999 SDslu, 2327 SDs, 0 SdLazy, 64098 SolverSat, 12301 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 63.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9389 GetRequests, 9029 SyntacticMatches, 13 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5079 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16140occurred in iteration=11, 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: 2.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 6329 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 1040 PreInvPairs, 1271 NumberOfFragments, 2760 HoareAnnotationTreeSize, 1040 FomulaSimplifications, 3349108 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 707790 FormulaSimplificationTreeSizeReductionInter, 19.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 18031 NumberOfCodeBlocks, 18031 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 18010 ConstructedInterpolants, 0 QuantifiedInterpolants, 58301497 SizeOfPredicates, 5 NumberOfNonLiveVariables, 11620 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 35106/37882 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...