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/Problem15_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:46:30,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:46:30,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:46:30,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:46:30,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:46:30,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:46:30,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:46:30,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:46:30,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:46:30,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:46:30,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:46:30,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:46:30,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:46:30,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:46:30,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:46:30,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:46:30,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:46:30,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:46:30,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:46:30,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:46:30,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:46:30,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:46:30,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:46:30,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:46:30,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:46:30,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:46:30,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:46:30,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:46:30,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:46:30,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:46:30,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:46:30,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:46:30,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:46:30,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:46:30,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:46:30,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:46:30,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:46:30,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:46:30,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:46:30,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:46:30,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:46:30,076 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-09-07 20:46:30,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:46:30,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:46:30,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:46:30,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:46:30,092 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:46:30,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:46:30,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:46:30,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:46:30,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:46:30,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:46:30,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:46:30,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:46:30,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:46:30,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:46:30,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:46:30,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:46:30,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:46:30,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:46:30,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:46:30,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:46:30,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:46:30,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:46:30,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:46:30,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:46:30,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:46:30,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:46:30,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:46:30,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:46:30,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:46:30,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:46:30,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:46:30,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:46:30,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:46:30,150 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:46:30,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label49.c [2019-09-07 20:46:30,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9be5651/cc17e579daf04bb2b0ebe1256f9d7842/FLAGe33565ac1 [2019-09-07 20:46:30,851 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:46:30,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label49.c [2019-09-07 20:46:30,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9be5651/cc17e579daf04bb2b0ebe1256f9d7842/FLAGe33565ac1 [2019-09-07 20:46:31,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9be5651/cc17e579daf04bb2b0ebe1256f9d7842 [2019-09-07 20:46:31,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:46:31,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:46:31,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:46:31,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:46:31,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:46:31,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:46:31" (1/1) ... [2019-09-07 20:46:31,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:31, skipping insertion in model container [2019-09-07 20:46:31,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:46:31" (1/1) ... [2019-09-07 20:46:31,070 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:46:31,154 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:46:32,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:46:32,094 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:46:32,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:46:32,407 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:46:32,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32 WrapperNode [2019-09-07 20:46:32,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:46:32,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:46:32,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:46:32,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:46:32,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (1/1) ... [2019-09-07 20:46:32,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (1/1) ... [2019-09-07 20:46:32,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (1/1) ... [2019-09-07 20:46:32,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (1/1) ... [2019-09-07 20:46:32,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (1/1) ... [2019-09-07 20:46:32,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (1/1) ... [2019-09-07 20:46:32,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (1/1) ... [2019-09-07 20:46:32,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:46:32,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:46:32,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:46:32,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:46:32,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (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-09-07 20:46:32,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:46:32,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:46:32,718 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:46:32,718 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:46:32,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:46:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:46:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:46:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:46:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:46:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:46:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:46:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:46:32,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:46:36,563 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:46:36,564 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:46:36,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:46:36 BoogieIcfgContainer [2019-09-07 20:46:36,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:46:36,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:46:36,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:46:36,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:46:36,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:46:31" (1/3) ... [2019-09-07 20:46:36,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848f72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:46:36, skipping insertion in model container [2019-09-07 20:46:36,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:46:32" (2/3) ... [2019-09-07 20:46:36,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848f72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:46:36, skipping insertion in model container [2019-09-07 20:46:36,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:46:36" (3/3) ... [2019-09-07 20:46:36,574 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label49.c [2019-09-07 20:46:36,584 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:46:36,592 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:46:36,610 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:46:36,646 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:46:36,646 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:46:36,647 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:46:36,647 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:46:36,647 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:46:36,647 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:46:36,647 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:46:36,647 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:46:36,647 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:46:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:46:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 20:46:36,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:36,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:46:36,689 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1661413296, now seen corresponding path program 1 times [2019-09-07 20:46:36,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:36,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:36,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:46:37,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:37,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:46:37,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:46:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:46:37,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:46:37,099 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:46:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:42,247 INFO L93 Difference]: Finished difference Result 1546 states and 2831 transitions. [2019-09-07 20:46:42,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:46:42,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-07 20:46:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:42,291 INFO L225 Difference]: With dead ends: 1546 [2019-09-07 20:46:42,292 INFO L226 Difference]: Without dead ends: 1028 [2019-09-07 20:46:42,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:46:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-09-07 20:46:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 700. [2019-09-07 20:46:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-07 20:46:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1110 transitions. [2019-09-07 20:46:42,423 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1110 transitions. Word has length 58 [2019-09-07 20:46:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:42,428 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 1110 transitions. [2019-09-07 20:46:42,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:46:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1110 transitions. [2019-09-07 20:46:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 20:46:42,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:42,440 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-09-07 20:46:42,440 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1221807989, now seen corresponding path program 1 times [2019-09-07 20:46:42,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:42,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:42,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:46:42,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:42,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:46:42,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:46:42,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:46:42,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:46:42,702 INFO L87 Difference]: Start difference. First operand 700 states and 1110 transitions. Second operand 5 states. [2019-09-07 20:46:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:46,670 INFO L93 Difference]: Finished difference Result 2057 states and 3297 transitions. [2019-09-07 20:46:46,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:46:46,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-07 20:46:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:46,682 INFO L225 Difference]: With dead ends: 2057 [2019-09-07 20:46:46,683 INFO L226 Difference]: Without dead ends: 1363 [2019-09-07 20:46:46,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:46:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-09-07 20:46:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1333. [2019-09-07 20:46:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-07 20:46:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1846 transitions. [2019-09-07 20:46:46,761 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1846 transitions. Word has length 130 [2019-09-07 20:46:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:46,762 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 1846 transitions. [2019-09-07 20:46:46,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:46:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1846 transitions. [2019-09-07 20:46:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-07 20:46:46,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:46,768 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:46:46,769 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:46,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash -78025861, now seen corresponding path program 1 times [2019-09-07 20:46:46,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:46,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:46,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:46,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:46,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:46:46,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:46,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:46:46,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:46:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:46:46,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:46:46,895 INFO L87 Difference]: Start difference. First operand 1333 states and 1846 transitions. Second operand 4 states. [2019-09-07 20:46:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:52,087 INFO L93 Difference]: Finished difference Result 5149 states and 7300 transitions. [2019-09-07 20:46:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:46:52,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-07 20:46:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:52,120 INFO L225 Difference]: With dead ends: 5149 [2019-09-07 20:46:52,120 INFO L226 Difference]: Without dead ends: 3822 [2019-09-07 20:46:52,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:46:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2019-09-07 20:46:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3819. [2019-09-07 20:46:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3819 states. [2019-09-07 20:46:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4957 transitions. [2019-09-07 20:46:52,239 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4957 transitions. Word has length 138 [2019-09-07 20:46:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:52,240 INFO L475 AbstractCegarLoop]: Abstraction has 3819 states and 4957 transitions. [2019-09-07 20:46:52,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:46:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4957 transitions. [2019-09-07 20:46:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 20:46:52,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:52,243 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:46:52,244 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash 90955185, now seen corresponding path program 1 times [2019-09-07 20:46:52,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:52,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:52,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:52,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:46:52,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:52,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:46:52,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:46:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:46:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:46:52,394 INFO L87 Difference]: Start difference. First operand 3819 states and 4957 transitions. Second operand 6 states. [2019-09-07 20:46:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:55,132 INFO L93 Difference]: Finished difference Result 7712 states and 10087 transitions. [2019-09-07 20:46:55,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:46:55,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-07 20:46:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:55,153 INFO L225 Difference]: With dead ends: 7712 [2019-09-07 20:46:55,153 INFO L226 Difference]: Without dead ends: 3899 [2019-09-07 20:46:55,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:46:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2019-09-07 20:46:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3889. [2019-09-07 20:46:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3889 states. [2019-09-07 20:46:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 4912 transitions. [2019-09-07 20:46:55,267 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 4912 transitions. Word has length 144 [2019-09-07 20:46:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:55,268 INFO L475 AbstractCegarLoop]: Abstraction has 3889 states and 4912 transitions. [2019-09-07 20:46:55,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:46:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 4912 transitions. [2019-09-07 20:46:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-07 20:46:55,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:55,272 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:46:55,272 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2025648949, now seen corresponding path program 1 times [2019-09-07 20:46:55,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:55,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:55,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:55,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:55,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:46:55,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:55,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:46:55,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:46:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:46:55,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:46:55,501 INFO L87 Difference]: Start difference. First operand 3889 states and 4912 transitions. Second operand 4 states. [2019-09-07 20:46:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:59,942 INFO L93 Difference]: Finished difference Result 11575 states and 15447 transitions. [2019-09-07 20:46:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:46:59,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-07 20:46:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:59,984 INFO L225 Difference]: With dead ends: 11575 [2019-09-07 20:46:59,984 INFO L226 Difference]: Without dead ends: 7692 [2019-09-07 20:46:59,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:47:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7692 states. [2019-09-07 20:47:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7692 to 7678. [2019-09-07 20:47:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7678 states. [2019-09-07 20:47:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7678 states to 7678 states and 10066 transitions. [2019-09-07 20:47:00,196 INFO L78 Accepts]: Start accepts. Automaton has 7678 states and 10066 transitions. Word has length 169 [2019-09-07 20:47:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:00,197 INFO L475 AbstractCegarLoop]: Abstraction has 7678 states and 10066 transitions. [2019-09-07 20:47:00,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:47:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 7678 states and 10066 transitions. [2019-09-07 20:47:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-07 20:47:00,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:47:00,203 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:47:00,203 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:47:00,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:47:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash 484630862, now seen corresponding path program 1 times [2019-09-07 20:47:00,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:47:00,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:47:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:00,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 20:47:00,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:47:00,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:47:00,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:47:00,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:47:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:47:00,422 INFO L87 Difference]: Start difference. First operand 7678 states and 10066 transitions. Second operand 4 states. [2019-09-07 20:47:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:47:04,358 INFO L93 Difference]: Finished difference Result 25251 states and 33836 transitions. [2019-09-07 20:47:04,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:47:04,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-09-07 20:47:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:47:04,416 INFO L225 Difference]: With dead ends: 25251 [2019-09-07 20:47:04,417 INFO L226 Difference]: Without dead ends: 14755 [2019-09-07 20:47:04,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:47:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14755 states. [2019-09-07 20:47:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14755 to 14444. [2019-09-07 20:47:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14444 states. [2019-09-07 20:47:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 17173 transitions. [2019-09-07 20:47:04,847 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 17173 transitions. Word has length 214 [2019-09-07 20:47:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:04,848 INFO L475 AbstractCegarLoop]: Abstraction has 14444 states and 17173 transitions. [2019-09-07 20:47:04,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:47:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 17173 transitions. [2019-09-07 20:47:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-07 20:47:04,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:47:04,854 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-09-07 20:47:04,854 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:47:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:47:04,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2087011701, now seen corresponding path program 1 times [2019-09-07 20:47:04,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:47:04,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:47:04,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:04,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:04,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:47:05,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:47:05,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:47:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:47:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:05,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:47:05,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:47:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:47:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-07 20:47:05,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:47:05,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:47:05,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:47:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:47:05,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:47:05,649 INFO L87 Difference]: Start difference. First operand 14444 states and 17173 transitions. Second operand 9 states. [2019-09-07 20:47:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:47:13,068 INFO L93 Difference]: Finished difference Result 34292 states and 41123 transitions. [2019-09-07 20:47:13,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 20:47:13,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 244 [2019-09-07 20:47:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:47:13,161 INFO L225 Difference]: With dead ends: 34292 [2019-09-07 20:47:13,162 INFO L226 Difference]: Without dead ends: 19854 [2019-09-07 20:47:13,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:47:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19854 states. [2019-09-07 20:47:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19854 to 17372. [2019-09-07 20:47:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17372 states. [2019-09-07 20:47:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17372 states to 17372 states and 20583 transitions. [2019-09-07 20:47:13,686 INFO L78 Accepts]: Start accepts. Automaton has 17372 states and 20583 transitions. Word has length 244 [2019-09-07 20:47:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:13,686 INFO L475 AbstractCegarLoop]: Abstraction has 17372 states and 20583 transitions. [2019-09-07 20:47:13,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:47:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 17372 states and 20583 transitions. [2019-09-07 20:47:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-07 20:47:13,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:47:13,700 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:47:13,700 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:47:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:47:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1015133823, now seen corresponding path program 1 times [2019-09-07 20:47:13,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:47:13,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:47:13,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:13,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-09-07 20:47:14,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:47:14,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:47:14,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:47:14,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:47:14,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:47:14,242 INFO L87 Difference]: Start difference. First operand 17372 states and 20583 transitions. Second operand 3 states. [2019-09-07 20:47:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:47:16,406 INFO L93 Difference]: Finished difference Result 36588 states and 43550 transitions. [2019-09-07 20:47:16,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:47:16,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-09-07 20:47:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:47:16,484 INFO L225 Difference]: With dead ends: 36588 [2019-09-07 20:47:16,484 INFO L226 Difference]: Without dead ends: 19529 [2019-09-07 20:47:16,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:47:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19529 states. [2019-09-07 20:47:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19529 to 18604. [2019-09-07 20:47:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18604 states. [2019-09-07 20:47:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18604 states to 18604 states and 21841 transitions. [2019-09-07 20:47:16,940 INFO L78 Accepts]: Start accepts. Automaton has 18604 states and 21841 transitions. Word has length 495 [2019-09-07 20:47:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:16,941 INFO L475 AbstractCegarLoop]: Abstraction has 18604 states and 21841 transitions. [2019-09-07 20:47:16,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:47:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 18604 states and 21841 transitions. [2019-09-07 20:47:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-09-07 20:47:16,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:47:16,959 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:47:16,960 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:47:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:47:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2130398059, now seen corresponding path program 1 times [2019-09-07 20:47:16,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:47:16,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:47:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:16,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 266 proven. 254 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:47:18,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:47:18,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:47:18,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:47:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:18,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:47:18,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:47:18,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:47:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 470 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-07 20:47:18,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:47:18,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 20:47:18,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:47:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:47:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:47:18,792 INFO L87 Difference]: Start difference. First operand 18604 states and 21841 transitions. Second operand 14 states. [2019-09-07 20:47:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:47:27,952 INFO L93 Difference]: Finished difference Result 50119 states and 59712 transitions. [2019-09-07 20:47:27,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 20:47:27,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 555 [2019-09-07 20:47:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:47:28,041 INFO L225 Difference]: With dead ends: 50119 [2019-09-07 20:47:28,041 INFO L226 Difference]: Without dead ends: 31507 [2019-09-07 20:47:28,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=480, Invalid=2070, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 20:47:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31507 states. [2019-09-07 20:47:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31507 to 30176. [2019-09-07 20:47:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30176 states. [2019-09-07 20:47:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30176 states to 30176 states and 34795 transitions. [2019-09-07 20:47:28,479 INFO L78 Accepts]: Start accepts. Automaton has 30176 states and 34795 transitions. Word has length 555 [2019-09-07 20:47:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:28,480 INFO L475 AbstractCegarLoop]: Abstraction has 30176 states and 34795 transitions. [2019-09-07 20:47:28,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:47:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 30176 states and 34795 transitions. [2019-09-07 20:47:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2019-09-07 20:47:28,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:47:28,500 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:47:28,500 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:47:28,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:47:28,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1741360657, now seen corresponding path program 1 times [2019-09-07 20:47:28,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:47:28,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:47:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:28,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:28,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 240 proven. 85 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 20:47:29,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:47:29,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:47:29,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:29,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:47:29,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:47:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 418 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:47:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:47:29,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:47:29,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:47:29,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:47:29,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:47:29,654 INFO L87 Difference]: Start difference. First operand 30176 states and 34795 transitions. Second operand 9 states. [2019-09-07 20:47:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:47:34,710 INFO L93 Difference]: Finished difference Result 69079 states and 85049 transitions. [2019-09-07 20:47:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:47:34,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 578 [2019-09-07 20:47:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:47:34,866 INFO L225 Difference]: With dead ends: 69079 [2019-09-07 20:47:34,866 INFO L226 Difference]: Without dead ends: 38909 [2019-09-07 20:47:34,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:47:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38909 states. [2019-09-07 20:47:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38909 to 38516. [2019-09-07 20:47:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38516 states. [2019-09-07 20:47:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38516 states to 38516 states and 47643 transitions. [2019-09-07 20:47:35,733 INFO L78 Accepts]: Start accepts. Automaton has 38516 states and 47643 transitions. Word has length 578 [2019-09-07 20:47:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:35,734 INFO L475 AbstractCegarLoop]: Abstraction has 38516 states and 47643 transitions. [2019-09-07 20:47:35,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:47:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 38516 states and 47643 transitions. [2019-09-07 20:47:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2019-09-07 20:47:35,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:47:35,756 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:47:35,756 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:47:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:47:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash 883172745, now seen corresponding path program 1 times [2019-09-07 20:47:35,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:47:35,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:47:35,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:35,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:35,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-09-07 20:47:36,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:47:36,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:47:36,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:47:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:36,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:47:36,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:47:36,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:36,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:36,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:36,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:37,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:37,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:37,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-07 20:47:37,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:47:37,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-07 20:47:37,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:47:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:47:37,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:47:37,755 INFO L87 Difference]: Start difference. First operand 38516 states and 47643 transitions. Second operand 12 states. [2019-09-07 20:49:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:49:13,074 INFO L93 Difference]: Finished difference Result 98102 states and 121188 transitions. [2019-09-07 20:49:13,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 20:49:13,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 592 [2019-09-07 20:49:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:49:13,303 INFO L225 Difference]: With dead ends: 98102 [2019-09-07 20:49:13,303 INFO L226 Difference]: Without dead ends: 59592 [2019-09-07 20:49:13,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2019-09-07 20:49:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59592 states. [2019-09-07 20:49:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59592 to 53243. [2019-09-07 20:49:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53243 states. [2019-09-07 20:49:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53243 states to 53243 states and 64144 transitions. [2019-09-07 20:49:16,153 INFO L78 Accepts]: Start accepts. Automaton has 53243 states and 64144 transitions. Word has length 592 [2019-09-07 20:49:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:49:16,155 INFO L475 AbstractCegarLoop]: Abstraction has 53243 states and 64144 transitions. [2019-09-07 20:49:16,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:49:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 53243 states and 64144 transitions. [2019-09-07 20:49:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2019-09-07 20:49:16,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:49:16,182 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:49:16,183 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:49:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:49:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1680750711, now seen corresponding path program 1 times [2019-09-07 20:49:16,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:49:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:49:16,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:49:16,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:49:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:49:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:49:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 218 proven. 2 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2019-09-07 20:49:16,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:49:16,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:49:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:49:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:49:16,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:49:16,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:49:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-07 20:49:17,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:49:17,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:49:17,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:49:17,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:49:17,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:49:17,304 INFO L87 Difference]: Start difference. First operand 53243 states and 64144 transitions. Second operand 3 states. [2019-09-07 20:49:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:49:19,241 INFO L93 Difference]: Finished difference Result 99216 states and 119044 transitions. [2019-09-07 20:49:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:49:19,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 706 [2019-09-07 20:49:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:49:19,390 INFO L225 Difference]: With dead ends: 99216 [2019-09-07 20:49:19,391 INFO L226 Difference]: Without dead ends: 47223 [2019-09-07 20:49:19,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:49:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47223 states. [2019-09-07 20:49:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47223 to 46586. [2019-09-07 20:49:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46586 states. [2019-09-07 20:49:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46586 states to 46586 states and 55385 transitions. [2019-09-07 20:49:20,693 INFO L78 Accepts]: Start accepts. Automaton has 46586 states and 55385 transitions. Word has length 706 [2019-09-07 20:49:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:49:20,694 INFO L475 AbstractCegarLoop]: Abstraction has 46586 states and 55385 transitions. [2019-09-07 20:49:20,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:49:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 46586 states and 55385 transitions. [2019-09-07 20:49:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-09-07 20:49:20,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:49:20,736 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:49:20,737 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:49:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:49:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1840128562, now seen corresponding path program 1 times [2019-09-07 20:49:20,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:49:20,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:49:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:49:20,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:49:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:49:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:49:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 478 proven. 50 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2019-09-07 20:49:21,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:49:21,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:49:21,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:49:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:49:21,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:49:22,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:49:22,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:49:22,591 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_904 Int)) (let ((.cse0 (mod v_~a29~0_904 299978))) (and (< v_~a29~0_904 0) (<= c_~a29~0 (+ .cse0 43)) (not (= 0 .cse0))))) (exists ((v_prenex_2 Int)) (and (<= c_~a29~0 (+ (mod v_prenex_2 299978) 300021)) (<= 0 v_prenex_2))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299978))) (and (<= c_~a29~0 (+ .cse1 300021)) (= 0 .cse1))))) is different from true [2019-09-07 20:49:23,031 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_904 Int)) (let ((.cse0 (mod v_~a29~0_904 299978))) (and (< v_~a29~0_904 0) (<= c_~a29~0 (+ .cse0 43)) (not (= 0 .cse0))))) (exists ((v_prenex_3 Int)) (let ((.cse1 (mod v_prenex_3 299978))) (and (<= c_~a29~0 (+ .cse1 300021)) (= 0 .cse1)))) (exists ((v_prenex_2 Int)) (and (<= c_~a29~0 (+ (mod v_prenex_2 299978) 300021)) (<= 0 v_prenex_2)))) is different from true [2019-09-07 20:49:23,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:49:23,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:49:26,978 WARN L188 SmtUtils]: Spent 3.91 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 20:49:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:49:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:49:27,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:49:27,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:49:29,698 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 72 DAG size of output: 20 [2019-09-07 20:49:29,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:49:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 474 proven. 48 refuted. 0 times theorem prover too weak. 424 trivial. 6 not checked. [2019-09-07 20:49:31,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:49:31,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 20:49:31,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:49:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:49:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2019-09-07 20:49:31,371 INFO L87 Difference]: Start difference. First operand 46586 states and 55385 transitions. Second operand 13 states. [2019-09-07 20:49:51,166 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2019-09-07 20:50:17,615 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-07 20:51:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:51:38,942 INFO L93 Difference]: Finished difference Result 111630 states and 133779 transitions. [2019-09-07 20:51:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 20:51:38,942 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 759 [2019-09-07 20:51:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:51:39,143 INFO L225 Difference]: With dead ends: 111630 [2019-09-07 20:51:39,143 INFO L226 Difference]: Without dead ends: 65977 [2019-09-07 20:51:39,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 773 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=277, Invalid=784, Unknown=3, NotChecked=126, Total=1190 [2019-09-07 20:51:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65977 states. [2019-09-07 20:51:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65977 to 55375. [2019-09-07 20:51:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55375 states. [2019-09-07 20:51:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55375 states to 55375 states and 65549 transitions. [2019-09-07 20:51:40,586 INFO L78 Accepts]: Start accepts. Automaton has 55375 states and 65549 transitions. Word has length 759 [2019-09-07 20:51:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:51:40,587 INFO L475 AbstractCegarLoop]: Abstraction has 55375 states and 65549 transitions. [2019-09-07 20:51:40,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:51:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 55375 states and 65549 transitions. [2019-09-07 20:51:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2019-09-07 20:51:40,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:51:40,670 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:51:40,671 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:51:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:51:40,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1180659121, now seen corresponding path program 1 times [2019-09-07 20:51:40,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:51:40,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:51:40,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:40,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:40,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 620 proven. 2 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2019-09-07 20:51:41,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:51:41,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:51:41,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:42,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:51:42,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:51:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 620 proven. 2 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:51:42,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:51:42,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:51:42,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:51:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:51:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:51:42,727 INFO L87 Difference]: Start difference. First operand 55375 states and 65549 transitions. Second operand 9 states. [2019-09-07 20:51:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:51:49,538 INFO L93 Difference]: Finished difference Result 114972 states and 147885 transitions. [2019-09-07 20:51:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 20:51:49,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 951 [2019-09-07 20:51:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:51:49,800 INFO L225 Difference]: With dead ends: 114972 [2019-09-07 20:51:49,800 INFO L226 Difference]: Without dead ends: 60536 [2019-09-07 20:51:49,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:51:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60536 states. [2019-09-07 20:51:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60536 to 59452. [2019-09-07 20:51:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59452 states. [2019-09-07 20:51:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59452 states to 59452 states and 77787 transitions. [2019-09-07 20:51:51,990 INFO L78 Accepts]: Start accepts. Automaton has 59452 states and 77787 transitions. Word has length 951 [2019-09-07 20:51:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:51:51,991 INFO L475 AbstractCegarLoop]: Abstraction has 59452 states and 77787 transitions. [2019-09-07 20:51:51,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:51:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 59452 states and 77787 transitions. [2019-09-07 20:51:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2019-09-07 20:51:52,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:51:52,106 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:51:52,107 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:51:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:51:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash -669313132, now seen corresponding path program 1 times [2019-09-07 20:51:52,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:51:52,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:51:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:52,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:52,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 334 proven. 2 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2019-09-07 20:51:53,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:51:53,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:51:54,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:54,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1410 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:51:54,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:51:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 715 proven. 0 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2019-09-07 20:51:55,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:51:55,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:51:55,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:51:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:51:55,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:51:55,094 INFO L87 Difference]: Start difference. First operand 59452 states and 77787 transitions. Second operand 3 states. [2019-09-07 20:51:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:51:57,860 INFO L93 Difference]: Finished difference Result 120144 states and 156693 transitions. [2019-09-07 20:51:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:51:57,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1072 [2019-09-07 20:51:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:51:58,068 INFO L225 Difference]: With dead ends: 120144 [2019-09-07 20:51:58,069 INFO L226 Difference]: Without dead ends: 57253 [2019-09-07 20:51:58,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 1073 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:51:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57253 states. [2019-09-07 20:51:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57253 to 56114. [2019-09-07 20:51:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56114 states. [2019-09-07 20:51:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56114 states to 56114 states and 68708 transitions. [2019-09-07 20:51:59,300 INFO L78 Accepts]: Start accepts. Automaton has 56114 states and 68708 transitions. Word has length 1072 [2019-09-07 20:51:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:51:59,301 INFO L475 AbstractCegarLoop]: Abstraction has 56114 states and 68708 transitions. [2019-09-07 20:51:59,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:51:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 56114 states and 68708 transitions. [2019-09-07 20:51:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2019-09-07 20:51:59,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:51:59,382 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:51:59,382 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:51:59,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:51:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash 495993442, now seen corresponding path program 1 times [2019-09-07 20:51:59,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:51:59,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:51:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:59,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2788 backedges. 401 proven. 4 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-09-07 20:52:00,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:52:00,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:52:00,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:00,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 1598 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:52:00,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:52:00,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:52:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2788 backedges. 1367 proven. 0 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2019-09-07 20:52:02,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:52:02,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 4 [2019-09-07 20:52:02,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:52:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:52:02,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:52:02,207 INFO L87 Difference]: Start difference. First operand 56114 states and 68708 transitions. Second operand 4 states. [2019-09-07 20:52:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:04,640 INFO L93 Difference]: Finished difference Result 92087 states and 111712 transitions. [2019-09-07 20:52:04,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:52:04,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1223 [2019-09-07 20:52:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:04,644 INFO L225 Difference]: With dead ends: 92087 [2019-09-07 20:52:04,644 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:52:04,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:52:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:52:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:52:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:52:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:52:04,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1223 [2019-09-07 20:52:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:04,809 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:52:04,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:52:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:52:04,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:52:04,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:52:15,247 WARN L188 SmtUtils]: Spent 7.70 s on a formula simplification. DAG size of input: 1535 DAG size of output: 1153 [2019-09-07 20:52:22,664 WARN L188 SmtUtils]: Spent 7.41 s on a formula simplification. DAG size of input: 1535 DAG size of output: 1153 [2019-09-07 20:52:30,553 WARN L188 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 741 DAG size of output: 158 [2019-09-07 20:52:38,075 WARN L188 SmtUtils]: Spent 7.48 s on a formula simplification. DAG size of input: 756 DAG size of output: 161 [2019-09-07 20:52:58,977 WARN L188 SmtUtils]: Spent 20.88 s on a formula simplification. DAG size of input: 1147 DAG size of output: 120 [2019-09-07 20:53:19,825 WARN L188 SmtUtils]: Spent 20.84 s on a formula simplification. DAG size of input: 1147 DAG size of output: 120 [2019-09-07 20:53:27,633 WARN L188 SmtUtils]: Spent 7.67 s on a formula simplification. DAG size of input: 775 DAG size of output: 174 [2019-09-07 20:53:27,636 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:53:27,637 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|)) [2019-09-07 20:53:27,637 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:53:27,637 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:53:27,637 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,637 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,638 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse8 (= ~a2~0 |old(~a2~0)|)) (.cse34 (+ |old(~a29~0)| 16)) (.cse19 (= 4 ~a2~0)) (.cse5 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse6 (= 3 |old(~a2~0)|)) (.cse16 (= 4 |old(~a2~0)|)) (.cse17 (= ~a29~0 |old(~a29~0)|)) (.cse29 (= 5 ~a2~0)) (.cse18 (= ~a0~0 |old(~a0~0)|)) (.cse9 (= ~a4~0 |old(~a4~0)|))) (let ((.cse3 (not (<= (+ |old(~a0~0)| 99) 0))) (.cse15 (not (<= 0 (+ |old(~a4~0)| 74)))) (.cse28 (not (<= |old(~a2~0)| 1))) (.cse4 (and .cse17 .cse29 .cse18 .cse9)) (.cse2 (not (= 5 |old(~a2~0)|))) (.cse7 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse21 (or .cse5 .cse6 .cse16)) (.cse25 (not (= 2 |old(~a2~0)|))) (.cse24 (and .cse17 (= 2 ~a2~0) .cse18 .cse9)) (.cse13 (and .cse17 .cse19 .cse18 .cse9)) (.cse20 (not (< 43 |old(~a29~0)|))) (.cse30 (not (<= (+ |old(~a29~0)| 127) 0))) (.cse0 (not (< 0 (+ |old(~a4~0)| 86)))) (.cse10 (not .cse16)) (.cse27 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse26 (not (<= .cse34 0))) (.cse1 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse23 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse11 (not (<= 0 (+ |old(~a0~0)| 60)))) (.cse12 (not (<= |old(~a29~0)| 599998))) (.cse22 (not (< 0 .cse34))) (.cse14 (and .cse17 .cse8 .cse18 .cse9)) (.cse31 (or .cse5 .cse16))) (and (or (or .cse0 .cse1 .cse2 .cse3) .cse4) (or .cse5 .cse6 .cse7 (and (<= (+ ~a0~0 98) 0) .cse8 .cse9)) (or (or .cse10 .cse5) .cse11 .cse12 .cse13) (or .cse1 .cse12 .cse14 .cse15 .cse3 .cse16) (or (and .cse17 (and .cse18 .cse19 .cse9)) .cse1 .cse12 (or .cse10 .cse20 .cse15 .cse7)) (or .cse5 (and .cse8 (<= (+ ~a0~0 99) 0) .cse9) .cse3) (or .cse21 .cse12 .cse22 .cse2 .cse4) (or .cse1 .cse23 .cse24 .cse25) (or .cse24 .cse0 .cse1 .cse12 .cse22 .cse25 .cse7) (or .cse13 (or .cse10 .cse1 .cse23 .cse15 .cse26)) (or .cse27 .cse0 .cse1 .cse12 .cse22 .cse2 .cse4) (or .cse27 .cse14 (or .cse1 .cse28 .cse26)) (or .cse0 .cse1 .cse23 .cse16 .cse14 .cse26) (or .cse27 (or .cse12 (or .cse21 .cse28)) .cse14) (or .cse0 .cse1 .cse12 .cse22 .cse14 .cse28) (or .cse1 .cse2 .cse23 (and .cse17 .cse29 (and .cse18 .cse9))) (or .cse0 .cse4 .cse1 .cse2 (not (<= 76980 |old(~a29~0)|)) .cse7) (or (or .cse21 .cse25) .cse12 .cse24) (or .cse0 .cse10 .cse1 .cse23 .cse30 .cse13) (or .cse12 .cse20 .cse14 .cse31) (or .cse14 .cse5 .cse30 (and (= 1 |old(~a2~0)|) (not (< 0 (+ |old(~a29~0)| 144))))) (or (or .cse1 (or .cse0 .cse10 .cse23 (forall ((v_prenex_1 Int)) (let ((.cse33 (* 4 (div v_prenex_1 5)))) (let ((.cse32 (mod .cse33 299978))) (or (= 0 .cse32) (not (<= (+ .cse32 43) |old(~a29~0)|)) (not (< .cse33 0)) (not (= (mod v_prenex_1 5) 0)))))))) (and .cse17 .cse18 .cse19 .cse9)) (or .cse27 (or .cse5 .cse26) .cse14) (or .cse1 .cse12 .cse23 .cse14 .cse22 .cse16) (or .cse11 .cse12 .cse22 .cse14 .cse31)))) [2019-09-07 20:53:27,638 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,638 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,638 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,638 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,638 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,639 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,639 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,639 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:53:27,639 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:53:27,639 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:53:27,639 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,639 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,639 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,640 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,640 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:53:27,640 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:53:27,640 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-09-07 20:53:27,640 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,640 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,640 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,640 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,641 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,642 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,642 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,642 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,642 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,642 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,642 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,642 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,642 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,643 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,644 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,644 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,644 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,644 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:53:27,644 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,644 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:53:27,644 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,644 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,645 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,646 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,647 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,648 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,649 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,650 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,651 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,652 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,653 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,654 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:53:27,655 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,655 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,655 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,655 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:53:27,655 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:53:27,655 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:53:27,655 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:53:27,655 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,656 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse32 (= 5 ~a2~0)) (.cse4 (= ~a2~0 |old(~a2~0)|)) (.cse37 (= 4 ~a2~0)) (.cse9 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse10 (= 3 |old(~a2~0)|)) (.cse14 (= 4 |old(~a2~0)|)) (.cse36 (+ |old(~a29~0)| 16)) (.cse3 (= ~a29~0 |old(~a29~0)|)) (.cse18 (= 2 ~a2~0)) (.cse17 (= ~a0~0 |old(~a0~0)|)) (.cse11 (= ~a4~0 |old(~a4~0)|))) (let ((.cse22 (and .cse3 .cse18 .cse17 .cse11)) (.cse16 (not (= 2 |old(~a2~0)|))) (.cse7 (not (<= 0 (+ |old(~a4~0)| 74)))) (.cse26 (not (<= .cse36 0))) (.cse19 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse15 (or .cse9 .cse10 .cse14)) (.cse2 (and .cse17 .cse11)) (.cse31 (not (<= (+ |old(~a29~0)| 127) 0))) (.cse25 (and .cse3 .cse37 .cse17 .cse11)) (.cse6 (not (< 43 |old(~a29~0)|))) (.cse5 (not .cse14)) (.cse30 (and .cse3 .cse17 .cse37 .cse11)) (.cse20 (not (<= |old(~a2~0)| 1))) (.cse21 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse29 (not (<= 0 (+ |old(~a0~0)| 60)))) (.cse1 (not (<= |old(~a29~0)| 599998))) (.cse24 (not (< 0 .cse36))) (.cse12 (and .cse3 .cse4 .cse17 .cse11)) (.cse33 (or .cse9 .cse14)) (.cse8 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse28 (and .cse3 .cse32 .cse17 .cse11)) (.cse23 (not (< 0 (+ |old(~a4~0)| 86)))) (.cse0 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse27 (not (= 5 |old(~a2~0)|))) (.cse13 (not (<= (+ |old(~a0~0)| 99) 0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8)) (or .cse9 .cse10 .cse8 (and (<= (+ ~a0~0 98) 0) .cse4 .cse11)) (or .cse0 .cse1 .cse12 .cse7 .cse13 .cse14) (or (or .cse15 .cse16) .cse1 (and .cse3 .cse17 .cse18 .cse11)) (or .cse19 (and (and .cse3 .cse17 .cse11) .cse4) (or .cse1 (or .cse15 .cse20))) (or .cse9 (and .cse4 (<= (+ ~a0~0 99) 0) .cse11) .cse13) (or .cse0 .cse21 .cse22 .cse16) (or .cse22 .cse23 .cse0 .cse1 .cse24 .cse16 .cse8) (or .cse25 (or .cse5 .cse0 .cse21 .cse7 .cse26)) (or .cse19 .cse23 .cse0 .cse1 .cse24 .cse27 .cse28) (or .cse19 .cse12 (or .cse0 .cse20 .cse26)) (or .cse23 .cse0 .cse21 .cse14 .cse12 .cse26) (or (or .cse5 .cse9) .cse29 .cse1 .cse30) (or .cse19 .cse12 (or .cse9 .cse26)) (or .cse12 .cse9 .cse31) (or .cse19 .cse15 .cse1 .cse27 (and .cse3 .cse17 .cse32 .cse11)) (or .cse0 .cse27 .cse21 (and .cse3 .cse32 .cse2)) (or .cse23 .cse5 .cse0 .cse21 .cse31 .cse25) (or .cse1 .cse6 .cse12 .cse33) (or (or .cse0 (or .cse23 .cse5 .cse21 (forall ((v_prenex_1 Int)) (let ((.cse35 (* 4 (div v_prenex_1 5)))) (let ((.cse34 (mod .cse35 299978))) (or (= 0 .cse34) (not (<= (+ .cse34 43) |old(~a29~0)|)) (not (< .cse35 0)) (not (= (mod v_prenex_1 5) 0)))))))) .cse30) (or .cse23 .cse0 .cse1 .cse24 .cse20 .cse12) (or .cse0 .cse1 .cse21 .cse12 .cse24 .cse14) (or .cse29 .cse1 .cse24 .cse12 .cse33) (or .cse23 .cse0 .cse27 (not (<= 76980 |old(~a29~0)|)) .cse8 .cse28) (or .cse28 (or .cse23 .cse0 .cse27 .cse13))))) [2019-09-07 20:53:27,656 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,656 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,656 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,656 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:53:27,657 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,658 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,659 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,660 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,661 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse30 (= 5 ~a2~0)) (.cse13 (= ~a2~0 |old(~a2~0)|)) (.cse36 (+ |old(~a29~0)| 16)) (.cse20 (= 4 ~a2~0)) (.cse18 (= ~a29~0 |old(~a29~0)|)) (.cse19 (= ~a0~0 |old(~a0~0)|)) (.cse14 (= ~a4~0 |old(~a4~0)|)) (.cse6 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse10 (= 3 |old(~a2~0)|)) (.cse17 (= 4 |old(~a2~0)|))) (let ((.cse3 (not (<= (+ |old(~a0~0)| 99) 0))) (.cse16 (not (<= 0 (+ |old(~a4~0)| 74)))) (.cse22 (or .cse6 .cse10 .cse17)) (.cse26 (not (= 2 |old(~a2~0)|))) (.cse25 (and .cse18 (= 2 ~a2~0) .cse19 .cse14)) (.cse21 (not (< 43 |old(~a29~0)|))) (.cse12 (<= (+ ~a0~0 98) 0)) (.cse33 (+ ~a0~0 61)) (.cse9 (and .cse18 .cse20 .cse19 .cse14)) (.cse32 (not (<= (+ |old(~a29~0)| 127) 0))) (.cse5 (not .cse17)) (.cse28 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse27 (not (<= .cse36 0))) (.cse29 (not (<= |old(~a2~0)| 1))) (.cse24 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse7 (not (<= 0 (+ |old(~a0~0)| 60)))) (.cse8 (not (<= |old(~a29~0)| 599998))) (.cse23 (not (< 0 .cse36))) (.cse15 (and .cse18 .cse13 .cse19 .cse14)) (.cse31 (or .cse6 .cse17)) (.cse0 (not (< 0 (+ |old(~a4~0)| 86)))) (.cse1 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse2 (not (= 5 |old(~a2~0)|))) (.cse11 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse4 (and .cse18 .cse30 .cse19 .cse14))) (and (or (or .cse0 .cse1 .cse2 .cse3) .cse4) (or (or .cse5 .cse6) .cse7 .cse8 .cse9) (or .cse6 .cse10 .cse11 (and .cse12 .cse13 .cse14)) (or .cse1 .cse8 .cse15 .cse16 .cse3 .cse17) (or (and .cse18 (and .cse19 .cse20 .cse14)) .cse1 .cse8 (or .cse5 .cse21 .cse16 .cse11)) (or .cse6 (and .cse13 (<= (+ ~a0~0 99) 0) .cse14) .cse3) (or .cse22 .cse8 .cse23 .cse2 .cse4) (or .cse1 .cse24 .cse25 .cse26) (or .cse25 .cse0 .cse1 .cse8 .cse23 .cse26 .cse11) (or .cse9 (or .cse5 .cse1 .cse24 .cse16 .cse27)) (or .cse28 .cse0 .cse1 .cse8 .cse23 .cse2 .cse4) (or .cse15 .cse0 .cse1 .cse24 .cse17 .cse27) (or .cse28 (or .cse8 (or .cse22 .cse29)) .cse15) (or .cse28 (or .cse1 .cse29 .cse27) .cse15) (or .cse1 .cse2 .cse24 (and .cse18 .cse30 (and .cse19 .cse14))) (or (or .cse22 .cse26) .cse8 .cse25) (or .cse8 .cse21 .cse15 .cse31) (or .cse6 .cse32 (and .cse18 .cse13 .cse19 .cse14 (or (not (= 1 ~a2~0)) (< 0 (+ ~a29~0 144)) (<= .cse33 0)))) (or (or .cse6 (not (<= (+ |old(~a29~0)| 107481) 0))) (or .cse12 (< 0 .cse33) (not (= 3 ~a2~0)))) (or .cse9 .cse0 .cse5 .cse1 .cse24 .cse32) (or (or .cse1 (or .cse0 .cse5 .cse24 (forall ((v_prenex_1 Int)) (let ((.cse35 (* 4 (div v_prenex_1 5)))) (let ((.cse34 (mod .cse35 299978))) (or (= 0 .cse34) (not (<= (+ .cse34 43) |old(~a29~0)|)) (not (< .cse35 0)) (not (= (mod v_prenex_1 5) 0)))))))) (and .cse18 .cse19 .cse20 .cse14)) (or .cse28 (or .cse6 .cse27) .cse15) (or .cse0 .cse1 .cse8 .cse23 .cse29 .cse15) (or .cse1 .cse8 .cse24 .cse15 .cse23 .cse17) (or .cse7 .cse8 .cse23 .cse15 .cse31) (or .cse0 .cse1 .cse2 (not (<= 76980 |old(~a29~0)|)) .cse11 .cse4)))) [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,662 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,663 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,664 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-07 20:53:27,664 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:53:27,664 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:53:27,664 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,664 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,664 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,664 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:53:27,664 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,665 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,666 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:53:27,666 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:53:27,666 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,666 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,666 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,666 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,666 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,666 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:53:27,667 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,668 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,669 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,670 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,671 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:53:27,671 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:53:27,671 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,671 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,671 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:53:27,671 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:53:27,671 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,671 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,672 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,673 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,674 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,675 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:53:27,676 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,677 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,678 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:53:27,679 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:53:27,680 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,681 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:53:27,682 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-09-07 20:53:27,682 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:53:27,682 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a4~0 89) 0) (<= 0 (+ ~a0~0 60)) (<= ~a2~0 1) (= (+ ~a29~0 127) 0)) [2019-09-07 20:53:27,682 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:53:27,682 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:53:27,682 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (or (not (<= 0 (+ |old(~a0~0)| 60))) (not (= 0 (+ |old(~a29~0)| 127))) (not (<= |old(~a2~0)| 1)) (not (<= (+ |old(~a4~0)| 89) 0)) (and (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0))) [2019-09-07 20:53:27,682 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:53:27,683 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse21 (+ ~a29~0 16))) (let ((.cse11 (<= (+ ~a29~0 127) 0)) (.cse9 (= 4 ~a2~0)) (.cse13 (= 2 ~a2~0)) (.cse14 (<= (+ ~a0~0 98) 0)) (.cse2 (= 5 ~a2~0)) (.cse4 (<= (+ ~a0~0 61) 0)) (.cse20 (< 43 ~a29~0)) (.cse19 (<= 0 (+ ~a4~0 74))) (.cse3 (<= .cse21 0)) (.cse10 (< 0 (+ ~a4~0 86))) (.cse5 (<= ~a2~0 1)) (.cse12 (<= (+ ~a0~0 99) 0)) (.cse6 (<= (+ ~a4~0 89) 0)) (.cse7 (<= 0 (+ ~a0~0 60))) (.cse15 (< 0 .cse21)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse16 (not (= ~a2~0 4))) (.cse8 (<= ~a29~0 599998)) (.cse0 (<= (+ ~a0~0 147) 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse0 .cse11) (and .cse1 .cse10 .cse12 .cse2) (and (and .cse6 .cse13) .cse8) (and .cse14 .cse1 .cse15 .cse10 .cse8 .cse13) (and .cse6 .cse3 .cse4) (not (<= 0 (+ |old(~a0~0)| 60))) (and .cse16 .cse1 .cse10 .cse0 .cse3) (and .cse6 .cse11) (and .cse1 (and .cse10 .cse0 (exists ((v_prenex_1 Int)) (let ((.cse18 (* 4 (div v_prenex_1 5)))) (let ((.cse17 (mod .cse18 299978))) (and (= (mod v_prenex_1 5) 0) (not (= 0 .cse17)) (< .cse18 0) (<= (+ .cse17 43) ~a29~0))))) .cse9)) (and .cse1 .cse8 (and .cse14 .cse19 .cse9 .cse20)) (and .cse6 .cse15 .cse8 .cse2) (and .cse1 (and .cse0 .cse13)) (not (<= |old(~a2~0)| 1)) (and .cse6 .cse14 (not (= 3 ~a2~0))) (and .cse16 .cse1 .cse12 .cse8 .cse19) (and (and (and .cse6 .cse5) .cse8) .cse4) (and .cse14 .cse1 .cse10 .cse2 (<= 76980 ~a29~0)) (and .cse1 .cse15 .cse10 .cse8 .cse2 .cse4) (and .cse6 .cse16 .cse8 .cse20) (not (= 0 (+ |old(~a29~0)| 127))) (and .cse1 .cse0 .cse19 .cse3) (and .cse1 .cse15 .cse10 .cse8 .cse5) (and .cse6 .cse12) (and .cse6 .cse7 .cse15 .cse8) (and .cse15 (and .cse1 .cse16 .cse8 .cse0)) (not (<= (+ |old(~a4~0)| 89) 0))))) [2019-09-07 20:53:27,683 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-09-07 20:53:27,683 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-09-07 20:53:27,683 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse21 (+ ~a29~0 16))) (let ((.cse11 (<= (+ ~a29~0 127) 0)) (.cse9 (= 4 ~a2~0)) (.cse13 (= 2 ~a2~0)) (.cse14 (<= (+ ~a0~0 98) 0)) (.cse2 (= 5 ~a2~0)) (.cse4 (<= (+ ~a0~0 61) 0)) (.cse20 (< 43 ~a29~0)) (.cse19 (<= 0 (+ ~a4~0 74))) (.cse3 (<= .cse21 0)) (.cse10 (< 0 (+ ~a4~0 86))) (.cse5 (<= ~a2~0 1)) (.cse12 (<= (+ ~a0~0 99) 0)) (.cse6 (<= (+ ~a4~0 89) 0)) (.cse7 (<= 0 (+ ~a0~0 60))) (.cse15 (< 0 .cse21)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse16 (not (= ~a2~0 4))) (.cse8 (<= ~a29~0 599998)) (.cse0 (<= (+ ~a0~0 147) 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse0 .cse11) (and .cse1 .cse10 .cse12 .cse2) (and (and .cse6 .cse13) .cse8) (and .cse14 .cse1 .cse15 .cse10 .cse8 .cse13) (and .cse6 .cse3 .cse4) (not (<= 0 (+ |old(~a0~0)| 60))) (and .cse16 .cse1 .cse10 .cse0 .cse3) (and .cse6 .cse11) (and .cse1 (and .cse10 .cse0 (exists ((v_prenex_1 Int)) (let ((.cse18 (* 4 (div v_prenex_1 5)))) (let ((.cse17 (mod .cse18 299978))) (and (= (mod v_prenex_1 5) 0) (not (= 0 .cse17)) (< .cse18 0) (<= (+ .cse17 43) ~a29~0))))) .cse9)) (and .cse1 .cse8 (and .cse14 .cse19 .cse9 .cse20)) (and .cse6 .cse15 .cse8 .cse2) (and .cse1 (and .cse0 .cse13)) (not (<= |old(~a2~0)| 1)) (and .cse6 .cse14 (not (= 3 ~a2~0))) (and .cse16 .cse1 .cse12 .cse8 .cse19) (and (and (and .cse6 .cse5) .cse8) .cse4) (and .cse14 .cse1 .cse10 .cse2 (<= 76980 ~a29~0)) (and .cse1 .cse15 .cse10 .cse8 .cse2 .cse4) (and .cse6 .cse16 .cse8 .cse20) (not (= 0 (+ |old(~a29~0)| 127))) (and .cse1 .cse0 .cse19 .cse3) (and .cse1 .cse15 .cse10 .cse8 .cse5) (and .cse6 .cse12) (and .cse6 .cse7 .cse15 .cse8) (and .cse15 (and .cse1 .cse16 .cse8 .cse0)) (not (<= (+ |old(~a4~0)| 89) 0))))) [2019-09-07 20:53:27,684 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:53:27,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:53:27 BoogieIcfgContainer [2019-09-07 20:53:27,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:53:27,718 INFO L168 Benchmark]: Toolchain (without parser) took 416663.91 ms. Allocated memory was 134.7 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 84.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-09-07 20:53:27,718 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:53:27,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1353.96 ms. Allocated memory was 134.7 MB in the beginning and 207.1 MB in the end (delta: 72.4 MB). Free memory was 83.9 MB in the beginning and 109.9 MB in the end (delta: -26.0 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. [2019-09-07 20:53:27,720 INFO L168 Benchmark]: Boogie Preprocessor took 229.57 ms. Allocated memory is still 207.1 MB. Free memory was 109.9 MB in the beginning and 97.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-09-07 20:53:27,721 INFO L168 Benchmark]: RCFGBuilder took 3926.60 ms. Allocated memory was 207.1 MB in the beginning and 267.4 MB in the end (delta: 60.3 MB). Free memory was 97.5 MB in the beginning and 213.1 MB in the end (delta: -115.6 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. [2019-09-07 20:53:27,722 INFO L168 Benchmark]: TraceAbstraction took 411149.24 ms. Allocated memory was 267.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 213.1 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-09-07 20:53:27,726 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.24 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1353.96 ms. Allocated memory was 134.7 MB in the beginning and 207.1 MB in the end (delta: 72.4 MB). Free memory was 83.9 MB in the beginning and 109.9 MB in the end (delta: -26.0 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 229.57 ms. Allocated memory is still 207.1 MB. Free memory was 109.9 MB in the beginning and 97.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3926.60 ms. Allocated memory was 207.1 MB in the beginning and 267.4 MB in the end (delta: 60.3 MB). Free memory was 97.5 MB in the beginning and 213.1 MB in the end (delta: -115.6 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 411149.24 ms. Allocated memory was 267.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 213.1 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: 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: 1766]: Loop Invariant [2019-09-07 20:53:27,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-07 20:53:27,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a0 + 147 <= 0 && a4 + 42 <= 0) && 5 == a2) || (((a4 + 42 <= 0 && a29 + 16 <= 0) && a0 + 61 <= 0) && a2 <= 1)) || (((a4 + 89 <= 0 && 0 <= a0 + 60) && a29 <= 599998) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && a29 + 127 <= 0)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 99 <= 0) && 5 == a2)) || ((a4 + 89 <= 0 && 2 == a2) && a29 <= 599998)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 599998) && 2 == a2)) || ((a4 + 89 <= 0 && a29 + 16 <= 0) && a0 + 61 <= 0)) || !(0 <= \old(a0) + 60)) || ((((!(a2 == 4) && a4 + 42 <= 0) && 0 < a4 + 86) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (a4 + 89 <= 0 && a29 + 127 <= 0)) || (a4 + 42 <= 0 && ((0 < a4 + 86 && a0 + 147 <= 0) && (\exists v_prenex_1 : int :: ((v_prenex_1 % 5 == 0 && !(0 == 4 * (v_prenex_1 / 5) % 299978)) && 4 * (v_prenex_1 / 5) < 0) && 4 * (v_prenex_1 / 5) % 299978 + 43 <= a29)) && 4 == a2)) || ((a4 + 42 <= 0 && a29 <= 599998) && ((a0 + 98 <= 0 && 0 <= a4 + 74) && 4 == a2) && 43 < a29)) || (((a4 + 89 <= 0 && 0 < a29 + 16) && a29 <= 599998) && 5 == a2)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || !(\old(a2) <= 1)) || ((a4 + 89 <= 0 && a0 + 98 <= 0) && !(3 == a2))) || ((((!(a2 == 4) && a4 + 42 <= 0) && a0 + 99 <= 0) && a29 <= 599998) && 0 <= a4 + 74)) || (((a4 + 89 <= 0 && a2 <= 1) && a29 <= 599998) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 5 == a2) && 76980 <= a29)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 599998) && 5 == a2) && a0 + 61 <= 0)) || (((a4 + 89 <= 0 && !(a2 == 4)) && a29 <= 599998) && 43 < a29)) || !(0 == \old(a29) + 127)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a4 + 74) && a29 + 16 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 599998) && a2 <= 1)) || (a4 + 89 <= 0 && a0 + 99 <= 0)) || (((a4 + 89 <= 0 && 0 <= a0 + 60) && 0 < a29 + 16) && a29 <= 599998)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && !(a2 == 4)) && a29 <= 599998) && a0 + 147 <= 0)) || !(\old(a4) + 89 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 411.0s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 288.7s AutomataDifference, 0.0s DeadEndRemovalTime, 82.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 3272 SDtfs, 24588 SDslu, 3172 SDs, 0 SdLazy, 50038 SolverSat, 7100 SolverUnsat, 92 SolverUnknown, 0 SolverNotchecked, 256.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6968 GetRequests, 6778 SyntacticMatches, 5 SemanticMatches, 185 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59452occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 25638 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9113 PreInvPairs, 11027 NumberOfFragments, 4116 HoareAnnotationTreeSize, 9113 FomulaSimplifications, 436331 FormulaSimplificationTreeSizeReduction, 19.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 374721 FormulaSimplificationTreeSizeReductionInter, 63.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 14708 NumberOfCodeBlocks, 14708 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 14683 ConstructedInterpolants, 72 QuantifiedInterpolants, 22740899 SizeOfPredicates, 14 NumberOfNonLiveVariables, 9072 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 25 InterpolantComputations, 12 PerfectInterpolantSequences, 19882/20514 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...