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_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:30:55,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:30:55,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:30:55,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:30:55,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:30:55,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:30:55,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:30:55,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:30:55,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:30:55,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:30:55,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:30:55,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:30:55,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:30:55,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:30:55,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:30:55,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:30:55,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:30:55,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:30:55,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:30:55,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:30:55,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:30:55,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:30:55,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:30:55,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:30:56,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:30:56,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:30:56,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:30:56,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:30:56,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:30:56,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:30:56,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:30:56,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:30:56,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:30:56,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:30:56,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:30:56,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:30:56,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:30:56,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:30:56,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:30:56,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:30:56,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:30:56,010 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:30:56,028 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:30:56,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:30:56,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:30:56,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:30:56,031 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:30:56,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:30:56,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:30:56,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:30:56,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:30:56,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:30:56,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:30:56,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:30:56,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:30:56,035 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:30:56,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:30:56,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:30:56,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:30:56,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:30:56,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:30:56,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:30:56,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:30:56,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:30:56,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:30:56,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:30:56,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:30:56,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:30:56,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:30:56,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:30:56,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:30:56,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:30:56,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:30:56,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:30:56,113 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:30:56,114 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:30:56,114 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label24.c [2019-09-07 20:30:56,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d92109cd/7c2b67112fd84e4390a997bd1f4e4f31/FLAG73e2e29e7 [2019-09-07 20:30:56,850 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:30:56,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label24.c [2019-09-07 20:30:56,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d92109cd/7c2b67112fd84e4390a997bd1f4e4f31/FLAG73e2e29e7 [2019-09-07 20:30:57,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d92109cd/7c2b67112fd84e4390a997bd1f4e4f31 [2019-09-07 20:30:57,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:30:57,034 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:30:57,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:30:57,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:30:57,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:30:57,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:30:57" (1/1) ... [2019-09-07 20:30:57,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7e5387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:57, skipping insertion in model container [2019-09-07 20:30:57,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:30:57" (1/1) ... [2019-09-07 20:30:57,052 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:30:57,151 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:30:58,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:30:58,098 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:30:58,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:30:58,525 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:30:58,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58 WrapperNode [2019-09-07 20:30:58,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:30:58,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:30:58,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:30:58,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:30:58,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (1/1) ... [2019-09-07 20:30:58,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (1/1) ... [2019-09-07 20:30:58,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (1/1) ... [2019-09-07 20:30:58,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (1/1) ... [2019-09-07 20:30:58,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (1/1) ... [2019-09-07 20:30:58,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (1/1) ... [2019-09-07 20:30:58,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (1/1) ... [2019-09-07 20:30:58,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:30:58,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:30:58,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:30:58,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:30:58,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (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:30:58,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:30:58,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:30:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:30:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:30:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:30:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:30:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:30:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:30:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:30:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:30:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:30:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:30:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:31:02,046 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:31:02,047 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:31:02,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:31:02 BoogieIcfgContainer [2019-09-07 20:31:02,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:31:02,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:31:02,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:31:02,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:31:02,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:30:57" (1/3) ... [2019-09-07 20:31:02,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62061a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:31:02, skipping insertion in model container [2019-09-07 20:31:02,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:30:58" (2/3) ... [2019-09-07 20:31:02,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62061a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:31:02, skipping insertion in model container [2019-09-07 20:31:02,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:31:02" (3/3) ... [2019-09-07 20:31:02,061 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label24.c [2019-09-07 20:31:02,078 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:31:02,091 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:31:02,121 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:31:02,193 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:31:02,195 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:31:02,195 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:31:02,195 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:31:02,196 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:31:02,196 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:31:02,197 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:31:02,197 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:31:02,197 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:31:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:31:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 20:31:02,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:02,263 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] [2019-09-07 20:31:02,266 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:02,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2140723432, now seen corresponding path program 1 times [2019-09-07 20:31:02,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:02,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:02,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:02,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:02,734 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:31:02,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:31:02,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:31:02,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:31:02,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:31:02,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:31:02,762 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 3 states. [2019-09-07 20:31:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:05,831 INFO L93 Difference]: Finished difference Result 1195 states and 2155 transitions. [2019-09-07 20:31:05,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:31:05,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-07 20:31:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:05,858 INFO L225 Difference]: With dead ends: 1195 [2019-09-07 20:31:05,858 INFO L226 Difference]: Without dead ends: 696 [2019-09-07 20:31:05,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 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:31:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-07 20:31:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 692. [2019-09-07 20:31:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-09-07 20:31:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1157 transitions. [2019-09-07 20:31:05,964 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1157 transitions. Word has length 44 [2019-09-07 20:31:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:05,965 INFO L475 AbstractCegarLoop]: Abstraction has 692 states and 1157 transitions. [2019-09-07 20:31:05,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:31:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1157 transitions. [2019-09-07 20:31:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 20:31:05,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:05,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:05,973 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1485641363, now seen corresponding path program 1 times [2019-09-07 20:31:05,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:05,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:05,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:05,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:05,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:31:06,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:31:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:31:06,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:31:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:31:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:31:06,203 INFO L87 Difference]: Start difference. First operand 692 states and 1157 transitions. Second operand 5 states. [2019-09-07 20:31:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:09,883 INFO L93 Difference]: Finished difference Result 2041 states and 3446 transitions. [2019-09-07 20:31:09,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:31:09,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-07 20:31:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:09,902 INFO L225 Difference]: With dead ends: 2041 [2019-09-07 20:31:09,902 INFO L226 Difference]: Without dead ends: 1355 [2019-09-07 20:31:09,908 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:31:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-09-07 20:31:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1325. [2019-09-07 20:31:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-09-07 20:31:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1912 transitions. [2019-09-07 20:31:10,028 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1912 transitions. Word has length 117 [2019-09-07 20:31:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:10,032 INFO L475 AbstractCegarLoop]: Abstraction has 1325 states and 1912 transitions. [2019-09-07 20:31:10,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:31:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1912 transitions. [2019-09-07 20:31:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 20:31:10,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:10,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,048 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash 53496053, now seen corresponding path program 1 times [2019-09-07 20:31:10,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:10,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:10,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:10,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:31:10,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:31:10,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:31:10,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:31:10,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:31:10,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:31:10,351 INFO L87 Difference]: Start difference. First operand 1325 states and 1912 transitions. Second operand 6 states. [2019-09-07 20:31:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:13,811 INFO L93 Difference]: Finished difference Result 3342 states and 4862 transitions. [2019-09-07 20:31:13,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:31:13,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-07 20:31:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:13,831 INFO L225 Difference]: With dead ends: 3342 [2019-09-07 20:31:13,832 INFO L226 Difference]: Without dead ends: 2023 [2019-09-07 20:31:13,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:31:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-09-07 20:31:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1995. [2019-09-07 20:31:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-09-07 20:31:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2740 transitions. [2019-09-07 20:31:13,892 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2740 transitions. Word has length 129 [2019-09-07 20:31:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:13,893 INFO L475 AbstractCegarLoop]: Abstraction has 1995 states and 2740 transitions. [2019-09-07 20:31:13,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:31:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2740 transitions. [2019-09-07 20:31:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 20:31:13,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:13,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:13,896 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash 448816695, now seen corresponding path program 1 times [2019-09-07 20:31:13,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:13,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:13,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:13,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:13,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:31:14,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:31:14,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:31:14,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:31:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:31:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:31:14,063 INFO L87 Difference]: Start difference. First operand 1995 states and 2740 transitions. Second operand 6 states. [2019-09-07 20:31:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:17,389 INFO L93 Difference]: Finished difference Result 4657 states and 6444 transitions. [2019-09-07 20:31:17,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:31:17,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-07 20:31:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:17,411 INFO L225 Difference]: With dead ends: 4657 [2019-09-07 20:31:17,411 INFO L226 Difference]: Without dead ends: 2668 [2019-09-07 20:31:17,418 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:31:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-09-07 20:31:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2649. [2019-09-07 20:31:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2649 states. [2019-09-07 20:31:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3493 transitions. [2019-09-07 20:31:17,538 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3493 transitions. Word has length 130 [2019-09-07 20:31:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:17,539 INFO L475 AbstractCegarLoop]: Abstraction has 2649 states and 3493 transitions. [2019-09-07 20:31:17,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:31:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3493 transitions. [2019-09-07 20:31:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 20:31:17,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:17,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:17,545 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:17,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2045322290, now seen corresponding path program 1 times [2019-09-07 20:31:17,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:17,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:17,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:17,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:17,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:31:17,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:31:17,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:31:17,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:31:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:31:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:31:17,740 INFO L87 Difference]: Start difference. First operand 2649 states and 3493 transitions. Second operand 6 states. [2019-09-07 20:31:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:23,445 INFO L93 Difference]: Finished difference Result 7918 states and 10691 transitions. [2019-09-07 20:31:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:31:23,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-09-07 20:31:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:23,471 INFO L225 Difference]: With dead ends: 7918 [2019-09-07 20:31:23,471 INFO L226 Difference]: Without dead ends: 5275 [2019-09-07 20:31:23,479 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:31:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5275 states. [2019-09-07 20:31:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5275 to 5232. [2019-09-07 20:31:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5232 states. [2019-09-07 20:31:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 6824 transitions. [2019-09-07 20:31:23,603 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 6824 transitions. Word has length 170 [2019-09-07 20:31:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:23,604 INFO L475 AbstractCegarLoop]: Abstraction has 5232 states and 6824 transitions. [2019-09-07 20:31:23,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:31:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 6824 transitions. [2019-09-07 20:31:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-07 20:31:23,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:23,607 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:31:23,608 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1555391006, now seen corresponding path program 1 times [2019-09-07 20:31:23,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:23,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:23,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:23,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:23,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 20:31:23,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:31:23,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:31:23,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:31:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:31:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:31:23,770 INFO L87 Difference]: Start difference. First operand 5232 states and 6824 transitions. Second operand 5 states. [2019-09-07 20:31:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:29,646 INFO L93 Difference]: Finished difference Result 17002 states and 22875 transitions. [2019-09-07 20:31:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 20:31:29,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 197 [2019-09-07 20:31:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:29,700 INFO L225 Difference]: With dead ends: 17002 [2019-09-07 20:31:29,701 INFO L226 Difference]: Without dead ends: 11776 [2019-09-07 20:31:29,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:31:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11776 states. [2019-09-07 20:31:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11776 to 8656. [2019-09-07 20:31:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8656 states. [2019-09-07 20:31:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 11936 transitions. [2019-09-07 20:31:29,997 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 11936 transitions. Word has length 197 [2019-09-07 20:31:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:29,998 INFO L475 AbstractCegarLoop]: Abstraction has 8656 states and 11936 transitions. [2019-09-07 20:31:29,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:31:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 11936 transitions. [2019-09-07 20:31:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-07 20:31:30,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:30,003 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:31:30,004 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:30,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:30,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1407276320, now seen corresponding path program 1 times [2019-09-07 20:31:30,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:30,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:30,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:30,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:30,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:31:30,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:31:30,189 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:31:30,216 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:31:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:30,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:31:30,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:31:30,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:31:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 20:31:30,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:31:30,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:31:30,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:31:30,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:31:30,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:31:30,569 INFO L87 Difference]: Start difference. First operand 8656 states and 11936 transitions. Second operand 8 states. [2019-09-07 20:31:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:38,657 INFO L93 Difference]: Finished difference Result 24291 states and 34352 transitions. [2019-09-07 20:31:38,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 20:31:38,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 223 [2019-09-07 20:31:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:38,755 INFO L225 Difference]: With dead ends: 24291 [2019-09-07 20:31:38,755 INFO L226 Difference]: Without dead ends: 15641 [2019-09-07 20:31:38,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-09-07 20:31:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15641 states. [2019-09-07 20:31:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15641 to 14375. [2019-09-07 20:31:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14375 states. [2019-09-07 20:31:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14375 states to 14375 states and 19839 transitions. [2019-09-07 20:31:39,162 INFO L78 Accepts]: Start accepts. Automaton has 14375 states and 19839 transitions. Word has length 223 [2019-09-07 20:31:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:39,162 INFO L475 AbstractCegarLoop]: Abstraction has 14375 states and 19839 transitions. [2019-09-07 20:31:39,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:31:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 14375 states and 19839 transitions. [2019-09-07 20:31:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-07 20:31:39,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:39,174 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,174 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash 370030547, now seen corresponding path program 1 times [2019-09-07 20:31:39,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:39,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:39,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:39,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:39,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 191 proven. 84 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 20:31:39,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:31:39,803 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:31:39,818 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:31:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:39,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:31:39,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:31:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 287 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 20:31:40,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:31:40,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 20:31:40,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:31:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:31:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:31:40,178 INFO L87 Difference]: Start difference. First operand 14375 states and 19839 transitions. Second operand 11 states. [2019-09-07 20:31:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:48,233 INFO L93 Difference]: Finished difference Result 34505 states and 49012 transitions. [2019-09-07 20:31:48,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:31:48,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 369 [2019-09-07 20:31:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:48,365 INFO L225 Difference]: With dead ends: 34505 [2019-09-07 20:31:48,365 INFO L226 Difference]: Without dead ends: 20443 [2019-09-07 20:31:48,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 383 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:31:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20443 states. [2019-09-07 20:31:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20443 to 19742. [2019-09-07 20:31:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19742 states. [2019-09-07 20:31:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19742 states to 19742 states and 24512 transitions. [2019-09-07 20:31:49,137 INFO L78 Accepts]: Start accepts. Automaton has 19742 states and 24512 transitions. Word has length 369 [2019-09-07 20:31:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:49,138 INFO L475 AbstractCegarLoop]: Abstraction has 19742 states and 24512 transitions. [2019-09-07 20:31:49,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:31:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19742 states and 24512 transitions. [2019-09-07 20:31:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-07 20:31:49,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:49,164 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:49,164 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash -797057417, now seen corresponding path program 1 times [2019-09-07 20:31:49,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:49,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:49,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2019-09-07 20:31:49,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:31:49,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:31:49,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:31:49,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:31:49,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:31:49,625 INFO L87 Difference]: Start difference. First operand 19742 states and 24512 transitions. Second operand 3 states. [2019-09-07 20:31:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:31:52,258 INFO L93 Difference]: Finished difference Result 49364 states and 62018 transitions. [2019-09-07 20:31:52,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:31:52,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 549 [2019-09-07 20:31:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:31:52,338 INFO L225 Difference]: With dead ends: 49364 [2019-09-07 20:31:52,338 INFO L226 Difference]: Without dead ends: 26464 [2019-09-07 20:31:52,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:31:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26464 states. [2019-09-07 20:31:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26464 to 23392. [2019-09-07 20:31:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23392 states. [2019-09-07 20:31:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23392 states to 23392 states and 27385 transitions. [2019-09-07 20:31:52,846 INFO L78 Accepts]: Start accepts. Automaton has 23392 states and 27385 transitions. Word has length 549 [2019-09-07 20:31:52,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:31:52,847 INFO L475 AbstractCegarLoop]: Abstraction has 23392 states and 27385 transitions. [2019-09-07 20:31:52,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:31:52,847 INFO L276 IsEmpty]: Start isEmpty. Operand 23392 states and 27385 transitions. [2019-09-07 20:31:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2019-09-07 20:31:52,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:31:52,886 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:52,886 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:31:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:31:52,887 INFO L82 PathProgramCache]: Analyzing trace with hash -93453714, now seen corresponding path program 1 times [2019-09-07 20:31:52,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:31:52,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:31:52,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:52,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:31:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:31:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 527 proven. 2 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 20:31:54,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:31:54,486 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) [2019-09-07 20:31:54,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:31:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:31:54,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:31:54,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:31:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 527 proven. 2 refuted. 0 times theorem prover too weak. 330 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:31:55,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:31:55,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:31:55,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:31:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:31:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:31:55,056 INFO L87 Difference]: Start difference. First operand 23392 states and 27385 transitions. Second operand 7 states. [2019-09-07 20:32:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:00,201 INFO L93 Difference]: Finished difference Result 55264 states and 66719 transitions. [2019-09-07 20:32:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:32:00,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 693 [2019-09-07 20:32:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:00,292 INFO L225 Difference]: With dead ends: 55264 [2019-09-07 20:32:00,292 INFO L226 Difference]: Without dead ends: 30919 [2019-09-07 20:32:00,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:32:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2019-09-07 20:32:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 29228. [2019-09-07 20:32:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29228 states. [2019-09-07 20:32:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29228 states to 29228 states and 33290 transitions. [2019-09-07 20:32:00,902 INFO L78 Accepts]: Start accepts. Automaton has 29228 states and 33290 transitions. Word has length 693 [2019-09-07 20:32:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:00,904 INFO L475 AbstractCegarLoop]: Abstraction has 29228 states and 33290 transitions. [2019-09-07 20:32:00,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:32:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29228 states and 33290 transitions. [2019-09-07 20:32:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-09-07 20:32:00,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:00,938 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:32:00,938 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1329789729, now seen corresponding path program 1 times [2019-09-07 20:32:00,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:00,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:00,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-09-07 20:32:01,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:32:01,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:32:01,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:32:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:32:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:32:01,726 INFO L87 Difference]: Start difference. First operand 29228 states and 33290 transitions. Second operand 4 states. [2019-09-07 20:32:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:05,142 INFO L93 Difference]: Finished difference Result 59081 states and 67357 transitions. [2019-09-07 20:32:05,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:32:05,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 695 [2019-09-07 20:32:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:05,235 INFO L225 Difference]: With dead ends: 59081 [2019-09-07 20:32:05,235 INFO L226 Difference]: Without dead ends: 29854 [2019-09-07 20:32:05,266 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:32:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29854 states. [2019-09-07 20:32:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29854 to 28602. [2019-09-07 20:32:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28602 states. [2019-09-07 20:32:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28602 states to 28602 states and 32379 transitions. [2019-09-07 20:32:05,645 INFO L78 Accepts]: Start accepts. Automaton has 28602 states and 32379 transitions. Word has length 695 [2019-09-07 20:32:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:05,646 INFO L475 AbstractCegarLoop]: Abstraction has 28602 states and 32379 transitions. [2019-09-07 20:32:05,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:32:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28602 states and 32379 transitions. [2019-09-07 20:32:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2019-09-07 20:32:05,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:05,668 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:05,668 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:05,669 INFO L82 PathProgramCache]: Analyzing trace with hash -305858690, now seen corresponding path program 1 times [2019-09-07 20:32:05,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:05,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:05,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:05,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:05,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 360 proven. 150 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-07 20:32:06,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:06,674 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:32:06,702 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:32:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:06,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:32:06,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 618 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 20:32:07,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:32:07,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:32:07,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:32:07,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:32:07,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:32:07,338 INFO L87 Difference]: Start difference. First operand 28602 states and 32379 transitions. Second operand 9 states. [2019-09-07 20:32:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:10,904 INFO L93 Difference]: Finished difference Result 57964 states and 66022 transitions. [2019-09-07 20:32:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:32:10,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 727 [2019-09-07 20:32:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:10,960 INFO L225 Difference]: With dead ends: 57964 [2019-09-07 20:32:10,960 INFO L226 Difference]: Without dead ends: 29675 [2019-09-07 20:32:10,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:32:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29675 states. [2019-09-07 20:32:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29675 to 27726. [2019-09-07 20:32:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27726 states. [2019-09-07 20:32:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27726 states to 27726 states and 30553 transitions. [2019-09-07 20:32:11,399 INFO L78 Accepts]: Start accepts. Automaton has 27726 states and 30553 transitions. Word has length 727 [2019-09-07 20:32:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:11,400 INFO L475 AbstractCegarLoop]: Abstraction has 27726 states and 30553 transitions. [2019-09-07 20:32:11,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:32:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 27726 states and 30553 transitions. [2019-09-07 20:32:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-09-07 20:32:11,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:11,418 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:32:11,419 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:11,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash 175085105, now seen corresponding path program 1 times [2019-09-07 20:32:11,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:11,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:11,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:11,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 560 proven. 5 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-09-07 20:32:12,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:12,206 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:32:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:12,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:32:12,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:12,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:32:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 788 proven. 2 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-07 20:32:12,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:32:12,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 20:32:12,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:32:12,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:32:12,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:32:12,791 INFO L87 Difference]: Start difference. First operand 27726 states and 30553 transitions. Second operand 11 states. [2019-09-07 20:32:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:24,964 INFO L93 Difference]: Finished difference Result 64309 states and 71713 transitions. [2019-09-07 20:32:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 20:32:24,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 736 [2019-09-07 20:32:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:25,021 INFO L225 Difference]: With dead ends: 64309 [2019-09-07 20:32:25,022 INFO L226 Difference]: Without dead ends: 36896 [2019-09-07 20:32:25,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 771 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=526, Invalid=2024, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 20:32:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36896 states. [2019-09-07 20:32:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36896 to 32974. [2019-09-07 20:32:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2019-09-07 20:32:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 35791 transitions. [2019-09-07 20:32:25,556 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 35791 transitions. Word has length 736 [2019-09-07 20:32:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:25,557 INFO L475 AbstractCegarLoop]: Abstraction has 32974 states and 35791 transitions. [2019-09-07 20:32:25,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:32:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 35791 transitions. [2019-09-07 20:32:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2019-09-07 20:32:25,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:25,586 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:32:25,587 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1706458680, now seen corresponding path program 1 times [2019-09-07 20:32:25,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:25,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:25,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:25,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:25,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 602 proven. 2 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2019-09-07 20:32:26,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:26,727 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:32:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:26,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:32:26,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:26,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:26,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:26,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:26,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:26,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 602 proven. 2 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2019-09-07 20:32:27,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:32:27,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:32:27,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:32:27,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:32:27,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:32:27,389 INFO L87 Difference]: Start difference. First operand 32974 states and 35791 transitions. Second operand 7 states. [2019-09-07 20:32:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:32,607 INFO L93 Difference]: Finished difference Result 74347 states and 83296 transitions. [2019-09-07 20:32:32,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 20:32:32,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 878 [2019-09-07 20:32:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:32,734 INFO L225 Difference]: With dead ends: 74347 [2019-09-07 20:32:32,734 INFO L226 Difference]: Without dead ends: 41686 [2019-09-07 20:32:32,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 883 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:32:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41686 states. [2019-09-07 20:32:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41686 to 36423. [2019-09-07 20:32:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36423 states. [2019-09-07 20:32:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36423 states to 36423 states and 39687 transitions. [2019-09-07 20:32:33,451 INFO L78 Accepts]: Start accepts. Automaton has 36423 states and 39687 transitions. Word has length 878 [2019-09-07 20:32:33,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:33,452 INFO L475 AbstractCegarLoop]: Abstraction has 36423 states and 39687 transitions. [2019-09-07 20:32:33,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:32:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36423 states and 39687 transitions. [2019-09-07 20:32:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2019-09-07 20:32:33,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:33,476 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2019-09-07 20:32:33,477 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash 206833464, now seen corresponding path program 1 times [2019-09-07 20:32:33,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:33,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:33,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:33,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 778 proven. 2 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-09-07 20:32:34,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:34,968 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:32:34,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:35,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:32:35,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 778 proven. 2 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-09-07 20:32:35,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:32:35,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 20:32:35,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:32:35,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:32:35,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:32:35,558 INFO L87 Difference]: Start difference. First operand 36423 states and 39687 transitions. Second operand 6 states. [2019-09-07 20:32:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:38,603 INFO L93 Difference]: Finished difference Result 75629 states and 82519 transitions. [2019-09-07 20:32:38,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:32:38,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 906 [2019-09-07 20:32:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:38,666 INFO L225 Difference]: With dead ends: 75629 [2019-09-07 20:32:38,666 INFO L226 Difference]: Without dead ends: 39519 [2019-09-07 20:32:38,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 910 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:32:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39519 states. [2019-09-07 20:32:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39519 to 36724. [2019-09-07 20:32:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36724 states. [2019-09-07 20:32:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36724 states to 36724 states and 39546 transitions. [2019-09-07 20:32:39,170 INFO L78 Accepts]: Start accepts. Automaton has 36724 states and 39546 transitions. Word has length 906 [2019-09-07 20:32:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:39,172 INFO L475 AbstractCegarLoop]: Abstraction has 36724 states and 39546 transitions. [2019-09-07 20:32:39,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:32:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36724 states and 39546 transitions. [2019-09-07 20:32:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2019-09-07 20:32:39,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:39,204 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:39,204 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:39,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1065445759, now seen corresponding path program 1 times [2019-09-07 20:32:39,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:39,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:39,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:39,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 764 proven. 2 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-09-07 20:32:40,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:40,791 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:32:41,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:41,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:32:41,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 764 proven. 2 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Stream closed [2019-09-07 20:32:42,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:32:42,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:32:42,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:32:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:32:42,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:32:42,195 INFO L87 Difference]: Start difference. First operand 36724 states and 39546 transitions. Second operand 7 states. [2019-09-07 20:32:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:46,199 INFO L93 Difference]: Finished difference Result 78402 states and 84376 transitions. [2019-09-07 20:32:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:32:46,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 930 [2019-09-07 20:32:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:46,298 INFO L225 Difference]: With dead ends: 78402 [2019-09-07 20:32:46,298 INFO L226 Difference]: Without dead ends: 41991 [2019-09-07 20:32:46,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 933 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:32:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41991 states. [2019-09-07 20:32:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41991 to 40127. [2019-09-07 20:32:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40127 states. [2019-09-07 20:32:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40127 states to 40127 states and 43016 transitions. [2019-09-07 20:32:46,821 INFO L78 Accepts]: Start accepts. Automaton has 40127 states and 43016 transitions. Word has length 930 [2019-09-07 20:32:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:46,822 INFO L475 AbstractCegarLoop]: Abstraction has 40127 states and 43016 transitions. [2019-09-07 20:32:46,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:32:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 40127 states and 43016 transitions. [2019-09-07 20:32:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1052 [2019-09-07 20:32:46,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:46,846 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:32:46,847 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:46,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:46,847 INFO L82 PathProgramCache]: Analyzing trace with hash 472423212, now seen corresponding path program 1 times [2019-09-07 20:32:46,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:46,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:46,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:46,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:46,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 160 proven. 1184 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-07 20:32:49,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:49,236 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:32:49,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:49,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:32:49,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:49,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:49,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:53,871 WARN L188 SmtUtils]: Spent 4.13 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 20:32:57,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:33:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 1051 proven. 78 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-09-07 20:33:01,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:33:01,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-07 20:33:01,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:33:01,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:33:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=1, NotChecked=0, Total=182 [2019-09-07 20:33:01,708 INFO L87 Difference]: Start difference. First operand 40127 states and 43016 transitions. Second operand 14 states. [2019-09-07 20:33:05,036 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-07 20:33:07,304 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-09-07 20:33:10,411 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-09-07 20:33:13,189 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2019-09-07 20:33:17,370 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-07 20:33:44,004 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-09-07 20:34:30,248 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-09-07 20:34:50,310 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-07 20:35:46,365 WARN L188 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 32 [2019-09-07 20:37:03,948 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-07 20:37:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:37:20,337 INFO L93 Difference]: Finished difference Result 103428 states and 113275 transitions. [2019-09-07 20:37:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 20:37:20,338 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1051 [2019-09-07 20:37:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:37:20,467 INFO L225 Difference]: With dead ends: 103428 [2019-09-07 20:37:20,467 INFO L226 Difference]: Without dead ends: 63301 [2019-09-07 20:37:20,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 1061 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=275, Invalid=1053, Unknown=4, NotChecked=0, Total=1332 [2019-09-07 20:37:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63301 states. [2019-09-07 20:37:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63301 to 57955. [2019-09-07 20:37:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57955 states. [2019-09-07 20:37:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57955 states to 57955 states and 61471 transitions. [2019-09-07 20:37:21,283 INFO L78 Accepts]: Start accepts. Automaton has 57955 states and 61471 transitions. Word has length 1051 [2019-09-07 20:37:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:37:21,284 INFO L475 AbstractCegarLoop]: Abstraction has 57955 states and 61471 transitions. [2019-09-07 20:37:21,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:37:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 57955 states and 61471 transitions. [2019-09-07 20:37:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1918 [2019-09-07 20:37:21,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:37:21,354 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 20:37:21,354 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:37:21,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:37:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1716963588, now seen corresponding path program 1 times [2019-09-07 20:37:21,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:37:21,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:37:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:37:21,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:37:21,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:37:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:37:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7695 backedges. 1657 proven. 1540 refuted. 0 times theorem prover too weak. 4498 trivial. 0 not checked. [2019-09-07 20:37:24,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:37:24,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:37:24,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:37:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:37:25,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:37:25,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:37:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7695 backedges. 5030 proven. 2 refuted. 0 times theorem prover too weak. 2663 trivial. 0 not checked. [2019-09-07 20:37:26,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:37:26,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-07 20:37:26,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:37:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:37:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:37:26,669 INFO L87 Difference]: Start difference. First operand 57955 states and 61471 transitions. Second operand 8 states. [2019-09-07 20:37:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:37:30,060 INFO L93 Difference]: Finished difference Result 88200 states and 93427 transitions. [2019-09-07 20:37:30,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:37:30,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1917 [2019-09-07 20:37:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:37:30,064 INFO L225 Difference]: With dead ends: 88200 [2019-09-07 20:37:30,064 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:37:30,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1928 GetRequests, 1919 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:37:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:37:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:37:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:37:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:37:30,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1917 [2019-09-07 20:37:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:37:30,177 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:37:30,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:37:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:37:30,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:37:30,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:37:37,812 WARN L188 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 1175 DAG size of output: 1076 [2019-09-07 20:37:42,771 WARN L188 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 1175 DAG size of output: 1076 [2019-09-07 20:38:38,307 WARN L188 SmtUtils]: Spent 54.54 s on a formula simplification. DAG size of input: 793 DAG size of output: 177 [2019-09-07 20:39:30,667 WARN L188 SmtUtils]: Spent 52.29 s on a formula simplification. DAG size of input: 793 DAG size of output: 177 [2019-09-07 20:41:15,310 WARN L188 SmtUtils]: Spent 1.74 m on a formula simplification. DAG size of input: 1072 DAG size of output: 180 [2019-09-07 20:42:55,524 WARN L188 SmtUtils]: Spent 1.67 m on a formula simplification. DAG size of input: 1072 DAG size of output: 180 [2019-09-07 20:43:52,699 WARN L188 SmtUtils]: Spent 57.12 s on a formula simplification. DAG size of input: 793 DAG size of output: 177 [2019-09-07 20:43:52,702 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:43:52,702 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:43:52,702 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:43:52,702 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:43:52,702 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,703 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,703 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse13 (not (< 0 (+ |old(~a29~0)| 16)))) (.cse36 (+ |old(~a0~0)| 98))) (let ((.cse9 (and .cse13 (not (< 0 .cse36)))) (.cse8 (= 2 |old(~a2~0)|)) (.cse1 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse33 (= 5 |old(~a2~0)|)) (.cse27 (= 4 |old(~a2~0)|)) (.cse20 (= ~a29~0 |old(~a29~0)|)) (.cse21 (= ~a2~0 |old(~a2~0)|))) (let ((.cse30 (and .cse20 .cse21)) (.cse19 (and (or .cse1 .cse9 .cse33 .cse27) (or .cse8 .cse1 .cse33 .cse27))) (.cse22 (= ~a0~0 |old(~a0~0)|)) (.cse23 (= ~a4~0 |old(~a4~0)|)) (.cse24 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse26 (not (<= 4 |old(~a2~0)|)))) (let ((.cse11 (not (<= (+ |old(~a0~0)| 44) 0))) (.cse32 (or .cse8 .cse1 .cse33)) (.cse29 (or .cse26 .cse1 .cse27)) (.cse18 (or .cse24 .cse33 .cse27)) (.cse12 (and .cse20 (= 2 ~a2~0) .cse22 .cse23)) (.cse4 (not (<= .cse36 0))) (.cse2 (not (<= 44 |old(~a29~0)|))) (.cse17 (not (<= 3 |old(~a2~0)|))) (.cse25 (or .cse26 .cse24 .cse27)) (.cse16 (or (= 1 |old(~a2~0)|) .cse19)) (.cse15 (not .cse8)) (.cse10 (not (<= |old(~a2~0)| 2))) (.cse14 (not (<= |old(~a29~0)| 41))) (.cse28 (and .cse30 .cse22 .cse23)) (.cse7 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse31 (not .cse27)) (.cse6 (not (<= (+ |old(~a29~0)| 18) 0))) (.cse3 (forall ((v_~a0~0_835 Int)) (let ((.cse35 (* 9 v_~a0~0_835))) (or (not (<= |old(~a0~0)| v_~a0~0_835)) (not (< 0 (+ v_~a0~0_835 61))) (not (= 0 (mod .cse35 10))) (not (<= (div .cse35 10) (+ |old(~a0~0)| 595384))))))) (.cse5 (not (<= 0 (+ |old(~a4~0)| 83)))) (.cse0 (and .cse20 .cse21 .cse22 .cse23))) (and (or .cse0 .cse1 (not (<= (+ |old(~a29~0)| 431100) 0))) (or .cse0 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse7 (or .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse13 .cse7 .cse14 .cse15 .cse4) (or (or .cse16 .cse14 .cse17) .cse0) (or .cse7 .cse18 .cse0 .cse14 .cse17) (or .cse19 (and .cse20 (and .cse21 .cse22 .cse23)) .cse11) (or .cse7 .cse12 (or .cse15 .cse24)) (or .cse2 .cse0 .cse25 .cse3) (or .cse7 (or .cse26 .cse13 .cse27 .cse4) .cse28) (or (or .cse29 .cse14) .cse0) (or .cse29 .cse0 .cse4) (or .cse8 (not (<= 0 (+ |old(~a0~0)| 146))) .cse10 .cse7 .cse0 .cse4) (or (and .cse30 .cse23) (or .cse31 .cse32)) (or .cse31 .cse32 .cse22) (or (not (<= 0 (+ |old(~a0~0)| 60))) .cse2 .cse29 .cse0) (or .cse0 .cse18 .cse14 .cse3 .cse17) (or .cse26 .cse6 .cse7 .cse0 .cse27 .cse4) (or .cse28 (or .cse33 .cse17 .cse27 .cse4 .cse5)) (or .cse2 .cse7 .cse12 .cse15 .cse4) (or .cse16 .cse2 .cse0 .cse17) (or .cse7 .cse0 .cse25) (or (and (or .cse16 .cse15) (or (or .cse1 .cse9) (not (<= (+ |old(~a29~0)| 144) 0)))) (and (and (and .cse21 .cse20) .cse22) .cse23)) (or (or .cse8 .cse9 .cse10 .cse5) (and (forall ((v_~a0~0_835 Int)) (let ((.cse34 (* 9 v_~a0~0_835))) (or (not (<= |old(~a0~0)| v_~a0~0_835)) (not (<= 0 .cse34)) (not (< 0 (+ v_~a0~0_835 61))) (not (<= (div .cse34 10) (+ |old(~a0~0)| 595384)))))) .cse3) .cse14 .cse28) (or .cse1 .cse24 (and .cse20 .cse21 (<= (+ ~a0~0 147) 0) .cse23)) (or (and (and .cse20 (= 4 ~a2~0)) .cse22 .cse23) .cse7 (or .cse31 .cse24) .cse3) (or .cse24 .cse6 .cse3 .cse5 .cse0)))))) [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:43:52,704 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,705 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:43:52,706 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,707 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,708 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,709 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,710 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:43:52,711 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,712 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:43:52,713 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,714 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:43:52,715 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,716 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,717 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:43:52,718 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:43:52,719 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:43:52,719 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:43:52,719 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,719 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse13 (not (< 0 (+ |old(~a29~0)| 16)))) (.cse36 (+ |old(~a0~0)| 98))) (let ((.cse9 (and .cse13 (not (< 0 .cse36)))) (.cse8 (= 2 |old(~a2~0)|)) (.cse1 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse33 (= 5 |old(~a2~0)|)) (.cse27 (= 4 |old(~a2~0)|)) (.cse20 (= ~a29~0 |old(~a29~0)|)) (.cse21 (= ~a2~0 |old(~a2~0)|))) (let ((.cse30 (and .cse20 .cse21)) (.cse19 (and (or .cse1 .cse9 .cse33 .cse27) (or .cse8 .cse1 .cse33 .cse27))) (.cse22 (= ~a0~0 |old(~a0~0)|)) (.cse23 (= ~a4~0 |old(~a4~0)|)) (.cse24 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse26 (not (<= 4 |old(~a2~0)|)))) (let ((.cse11 (not (<= (+ |old(~a0~0)| 44) 0))) (.cse32 (or .cse8 .cse1 .cse33)) (.cse29 (or .cse26 .cse1 .cse27)) (.cse18 (or .cse24 .cse33 .cse27)) (.cse12 (and .cse20 (= 2 ~a2~0) .cse22 .cse23)) (.cse4 (not (<= .cse36 0))) (.cse2 (not (<= 44 |old(~a29~0)|))) (.cse17 (not (<= 3 |old(~a2~0)|))) (.cse25 (or .cse26 .cse24 .cse27)) (.cse16 (or (= 1 |old(~a2~0)|) .cse19)) (.cse15 (not .cse8)) (.cse10 (not (<= |old(~a2~0)| 2))) (.cse14 (not (<= |old(~a29~0)| 41))) (.cse28 (and .cse30 .cse22 .cse23)) (.cse7 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse31 (not .cse27)) (.cse6 (not (<= (+ |old(~a29~0)| 18) 0))) (.cse3 (forall ((v_~a0~0_835 Int)) (let ((.cse35 (* 9 v_~a0~0_835))) (or (not (<= |old(~a0~0)| v_~a0~0_835)) (not (< 0 (+ v_~a0~0_835 61))) (not (= 0 (mod .cse35 10))) (not (<= (div .cse35 10) (+ |old(~a0~0)| 595384))))))) (.cse5 (not (<= 0 (+ |old(~a4~0)| 83)))) (.cse0 (and .cse20 .cse21 .cse22 .cse23))) (and (or .cse0 .cse1 (not (<= (+ |old(~a29~0)| 431100) 0))) (or .cse0 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse7 (or .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse13 .cse7 .cse14 .cse15 .cse4) (or (or .cse16 .cse14 .cse17) .cse0) (or .cse7 .cse18 .cse0 .cse14 .cse17) (or .cse19 (and .cse20 (and .cse21 .cse22 .cse23)) .cse11) (or .cse7 .cse12 (or .cse15 .cse24)) (or .cse2 .cse0 .cse25 .cse3) (or .cse7 (or .cse26 .cse13 .cse27 .cse4) .cse28) (or (or .cse29 .cse14) .cse0) (or .cse29 .cse0 .cse4) (or .cse8 (not (<= 0 (+ |old(~a0~0)| 146))) .cse10 .cse7 .cse0 .cse4) (or (and .cse30 .cse23) (or .cse31 .cse32)) (or .cse31 .cse32 .cse22) (or (not (<= 0 (+ |old(~a0~0)| 60))) .cse2 .cse29 .cse0) (or .cse0 .cse18 .cse14 .cse3 .cse17) (or .cse26 .cse6 .cse7 .cse0 .cse27 .cse4) (or .cse28 (or .cse33 .cse17 .cse27 .cse4 .cse5)) (or .cse2 .cse7 .cse12 .cse15 .cse4) (or .cse16 .cse2 .cse0 .cse17) (or .cse7 .cse0 .cse25) (or (and (or .cse16 .cse15) (or (or .cse1 .cse9) (not (<= (+ |old(~a29~0)| 144) 0)))) (and (and (and .cse21 .cse20) .cse22) .cse23)) (or (or .cse8 .cse9 .cse10 .cse5) (and (forall ((v_~a0~0_835 Int)) (let ((.cse34 (* 9 v_~a0~0_835))) (or (not (<= |old(~a0~0)| v_~a0~0_835)) (not (<= 0 .cse34)) (not (< 0 (+ v_~a0~0_835 61))) (not (<= (div .cse34 10) (+ |old(~a0~0)| 595384)))))) .cse3) .cse14 .cse28) (or .cse1 .cse24 (and .cse20 .cse21 (<= (+ ~a0~0 147) 0) .cse23)) (or (and (and .cse20 (= 4 ~a2~0)) .cse22 .cse23) .cse7 (or .cse31 .cse24) .cse3) (or .cse24 .cse6 .cse3 .cse5 .cse0)))))) [2019-09-07 20:43:52,719 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,719 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,719 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:43:52,720 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,721 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,722 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:43:52,723 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,724 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,725 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,725 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,725 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,725 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,725 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse13 (not (< 0 (+ |old(~a29~0)| 16)))) (.cse36 (+ |old(~a0~0)| 98))) (let ((.cse9 (and .cse13 (not (< 0 .cse36)))) (.cse8 (= 2 |old(~a2~0)|)) (.cse1 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse33 (= 5 |old(~a2~0)|)) (.cse27 (= 4 |old(~a2~0)|)) (.cse20 (= ~a29~0 |old(~a29~0)|)) (.cse21 (= ~a2~0 |old(~a2~0)|))) (let ((.cse30 (and .cse20 .cse21)) (.cse19 (and (or .cse1 .cse9 .cse33 .cse27) (or .cse8 .cse1 .cse33 .cse27))) (.cse22 (= ~a0~0 |old(~a0~0)|)) (.cse23 (= ~a4~0 |old(~a4~0)|)) (.cse24 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse26 (not (<= 4 |old(~a2~0)|)))) (let ((.cse11 (not (<= (+ |old(~a0~0)| 44) 0))) (.cse32 (or .cse8 .cse1 .cse33)) (.cse29 (or .cse26 .cse1 .cse27)) (.cse18 (or .cse24 .cse33 .cse27)) (.cse12 (and .cse20 (= 2 ~a2~0) .cse22 .cse23)) (.cse4 (not (<= .cse36 0))) (.cse2 (not (<= 44 |old(~a29~0)|))) (.cse17 (not (<= 3 |old(~a2~0)|))) (.cse25 (or .cse26 .cse24 .cse27)) (.cse16 (or (= 1 |old(~a2~0)|) .cse19)) (.cse15 (not .cse8)) (.cse10 (not (<= |old(~a2~0)| 2))) (.cse14 (not (<= |old(~a29~0)| 41))) (.cse28 (and .cse30 .cse22 .cse23)) (.cse7 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse31 (not .cse27)) (.cse6 (not (<= (+ |old(~a29~0)| 18) 0))) (.cse3 (forall ((v_~a0~0_835 Int)) (let ((.cse35 (* 9 v_~a0~0_835))) (or (not (<= |old(~a0~0)| v_~a0~0_835)) (not (< 0 (+ v_~a0~0_835 61))) (not (= 0 (mod .cse35 10))) (not (<= (div .cse35 10) (+ |old(~a0~0)| 595384))))))) (.cse5 (not (<= 0 (+ |old(~a4~0)| 83)))) (.cse0 (and .cse20 .cse21 .cse22 .cse23))) (and (or .cse0 .cse1 (not (<= (+ |old(~a29~0)| 431100) 0))) (or .cse0 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse7 (or .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse13 .cse7 .cse14 .cse15 .cse4) (or (or .cse16 .cse14 .cse17) .cse0) (or .cse7 .cse18 .cse0 .cse14 .cse17) (or .cse19 (and .cse20 (and .cse21 .cse22 .cse23)) .cse11) (or .cse7 .cse12 (or .cse15 .cse24)) (or .cse2 .cse0 .cse25 .cse3) (or .cse7 (or .cse26 .cse13 .cse27 .cse4) .cse28) (or (or .cse29 .cse14) .cse0) (or .cse29 .cse0 .cse4) (or .cse8 (not (<= 0 (+ |old(~a0~0)| 146))) .cse10 .cse7 .cse0 .cse4) (or (and .cse30 .cse23) (or .cse31 .cse32)) (or .cse31 .cse32 .cse22) (or (not (<= 0 (+ |old(~a0~0)| 60))) .cse2 .cse29 .cse0) (or .cse0 .cse18 .cse14 .cse3 .cse17) (or .cse26 .cse6 .cse7 .cse0 .cse27 .cse4) (or .cse28 (or .cse33 .cse17 .cse27 .cse4 .cse5)) (or .cse2 .cse7 .cse12 .cse15 .cse4) (or .cse16 .cse2 .cse0 .cse17) (or .cse7 .cse0 .cse25) (or (and (or .cse16 .cse15) (or (or .cse1 .cse9) (not (<= (+ |old(~a29~0)| 144) 0)))) (and (and (and .cse21 .cse20) .cse22) .cse23)) (or (or .cse8 .cse9 .cse10 .cse5) (and (forall ((v_~a0~0_835 Int)) (let ((.cse34 (* 9 v_~a0~0_835))) (or (not (<= |old(~a0~0)| v_~a0~0_835)) (not (<= 0 .cse34)) (not (< 0 (+ v_~a0~0_835 61))) (not (<= (div .cse34 10) (+ |old(~a0~0)| 595384)))))) .cse3) .cse14 .cse28) (or .cse1 .cse24 (and .cse20 .cse21 (<= (+ ~a0~0 147) 0) .cse23)) (or (and (and .cse20 (= 4 ~a2~0)) .cse22 .cse23) .cse7 (or .cse31 .cse24) .cse3) (or .cse24 .cse6 .cse3 .cse5 .cse0)))))) [2019-09-07 20:43:52,725 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-09-07 20:43:52,725 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,726 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,727 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,727 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,727 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:43:52,727 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:43:52,727 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,727 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,727 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-07 20:43:52,727 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,728 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,729 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,730 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,731 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:43:52,732 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,733 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:43:52,734 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,735 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,736 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,737 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:43:52,738 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,739 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,740 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:43:52,741 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a4~0 89) 0) (< 0 (+ ~a0~0 61)) (<= (+ ~a0~0 44) 0) (<= ~a2~0 1) (= (+ ~a29~0 127) 0)) [2019-09-07 20:43:52,742 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:43:52,742 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:43:52,742 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(~a0~0)| 44) 0)) (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:43:52,742 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:43:52,742 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse15 (not (= 5 ~a2~0))) (.cse0 (<= (+ ~a4~0 89) 0)) (.cse5 (not (= ~a2~0 2))) (.cse32 (< 0 (+ ~a29~0 16))) (.cse31 (+ ~a0~0 98))) (let ((.cse18 (or .cse32 (< 0 .cse31))) (.cse16 (not (= ~a2~0 4))) (.cse27 (and .cse15 .cse0 .cse5))) (let ((.cse1 (= 1 |old(~a2~0)|)) (.cse23 (or (and .cse15 .cse0 .cse16 .cse18) (and .cse16 .cse27))) (.cse29 (<= 0 (+ |old(~a0~0)| 97)))) (let ((.cse14 (<= ~a29~0 41)) (.cse2 (<= (+ ~a0~0 147) 0)) (.cse28 (and (and .cse1 .cse23 (not (= 1 ~a2~0))) .cse29)) (.cse17 (<= 3 ~a2~0)) (.cse22 (<= 4 ~a2~0))) (let ((.cse13 (and .cse0 .cse1 .cse22)) (.cse19 (<= (+ ~a0~0 44) 0)) (.cse6 (<= ~a2~0 2)) (.cse12 (= 4 ~a2~0)) (.cse24 (and .cse28 .cse17)) (.cse26 (and .cse14 (and (and .cse2 (and .cse15 .cse16 .cse1)) .cse17))) (.cse21 (or (<= 1001181 (+ ~a29~0 ~a0~0)) .cse32)) (.cse20 (<= 0 (+ ~a0~0 146))) (.cse3 (<= 0 (+ ~a4~0 83))) (.cse8 (<= 0 (+ ~a4~0 85))) (.cse9 (<= .cse31 0)) (.cse4 (<= (+ ~a29~0 18) 0)) (.cse10 (= 2 ~a2~0)) (.cse11 (<= 44 ~a29~0)) (.cse7 (exists ((v_prenex_4 Int)) (let ((.cse30 (* 9 v_prenex_4))) (and (<= 0 (+ v_prenex_4 60)) (< 0 (+ v_prenex_4 61)) (= 0 (mod .cse30 10)) (<= (div .cse30 10) (+ ~a0~0 595384)))))) (.cse25 (and .cse16 .cse1 .cse22 .cse2 .cse29))) (or (and .cse0 .cse1 .cse2) (not (<= (+ |old(~a0~0)| 44) 0)) (and .cse3 .cse1 .cse4 .cse5 .cse6 .cse7) (not (<= |old(~a2~0)| 1)) (and .cse8 (and .cse9 .cse1 .cse10 .cse11)) (and (and (and .cse1 .cse2 .cse12) .cse7) .cse8) (and .cse0 .cse1 (<= (+ ~a29~0 431100) 0)) (and .cse9 .cse13) (and .cse14 .cse13) (and .cse11 .cse7 (and .cse3 .cse1 .cse2)) (and .cse9 (and .cse3 .cse15 .cse16 .cse1) .cse17) (and (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0)) (and .cse8 (and (and .cse4 (and (and .cse5 .cse1 .cse18) .cse6)) .cse19)) (and .cse8 (and .cse20 (and .cse21 .cse9 .cse16 .cse1 .cse22))) (and .cse11 (< 0 (+ ~a0~0 61)) .cse13) (and (and (and .cse3 .cse5 .cse1 .cse6 .cse18) .cse14) .cse7) (not (= 0 (+ |old(~a29~0)| 127))) (and (and .cse1 .cse23) .cse19) (and .cse14 .cse24) (and .cse8 (and .cse25 (<= ~a29~0 43))) (and .cse8 (and .cse1 .cse2 .cse10)) (and .cse26 .cse8) (and .cse8 (and .cse20 (and .cse5 .cse9 .cse1 .cse6))) (and .cse1 .cse12 .cse27) (and .cse11 .cse24) (and .cse7 .cse26) (and .cse8 .cse9 .cse14 .cse1 .cse10 .cse21) (and .cse11 .cse20 (and .cse3 .cse9 .cse1)) (not (<= 0 (+ |old(~a0~0)| 60))) (and .cse8 .cse9 .cse16 .cse1 .cse4 .cse22) (or (and .cse28 .cse10) (and (and .cse1 (and .cse0 .cse18)) (<= (+ ~a29~0 144) 0))) (and .cse11 .cse7 .cse25) (not (<= (+ |old(~a4~0)| 89) 0)))))))) [2019-09-07 20:43:52,742 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-09-07 20:43:52,742 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-09-07 20:43:52,743 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse15 (not (= 5 ~a2~0))) (.cse0 (<= (+ ~a4~0 89) 0)) (.cse5 (not (= ~a2~0 2))) (.cse32 (< 0 (+ ~a29~0 16))) (.cse31 (+ ~a0~0 98))) (let ((.cse18 (or .cse32 (< 0 .cse31))) (.cse16 (not (= ~a2~0 4))) (.cse27 (and .cse15 .cse0 .cse5))) (let ((.cse1 (= 1 |old(~a2~0)|)) (.cse23 (or (and .cse15 .cse0 .cse16 .cse18) (and .cse16 .cse27))) (.cse29 (<= 0 (+ |old(~a0~0)| 97)))) (let ((.cse14 (<= ~a29~0 41)) (.cse2 (<= (+ ~a0~0 147) 0)) (.cse28 (and (and .cse1 .cse23 (not (= 1 ~a2~0))) .cse29)) (.cse17 (<= 3 ~a2~0)) (.cse22 (<= 4 ~a2~0))) (let ((.cse13 (and .cse0 .cse1 .cse22)) (.cse19 (<= (+ ~a0~0 44) 0)) (.cse6 (<= ~a2~0 2)) (.cse12 (= 4 ~a2~0)) (.cse24 (and .cse28 .cse17)) (.cse26 (and .cse14 (and (and .cse2 (and .cse15 .cse16 .cse1)) .cse17))) (.cse21 (or (<= 1001181 (+ ~a29~0 ~a0~0)) .cse32)) (.cse20 (<= 0 (+ ~a0~0 146))) (.cse3 (<= 0 (+ ~a4~0 83))) (.cse8 (<= 0 (+ ~a4~0 85))) (.cse9 (<= .cse31 0)) (.cse4 (<= (+ ~a29~0 18) 0)) (.cse10 (= 2 ~a2~0)) (.cse11 (<= 44 ~a29~0)) (.cse7 (exists ((v_prenex_4 Int)) (let ((.cse30 (* 9 v_prenex_4))) (and (<= 0 (+ v_prenex_4 60)) (< 0 (+ v_prenex_4 61)) (= 0 (mod .cse30 10)) (<= (div .cse30 10) (+ ~a0~0 595384)))))) (.cse25 (and .cse16 .cse1 .cse22 .cse2 .cse29))) (or (and .cse0 .cse1 .cse2) (not (<= (+ |old(~a0~0)| 44) 0)) (and .cse3 .cse1 .cse4 .cse5 .cse6 .cse7) (not (<= |old(~a2~0)| 1)) (and .cse8 (and .cse9 .cse1 .cse10 .cse11)) (and (and (and .cse1 .cse2 .cse12) .cse7) .cse8) (and .cse0 .cse1 (<= (+ ~a29~0 431100) 0)) (and .cse9 .cse13) (and .cse14 .cse13) (and .cse11 .cse7 (and .cse3 .cse1 .cse2)) (and .cse9 (and .cse3 .cse15 .cse16 .cse1) .cse17) (and (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0)) (and .cse8 (and (and .cse4 (and (and .cse5 .cse1 .cse18) .cse6)) .cse19)) (and .cse8 (and .cse20 (and .cse21 .cse9 .cse16 .cse1 .cse22))) (and .cse11 (< 0 (+ ~a0~0 61)) .cse13) (and (and (and .cse3 .cse5 .cse1 .cse6 .cse18) .cse14) .cse7) (not (= 0 (+ |old(~a29~0)| 127))) (and (and .cse1 .cse23) .cse19) (and .cse14 .cse24) (and .cse8 (and .cse25 (<= ~a29~0 43))) (and .cse8 (and .cse1 .cse2 .cse10)) (and .cse26 .cse8) (and .cse8 (and .cse20 (and .cse5 .cse9 .cse1 .cse6))) (and .cse1 .cse12 .cse27) (and .cse11 .cse24) (and .cse7 .cse26) (and .cse8 .cse9 .cse14 .cse1 .cse10 .cse21) (and .cse11 .cse20 (and .cse3 .cse9 .cse1)) (not (<= 0 (+ |old(~a0~0)| 60))) (and .cse8 .cse9 .cse16 .cse1 .cse4 .cse22) (or (and .cse28 .cse10) (and (and .cse1 (and .cse0 .cse18)) (<= (+ ~a29~0 144) 0))) (and .cse11 .cse7 .cse25) (not (<= (+ |old(~a4~0)| 89) 0)))))))) [2019-09-07 20:43:52,743 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:43:52,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:43:52 BoogieIcfgContainer [2019-09-07 20:43:52,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:43:52,810 INFO L168 Benchmark]: Toolchain (without parser) took 775775.61 ms. Allocated memory was 133.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 84.2 MB in the beginning and 586.3 MB in the end (delta: -502.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 20:43:52,811 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.4 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:43:52,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1490.53 ms. Allocated memory was 133.2 MB in the beginning and 202.9 MB in the end (delta: 69.7 MB). Free memory was 83.8 MB in the beginning and 103.1 MB in the end (delta: -19.3 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-09-07 20:43:52,813 INFO L168 Benchmark]: Boogie Preprocessor took 232.81 ms. Allocated memory is still 202.9 MB. Free memory was 103.1 MB in the beginning and 90.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-09-07 20:43:52,814 INFO L168 Benchmark]: RCFGBuilder took 3288.75 ms. Allocated memory was 202.9 MB in the beginning and 276.3 MB in the end (delta: 73.4 MB). Free memory was 90.5 MB in the beginning and 84.1 MB in the end (delta: 6.4 MB). Peak memory consumption was 79.8 MB. Max. memory is 7.1 GB. [2019-09-07 20:43:52,817 INFO L168 Benchmark]: TraceAbstraction took 770757.91 ms. Allocated memory was 276.3 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 84.1 MB in the beginning and 586.3 MB in the end (delta: -502.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-07 20:43:52,826 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.17 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1490.53 ms. Allocated memory was 133.2 MB in the beginning and 202.9 MB in the end (delta: 69.7 MB). Free memory was 83.8 MB in the beginning and 103.1 MB in the end (delta: -19.3 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 232.81 ms. Allocated memory is still 202.9 MB. Free memory was 103.1 MB in the beginning and 90.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3288.75 ms. Allocated memory was 202.9 MB in the beginning and 276.3 MB in the end (delta: 73.4 MB). Free memory was 90.5 MB in the beginning and 84.1 MB in the end (delta: 6.4 MB). Peak memory consumption was 79.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 770757.91 ms. Allocated memory was 276.3 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 84.1 MB in the beginning and 586.3 MB in the end (delta: -502.3 MB). Peak memory consumption was 2.4 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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: 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:43:52,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-09-07 20:43:52,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((a4 + 89 <= 0 && 1 == \old(a2)) && a0 + 147 <= 0) || !(\old(a0) + 44 <= 0)) || (((((0 <= a4 + 83 && 1 == \old(a2)) && a29 + 18 <= 0) && !(a2 == 2)) && a2 <= 2) && (\exists v_prenex_4 : int :: ((0 <= v_prenex_4 + 60 && 0 < v_prenex_4 + 61) && 0 == 9 * v_prenex_4 % 10) && 9 * v_prenex_4 / 10 <= a0 + 595384))) || !(\old(a2) <= 1)) || (0 <= a4 + 85 && ((a0 + 98 <= 0 && 1 == \old(a2)) && 2 == a2) && 44 <= a29)) || ((((1 == \old(a2) && a0 + 147 <= 0) && 4 == a2) && (\exists v_prenex_4 : int :: ((0 <= v_prenex_4 + 60 && 0 < v_prenex_4 + 61) && 0 == 9 * v_prenex_4 % 10) && 9 * v_prenex_4 / 10 <= a0 + 595384)) && 0 <= a4 + 85)) || ((a4 + 89 <= 0 && 1 == \old(a2)) && a29 + 431100 <= 0)) || (a0 + 98 <= 0 && (a4 + 89 <= 0 && 1 == \old(a2)) && 4 <= a2)) || (a29 <= 41 && (a4 + 89 <= 0 && 1 == \old(a2)) && 4 <= a2)) || ((44 <= a29 && (\exists v_prenex_4 : int :: ((0 <= v_prenex_4 + 60 && 0 < v_prenex_4 + 61) && 0 == 9 * v_prenex_4 % 10) && 9 * v_prenex_4 / 10 <= a0 + 595384)) && (0 <= a4 + 83 && 1 == \old(a2)) && a0 + 147 <= 0)) || ((a0 + 98 <= 0 && ((0 <= a4 + 83 && !(5 == a2)) && !(a2 == 4)) && 1 == \old(a2)) && 3 <= a2)) || (((a2 == \old(a2) && a0 == \old(a0)) && a4 == \old(a4)) && a29 + 127 == 0)) || (0 <= a4 + 85 && (a29 + 18 <= 0 && ((!(a2 == 2) && 1 == \old(a2)) && (0 < a29 + 16 || 0 < a0 + 98)) && a2 <= 2) && a0 + 44 <= 0)) || (0 <= a4 + 85 && 0 <= a0 + 146 && ((((1001181 <= a29 + a0 || 0 < a29 + 16) && a0 + 98 <= 0) && !(a2 == 4)) && 1 == \old(a2)) && 4 <= a2)) || ((44 <= a29 && 0 < a0 + 61) && (a4 + 89 <= 0 && 1 == \old(a2)) && 4 <= a2)) || ((((((0 <= a4 + 83 && !(a2 == 2)) && 1 == \old(a2)) && a2 <= 2) && (0 < a29 + 16 || 0 < a0 + 98)) && a29 <= 41) && (\exists v_prenex_4 : int :: ((0 <= v_prenex_4 + 60 && 0 < v_prenex_4 + 61) && 0 == 9 * v_prenex_4 % 10) && 9 * v_prenex_4 / 10 <= a0 + 595384))) || !(0 == \old(a29) + 127)) || ((1 == \old(a2) && ((((!(5 == a2) && a4 + 89 <= 0) && !(a2 == 4)) && (0 < a29 + 16 || 0 < a0 + 98)) || (!(a2 == 4) && (!(5 == a2) && a4 + 89 <= 0) && !(a2 == 2)))) && a0 + 44 <= 0)) || (a29 <= 41 && (((1 == \old(a2) && ((((!(5 == a2) && a4 + 89 <= 0) && !(a2 == 4)) && (0 < a29 + 16 || 0 < a0 + 98)) || (!(a2 == 4) && (!(5 == a2) && a4 + 89 <= 0) && !(a2 == 2)))) && !(1 == a2)) && 0 <= \old(a0) + 97) && 3 <= a2)) || (0 <= a4 + 85 && ((((!(a2 == 4) && 1 == \old(a2)) && 4 <= a2) && a0 + 147 <= 0) && 0 <= \old(a0) + 97) && a29 <= 43)) || (0 <= a4 + 85 && (1 == \old(a2) && a0 + 147 <= 0) && 2 == a2)) || ((a29 <= 41 && (a0 + 147 <= 0 && (!(5 == a2) && !(a2 == 4)) && 1 == \old(a2)) && 3 <= a2) && 0 <= a4 + 85)) || (0 <= a4 + 85 && 0 <= a0 + 146 && ((!(a2 == 2) && a0 + 98 <= 0) && 1 == \old(a2)) && a2 <= 2)) || ((1 == \old(a2) && 4 == a2) && (!(5 == a2) && a4 + 89 <= 0) && !(a2 == 2))) || (44 <= a29 && (((1 == \old(a2) && ((((!(5 == a2) && a4 + 89 <= 0) && !(a2 == 4)) && (0 < a29 + 16 || 0 < a0 + 98)) || (!(a2 == 4) && (!(5 == a2) && a4 + 89 <= 0) && !(a2 == 2)))) && !(1 == a2)) && 0 <= \old(a0) + 97) && 3 <= a2)) || ((\exists v_prenex_4 : int :: ((0 <= v_prenex_4 + 60 && 0 < v_prenex_4 + 61) && 0 == 9 * v_prenex_4 % 10) && 9 * v_prenex_4 / 10 <= a0 + 595384) && a29 <= 41 && (a0 + 147 <= 0 && (!(5 == a2) && !(a2 == 4)) && 1 == \old(a2)) && 3 <= a2)) || (((((0 <= a4 + 85 && a0 + 98 <= 0) && a29 <= 41) && 1 == \old(a2)) && 2 == a2) && (1001181 <= a29 + a0 || 0 < a29 + 16))) || ((44 <= a29 && 0 <= a0 + 146) && (0 <= a4 + 83 && a0 + 98 <= 0) && 1 == \old(a2))) || !(0 <= \old(a0) + 60)) || (((((0 <= a4 + 85 && a0 + 98 <= 0) && !(a2 == 4)) && 1 == \old(a2)) && a29 + 18 <= 0) && 4 <= a2)) || ((((1 == \old(a2) && ((((!(5 == a2) && a4 + 89 <= 0) && !(a2 == 4)) && (0 < a29 + 16 || 0 < a0 + 98)) || (!(a2 == 4) && (!(5 == a2) && a4 + 89 <= 0) && !(a2 == 2)))) && !(1 == a2)) && 0 <= \old(a0) + 97) && 2 == a2) || ((1 == \old(a2) && a4 + 89 <= 0 && (0 < a29 + 16 || 0 < a0 + 98)) && a29 + 144 <= 0)) || ((44 <= a29 && (\exists v_prenex_4 : int :: ((0 <= v_prenex_4 + 60 && 0 < v_prenex_4 + 61) && 0 == 9 * v_prenex_4 % 10) && 9 * v_prenex_4 / 10 <= a0 + 595384)) && (((!(a2 == 4) && 1 == \old(a2)) && 4 <= a2) && a0 + 147 <= 0) && 0 <= \old(a0) + 97)) || !(\old(a4) + 89 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 770.5s OverallTime, 18 OverallIterations, 12 TraceHistogramMax, 344.3s AutomataDifference, 0.0s DeadEndRemovalTime, 382.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2908 SDtfs, 29682 SDslu, 3701 SDs, 0 SdLazy, 58339 SolverSat, 9269 SolverUnsat, 95 SolverUnknown, 0 SolverNotchecked, 285.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8788 GetRequests, 8546 SyntacticMatches, 12 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 48.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57955occurred in iteration=17, 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: 6.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 32365 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 3977 PreInvPairs, 4508 NumberOfFragments, 6138 HoareAnnotationTreeSize, 3977 FomulaSimplifications, 180700786 FormulaSimplificationTreeSizeReduction, 13.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 307624120 FormulaSimplificationTreeSizeReductionInter, 368.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 18891 NumberOfCodeBlocks, 18891 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 18863 ConstructedInterpolants, 44 QuantifiedInterpolants, 37391020 SizeOfPredicates, 7 NumberOfNonLiveVariables, 11196 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 30447/33514 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...