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/Problem10_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 17:58:55,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:58:55,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:58:55,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:58:55,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:58:55,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:58:55,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:58:55,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:58:55,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:58:55,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:58:55,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:58:55,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:58:55,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:58:55,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:58:55,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:58:55,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:58:55,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:58:55,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:58:55,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:58:55,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:58:55,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:58:55,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:58:55,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:58:55,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:58:55,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:58:55,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:58:55,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:58:55,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:58:55,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:58:55,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:58:55,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:58:55,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:58:55,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:58:55,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:58:55,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:58:55,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:58:55,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:58:55,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:58:55,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:58:55,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:58:55,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:58:55,135 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-13 17:58:55,160 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:58:55,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:58:55,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:58:55,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:58:55,163 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:58:55,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:58:55,165 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:58:55,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:58:55,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:58:55,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:58:55,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:58:55,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:58:55,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:58:55,166 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:58:55,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:58:55,166 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:58:55,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:58:55,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:58:55,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:58:55,167 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:58:55,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:58:55,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:58:55,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:58:55,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:58:55,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:58:55,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:58:55,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:58:55,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:58:55,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:58:55,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:58:55,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:58:55,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:58:55,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:58:55,509 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:58:55,510 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label49.c [2019-10-13 17:58:55,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200a2c3fb/7143c5a6043e41ea8b2c1fad9fa53432/FLAG18d270a90 [2019-10-13 17:58:56,159 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:58:56,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label49.c [2019-10-13 17:58:56,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200a2c3fb/7143c5a6043e41ea8b2c1fad9fa53432/FLAG18d270a90 [2019-10-13 17:58:56,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200a2c3fb/7143c5a6043e41ea8b2c1fad9fa53432 [2019-10-13 17:58:56,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:58:56,569 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:58:56,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:58:56,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:58:56,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:58:56,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:56" (1/1) ... [2019-10-13 17:58:56,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fffc6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:56, skipping insertion in model container [2019-10-13 17:58:56,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:56" (1/1) ... [2019-10-13 17:58:56,585 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:58:56,655 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:58:57,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:58:57,141 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:58:57,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:58:57,269 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:58:57,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57 WrapperNode [2019-10-13 17:58:57,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:58:57,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:58:57,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:58:57,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:58:57,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (1/1) ... [2019-10-13 17:58:57,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (1/1) ... [2019-10-13 17:58:57,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (1/1) ... [2019-10-13 17:58:57,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (1/1) ... [2019-10-13 17:58:57,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (1/1) ... [2019-10-13 17:58:57,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (1/1) ... [2019-10-13 17:58:57,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (1/1) ... [2019-10-13 17:58:57,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:58:57,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:58:57,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:58:57,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:58:57,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (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-13 17:58:57,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:58:57,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:58:57,460 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 17:58:57,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:58:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 17:58:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:58:57,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 17:58:57,461 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 17:58:57,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:58:57,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:58:57,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:58:58,758 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:58:58,759 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 17:58:58,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:58 BoogieIcfgContainer [2019-10-13 17:58:58,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:58:58,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:58:58,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:58:58,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:58:58,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:58:56" (1/3) ... [2019-10-13 17:58:58,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6822f4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:58, skipping insertion in model container [2019-10-13 17:58:58,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:57" (2/3) ... [2019-10-13 17:58:58,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6822f4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:58, skipping insertion in model container [2019-10-13 17:58:58,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:58" (3/3) ... [2019-10-13 17:58:58,783 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label49.c [2019-10-13 17:58:58,798 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:58:58,808 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:58:58,821 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:58:58,850 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:58:58,850 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:58:58,850 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:58:58,850 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:58:58,851 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:58:58,851 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:58:58,851 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:58:58,851 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:58:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-13 17:58:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 17:58:58,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:58:58,884 INFO L380 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] [2019-10-13 17:58:58,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:58:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:58:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1605828193, now seen corresponding path program 1 times [2019-10-13 17:58:58,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:58:58,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725614148] [2019-10-13 17:58:58,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:58:58,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:58:58,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:58:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:58:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:58:59,173 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-13 17:58:59,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725614148] [2019-10-13 17:58:59,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:58:59,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:58:59,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075961513] [2019-10-13 17:58:59,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:58:59,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:58:59,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:58:59,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:58:59,199 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2019-10-13 17:59:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:01,272 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2019-10-13 17:59:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:59:01,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-13 17:59:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:01,292 INFO L225 Difference]: With dead ends: 730 [2019-10-13 17:59:01,293 INFO L226 Difference]: Without dead ends: 447 [2019-10-13 17:59:01,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-13 17:59:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2019-10-13 17:59:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-13 17:59:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2019-10-13 17:59:01,393 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 28 [2019-10-13 17:59:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:01,394 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2019-10-13 17:59:01,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:59:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2019-10-13 17:59:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 17:59:01,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:01,406 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:01,406 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash -351220503, now seen corresponding path program 1 times [2019-10-13 17:59:01,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:01,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831481617] [2019-10-13 17:59:01,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:01,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:01,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:01,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831481617] [2019-10-13 17:59:01,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:59:01,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 17:59:01,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732584689] [2019-10-13 17:59:01,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:59:01,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:01,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:59:01,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:59:01,729 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 9 states. [2019-10-13 17:59:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:03,269 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2019-10-13 17:59:03,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 17:59:03,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-13 17:59:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:03,284 INFO L225 Difference]: With dead ends: 1041 [2019-10-13 17:59:03,284 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 17:59:03,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-13 17:59:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 17:59:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2019-10-13 17:59:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 17:59:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2019-10-13 17:59:03,341 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 101 [2019-10-13 17:59:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:03,342 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2019-10-13 17:59:03,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:59:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2019-10-13 17:59:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 17:59:03,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:03,348 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:03,348 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:03,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:03,348 INFO L82 PathProgramCache]: Analyzing trace with hash 788107453, now seen corresponding path program 1 times [2019-10-13 17:59:03,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:03,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068964617] [2019-10-13 17:59:03,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:03,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:03,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:03,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068964617] [2019-10-13 17:59:03,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979003735] [2019-10-13 17:59:03,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:03,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:03,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:03,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:03,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:59:03,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667539900] [2019-10-13 17:59:03,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:03,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:03,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:03,695 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand 3 states. [2019-10-13 17:59:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:04,325 INFO L93 Difference]: Finished difference Result 1615 states and 2274 transitions. [2019-10-13 17:59:04,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:04,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-13 17:59:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:04,333 INFO L225 Difference]: With dead ends: 1615 [2019-10-13 17:59:04,333 INFO L226 Difference]: Without dead ends: 1029 [2019-10-13 17:59:04,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-10-13 17:59:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 886. [2019-10-13 17:59:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-10-13 17:59:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1150 transitions. [2019-10-13 17:59:04,370 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1150 transitions. Word has length 107 [2019-10-13 17:59:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:04,371 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1150 transitions. [2019-10-13 17:59:04,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1150 transitions. [2019-10-13 17:59:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 17:59:04,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:04,381 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:04,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:04,594 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:04,594 INFO L82 PathProgramCache]: Analyzing trace with hash 58557854, now seen corresponding path program 1 times [2019-10-13 17:59:04,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:04,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880599279] [2019-10-13 17:59:04,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:04,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:04,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:04,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880599279] [2019-10-13 17:59:04,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:59:04,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 17:59:04,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111650316] [2019-10-13 17:59:04,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:59:04,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:04,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:59:04,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:59:04,939 INFO L87 Difference]: Start difference. First operand 886 states and 1150 transitions. Second operand 9 states. [2019-10-13 17:59:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:06,678 INFO L93 Difference]: Finished difference Result 2245 states and 2959 transitions. [2019-10-13 17:59:06,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 17:59:06,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-13 17:59:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:06,691 INFO L225 Difference]: With dead ends: 2245 [2019-10-13 17:59:06,692 INFO L226 Difference]: Without dead ends: 1365 [2019-10-13 17:59:06,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-10-13 17:59:06,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-10-13 17:59:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1057. [2019-10-13 17:59:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-10-13 17:59:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1317 transitions. [2019-10-13 17:59:06,777 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1317 transitions. Word has length 164 [2019-10-13 17:59:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:06,779 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 1317 transitions. [2019-10-13 17:59:06,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:59:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1317 transitions. [2019-10-13 17:59:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-13 17:59:06,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:06,784 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-13 17:59:06,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2134914115, now seen corresponding path program 1 times [2019-10-13 17:59:06,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:06,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832973821] [2019-10-13 17:59:06,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:06,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:06,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:59:07,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832973821] [2019-10-13 17:59:07,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025925131] [2019-10-13 17:59:07,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:07,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:07,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:07,298 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:07,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-13 17:59:07,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328678966] [2019-10-13 17:59:07,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 17:59:07,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 17:59:07,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:59:07,301 INFO L87 Difference]: Start difference. First operand 1057 states and 1317 transitions. Second operand 11 states. [2019-10-13 17:59:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:10,501 INFO L93 Difference]: Finished difference Result 2933 states and 4043 transitions. [2019-10-13 17:59:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 17:59:10,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-10-13 17:59:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:10,519 INFO L225 Difference]: With dead ends: 2933 [2019-10-13 17:59:10,519 INFO L226 Difference]: Without dead ends: 1882 [2019-10-13 17:59:10,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-10-13 17:59:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-10-13 17:59:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1548. [2019-10-13 17:59:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-13 17:59:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1966 transitions. [2019-10-13 17:59:10,601 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1966 transitions. Word has length 188 [2019-10-13 17:59:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:10,602 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 1966 transitions. [2019-10-13 17:59:10,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 17:59:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1966 transitions. [2019-10-13 17:59:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-13 17:59:10,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:10,607 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:10,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:10,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash -816532760, now seen corresponding path program 1 times [2019-10-13 17:59:10,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:10,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234159950] [2019-10-13 17:59:10,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:10,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:10,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-13 17:59:11,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234159950] [2019-10-13 17:59:11,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579961343] [2019-10-13 17:59:11,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:11,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:11,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 17:59:11,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:11,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:59:11,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437541584] [2019-10-13 17:59:11,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:11,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:11,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:11,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:11,208 INFO L87 Difference]: Start difference. First operand 1548 states and 1966 transitions. Second operand 3 states. [2019-10-13 17:59:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:11,804 INFO L93 Difference]: Finished difference Result 4274 states and 5547 transitions. [2019-10-13 17:59:11,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:11,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-13 17:59:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:11,820 INFO L225 Difference]: With dead ends: 4274 [2019-10-13 17:59:11,820 INFO L226 Difference]: Without dead ends: 2732 [2019-10-13 17:59:11,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2019-10-13 17:59:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2585. [2019-10-13 17:59:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2019-10-13 17:59:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3228 transitions. [2019-10-13 17:59:11,908 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3228 transitions. Word has length 205 [2019-10-13 17:59:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:11,908 INFO L462 AbstractCegarLoop]: Abstraction has 2585 states and 3228 transitions. [2019-10-13 17:59:11,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3228 transitions. [2019-10-13 17:59:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-13 17:59:11,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:11,916 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 17:59:12,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:12,119 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1150859075, now seen corresponding path program 1 times [2019-10-13 17:59:12,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:12,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984054480] [2019-10-13 17:59:12,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:12,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:12,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 115 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:59:12,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984054480] [2019-10-13 17:59:12,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358324078] [2019-10-13 17:59:12,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:12,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:12,930 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:12,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2019-10-13 17:59:12,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962209172] [2019-10-13 17:59:12,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 17:59:12,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:12,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 17:59:12,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:59:12,934 INFO L87 Difference]: Start difference. First operand 2585 states and 3228 transitions. Second operand 13 states. [2019-10-13 17:59:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:16,520 INFO L93 Difference]: Finished difference Result 7087 states and 8798 transitions. [2019-10-13 17:59:16,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 17:59:16,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 248 [2019-10-13 17:59:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:16,535 INFO L225 Difference]: With dead ends: 7087 [2019-10-13 17:59:16,536 INFO L226 Difference]: Without dead ends: 2867 [2019-10-13 17:59:16,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2019-10-13 17:59:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2019-10-13 17:59:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2275. [2019-10-13 17:59:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2019-10-13 17:59:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2611 transitions. [2019-10-13 17:59:16,617 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 2611 transitions. Word has length 248 [2019-10-13 17:59:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:16,617 INFO L462 AbstractCegarLoop]: Abstraction has 2275 states and 2611 transitions. [2019-10-13 17:59:16,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 17:59:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2611 transitions. [2019-10-13 17:59:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-13 17:59:16,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:16,627 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 17:59:16,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:16,831 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash -672830645, now seen corresponding path program 1 times [2019-10-13 17:59:16,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:16,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877489899] [2019-10-13 17:59:16,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:16,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:16,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 17:59:17,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877489899] [2019-10-13 17:59:17,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86986980] [2019-10-13 17:59:17,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:17,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:17,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 17:59:17,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:17,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:59:17,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384311919] [2019-10-13 17:59:17,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:17,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:17,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:17,527 INFO L87 Difference]: Start difference. First operand 2275 states and 2611 transitions. Second operand 3 states. [2019-10-13 17:59:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:18,110 INFO L93 Difference]: Finished difference Result 4838 states and 5609 transitions. [2019-10-13 17:59:18,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:18,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-13 17:59:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:18,121 INFO L225 Difference]: With dead ends: 4838 [2019-10-13 17:59:18,122 INFO L226 Difference]: Without dead ends: 2565 [2019-10-13 17:59:18,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-10-13 17:59:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2565. [2019-10-13 17:59:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2019-10-13 17:59:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 2941 transitions. [2019-10-13 17:59:18,203 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 2941 transitions. Word has length 284 [2019-10-13 17:59:18,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:18,204 INFO L462 AbstractCegarLoop]: Abstraction has 2565 states and 2941 transitions. [2019-10-13 17:59:18,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 2941 transitions. [2019-10-13 17:59:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-13 17:59:18,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:18,217 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 17:59:18,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:18,429 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1534802932, now seen corresponding path program 1 times [2019-10-13 17:59:18,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:18,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907669221] [2019-10-13 17:59:18,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:18,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:18,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-13 17:59:18,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907669221] [2019-10-13 17:59:18,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363063754] [2019-10-13 17:59:18,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 17:59:18,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:18,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:59:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-13 17:59:18,975 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:18,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-13 17:59:18,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127253795] [2019-10-13 17:59:18,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:59:18,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:18,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:59:18,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:59:18,977 INFO L87 Difference]: Start difference. First operand 2565 states and 2941 transitions. Second operand 9 states. [2019-10-13 17:59:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:21,446 INFO L93 Difference]: Finished difference Result 5790 states and 6917 transitions. [2019-10-13 17:59:21,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 17:59:21,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 288 [2019-10-13 17:59:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:21,452 INFO L225 Difference]: With dead ends: 5790 [2019-10-13 17:59:21,453 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 17:59:21,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-10-13 17:59:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 17:59:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 17:59:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 17:59:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 17:59:21,470 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 288 [2019-10-13 17:59:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:21,471 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 17:59:21,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:59:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 17:59:21,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 17:59:21,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:21,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 17:59:22,444 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 153 [2019-10-13 17:59:22,664 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 153 [2019-10-13 17:59:23,447 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 44 [2019-10-13 17:59:23,897 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 38 [2019-10-13 17:59:24,344 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 38 [2019-10-13 17:59:24,347 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 17:59:24,347 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a10~0 |old(~a10~0)|) (= ~inputE~0 |old(~inputE~0)|) (= ~inputB~0 |old(~inputB~0)|) (= ~inputF~0 |old(~inputF~0)|) (= ~inputC~0 |old(~inputC~0)|) (= ~a19~0 |old(~a19~0)|) (= ~inputD~0 |old(~inputD~0)|) (= ~a4~0 |old(~a4~0)|) (= ~a1~0 |old(~a1~0)|)) [2019-10-13 17:59:24,348 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 17:59:24,348 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-10-13 17:59:24,348 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,348 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,349 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,349 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,349 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,349 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,349 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-10-13 17:59:24,349 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-10-13 17:59:24,349 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-13 17:59:24,349 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-13 17:59:24,350 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-13 17:59:24,350 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-13 17:59:24,350 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-13 17:59:24,350 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-13 17:59:24,350 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-10-13 17:59:24,350 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-10-13 17:59:24,350 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-10-13 17:59:24,350 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-10-13 17:59:24,351 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-13 17:59:24,352 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-13 17:59:24,352 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-13 17:59:24,352 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-13 17:59:24,352 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-13 17:59:24,352 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-10-13 17:59:24,352 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-10-13 17:59:24,352 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-10-13 17:59:24,352 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-10-13 17:59:24,353 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-10-13 17:59:24,353 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,353 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,353 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,353 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,353 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,353 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-10-13 17:59:24,353 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-10-13 17:59:24,354 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,355 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,355 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,355 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,355 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,355 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-10-13 17:59:24,355 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-10-13 17:59:24,355 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-10-13 17:59:24,355 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-10-13 17:59:24,356 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-10-13 17:59:24,357 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,357 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,357 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,357 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,357 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,357 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-13 17:59:24,357 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-13 17:59:24,357 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,358 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-13 17:59:24,359 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,360 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-10-13 17:59:24,361 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-10-13 17:59:24,362 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-10-13 17:59:24,363 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-13 17:59:24,364 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-13 17:59:24,364 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-13 17:59:24,364 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-13 17:59:24,364 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-13 17:59:24,364 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-13 17:59:24,364 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2019-10-13 17:59:24,364 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-10-13 17:59:24,364 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-10-13 17:59:24,365 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse2 (not (<= |old(~a19~0)| 8)))) (let ((.cse0 (or .cse2 (= 1 |old(~a10~0)|))) (.cse1 (and (= ~a1~0 |old(~a1~0)|) (= ~a10~0 |old(~a10~0)|) (= ~a19~0 |old(~a19~0)|)))) (and (or .cse0 .cse1 (not (<= |old(~a1~0)| 36))) (or .cse0 .cse1 (not (<= 4 |old(~a10~0)|))) (or (= 8 |old(~a19~0)|) .cse2 .cse1) (or .cse1 (not (= 9 |old(~a19~0)|))) (or .cse2 .cse1 (not (< 218 |old(~a1~0)|))) (or (not (<= |old(~a10~0)| 0)) .cse1) (or (not (<= |old(~a10~0)| 1)) (not (<= 9 |old(~a19~0)|)) .cse1)))) [2019-10-13 17:59:24,365 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-10-13 17:59:24,365 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-10-13 17:59:24,365 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-10-13 17:59:24,365 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,365 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,365 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,365 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-13 17:59:24,366 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,367 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,368 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,368 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,368 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-10-13 17:59:24,368 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-10-13 17:59:24,368 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-10-13 17:59:24,368 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-13 17:59:24,368 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-13 17:59:24,368 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-13 17:59:24,369 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-13 17:59:24,369 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-13 17:59:24,369 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-13 17:59:24,369 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-10-13 17:59:24,369 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-10-13 17:59:24,369 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-10-13 17:59:24,369 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,369 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-13 17:59:24,370 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-13 17:59:24,371 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-13 17:59:24,371 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-13 17:59:24,371 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-13 17:59:24,371 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-13 17:59:24,371 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-10-13 17:59:24,371 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-10-13 17:59:24,371 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-10-13 17:59:24,371 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 17:59:24,372 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a19~0 9) (<= ~a1~0 36) (<= ~a10~0 0) (<= 9 ~a19~0)) [2019-10-13 17:59:24,372 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 17:59:24,372 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 17:59:24,372 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (= ~a1~0 |old(~a1~0)|) (= ~a10~0 |old(~a10~0)|) (= ~a19~0 |old(~a19~0)|)) (not (<= |old(~a19~0)| 9)) (not (<= |old(~a10~0)| 0)) (not (<= |old(~a1~0)| 36)) (not (<= 9 |old(~a19~0)|))) [2019-10-13 17:59:24,372 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2019-10-13 17:59:24,372 INFO L439 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 8))) (.cse1 (<= ~a19~0 8))) (or (and .cse0 (<= ~a10~0 1)) (not (<= |old(~a1~0)| 36)) (and (<= ~a19~0 9) .cse0) (and (<= ~a1~0 36) (not (= 1 ~a10~0)) .cse1) (and .cse1 (<= 4 ~a10~0)) (not (<= |old(~a19~0)| 9)) (not (<= |old(~a10~0)| 0)) (and (< 218 ~a1~0) .cse1) (<= ~a10~0 0) (not (<= 9 |old(~a19~0)|)))) [2019-10-13 17:59:24,373 INFO L443 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2019-10-13 17:59:24,373 INFO L443 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-10-13 17:59:24,373 INFO L439 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 8))) (.cse1 (<= ~a19~0 8))) (or (and .cse0 (<= ~a10~0 1)) (not (<= |old(~a1~0)| 36)) (and (<= ~a19~0 9) .cse0) (and (<= ~a1~0 36) (not (= 1 ~a10~0)) .cse1) (and .cse1 (<= 4 ~a10~0)) (not (<= |old(~a19~0)| 9)) (not (<= |old(~a10~0)| 0)) (and (< 218 ~a1~0) .cse1) (<= ~a10~0 0) (not (<= 9 |old(~a19~0)|)))) [2019-10-13 17:59:24,373 INFO L443 ceAbstractionStarter]: For program point L582-3(lines 576 592) no Hoare annotation was computed. [2019-10-13 17:59:24,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:59:24 BoogieIcfgContainer [2019-10-13 17:59:24,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 17:59:24,393 INFO L168 Benchmark]: Toolchain (without parser) took 27823.15 ms. Allocated memory was 145.8 MB in the beginning and 638.6 MB in the end (delta: 492.8 MB). Free memory was 101.9 MB in the beginning and 403.9 MB in the end (delta: -302.0 MB). Peak memory consumption was 453.2 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:24,393 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 17:59:24,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.29 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 162.7 MB in the end (delta: -61.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:24,395 INFO L168 Benchmark]: Boogie Preprocessor took 131.11 ms. Allocated memory is still 202.9 MB. Free memory was 162.7 MB in the beginning and 158.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:24,396 INFO L168 Benchmark]: RCFGBuilder took 1361.47 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 157.3 MB in the beginning and 172.5 MB in the end (delta: -15.1 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:24,397 INFO L168 Benchmark]: TraceAbstraction took 25625.68 ms. Allocated memory was 236.5 MB in the beginning and 638.6 MB in the end (delta: 402.1 MB). Free memory was 172.5 MB in the beginning and 403.9 MB in the end (delta: -231.4 MB). Peak memory consumption was 433.1 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:24,400 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.44 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 700.29 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 162.7 MB in the end (delta: -61.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.11 ms. Allocated memory is still 202.9 MB. Free memory was 162.7 MB in the beginning and 158.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1361.47 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 157.3 MB in the beginning and 172.5 MB in the end (delta: -15.1 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25625.68 ms. Allocated memory was 236.5 MB in the beginning and 638.6 MB in the end (delta: 402.1 MB). Free memory was 172.5 MB in the beginning and 403.9 MB in the end (delta: -231.4 MB). Peak memory consumption was 433.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: 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: 582]: Loop Invariant Derived loop invariant: (((((((((!(a19 == 8) && a10 <= 1) || !(\old(a1) <= 36)) || (a19 <= 9 && !(a19 == 8))) || ((a1 <= 36 && !(1 == a10)) && a19 <= 8)) || (a19 <= 8 && 4 <= a10)) || !(\old(a19) <= 9)) || !(\old(a10) <= 0)) || (218 < a1 && a19 <= 8)) || a10 <= 0) || !(9 <= \old(a19)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Result: SAFE, OverallTime: 25.5s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 712 SDtfs, 6416 SDslu, 406 SDs, 0 SdLazy, 10844 SolverSat, 2077 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1491 GetRequests, 1377 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2585occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1544 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 210 PreInvPairs, 364 NumberOfFragments, 327 HoareAnnotationTreeSize, 210 FomulaSimplifications, 73618 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8508 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2933 NumberOfCodeBlocks, 2933 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2918 ConstructedInterpolants, 0 QuantifiedInterpolants, 1496826 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2364 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 1661/1682 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...