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_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:51:47,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:51:47,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:51:47,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:51:47,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:51:47,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:51:47,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:51:47,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:51:47,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:51:47,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:51:47,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:51:47,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:51:47,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:51:47,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:51:47,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:51:47,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:51:47,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:51:47,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:51:47,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:51:47,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:51:47,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:51:47,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:51:47,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:51:47,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:51:47,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:51:47,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:51:47,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:51:47,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:51:47,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:51:47,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:51:47,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:51:47,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:51:47,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:51:47,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:51:47,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:51:47,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:51:47,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:51:47,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:51:47,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:51:47,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:51:47,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:51:47,490 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:51:47,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:51:47,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:51:47,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:51:47,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:51:47,505 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:51:47,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:51:47,505 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:51:47,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:51:47,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:51:47,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:51:47,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:51:47,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:51:47,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:51:47,506 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:51:47,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:51:47,507 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:51:47,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:51:47,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:51:47,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:51:47,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:51:47,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:51:47,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:51:47,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:51:47,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:51:47,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:51:47,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:51:47,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:51:47,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:51:47,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:51:47,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:51:47,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:51:47,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:51:47,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:51:47,554 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:51:47,555 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label56.c [2019-09-07 20:51:47,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ad03534/22f262c5fcf545668973b1c49c9c313e/FLAGc35a1b5f0 [2019-09-07 20:51:48,271 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:51:48,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label56.c [2019-09-07 20:51:48,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ad03534/22f262c5fcf545668973b1c49c9c313e/FLAGc35a1b5f0 [2019-09-07 20:51:48,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ad03534/22f262c5fcf545668973b1c49c9c313e [2019-09-07 20:51:48,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:51:48,431 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:51:48,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:51:48,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:51:48,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:51:48,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:51:48" (1/1) ... [2019-09-07 20:51:48,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:48, skipping insertion in model container [2019-09-07 20:51:48,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:51:48" (1/1) ... [2019-09-07 20:51:48,446 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:51:48,531 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:51:49,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:51:49,491 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:51:49,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:51:49,786 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:51:49,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49 WrapperNode [2019-09-07 20:51:49,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:51:49,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:51:49,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:51:49,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:51:49,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (1/1) ... [2019-09-07 20:51:49,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (1/1) ... [2019-09-07 20:51:49,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (1/1) ... [2019-09-07 20:51:49,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (1/1) ... [2019-09-07 20:51:49,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (1/1) ... [2019-09-07 20:51:49,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (1/1) ... [2019-09-07 20:51:49,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (1/1) ... [2019-09-07 20:51:50,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:51:50,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:51:50,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:51:50,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:51:50,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (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:51:50,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:51:50,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:51:50,089 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:51:50,089 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:51:50,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:51:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:51:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:51:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:51:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:51:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:51:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:51:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:51:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:51:53,375 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:51:53,376 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:51:53,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:51:53 BoogieIcfgContainer [2019-09-07 20:51:53,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:51:53,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:51:53,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:51:53,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:51:53,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:51:48" (1/3) ... [2019-09-07 20:51:53,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848f72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:51:53, skipping insertion in model container [2019-09-07 20:51:53,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:51:49" (2/3) ... [2019-09-07 20:51:53,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848f72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:51:53, skipping insertion in model container [2019-09-07 20:51:53,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:51:53" (3/3) ... [2019-09-07 20:51:53,385 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label56.c [2019-09-07 20:51:53,394 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:51:53,405 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:51:53,421 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:51:53,466 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:51:53,467 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:51:53,468 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:51:53,468 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:51:53,468 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:51:53,468 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:51:53,468 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:51:53,468 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:51:53,469 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:51:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:51:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 20:51:53,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:51:53,510 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] [2019-09-07 20:51:53,512 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:51:53,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:51:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2075233339, now seen corresponding path program 1 times [2019-09-07 20:51:53,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:51:53,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:51:53,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:53,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:53,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:53,820 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:51:53,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:51:53,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:51:53,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:51:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:51:53,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:51:53,844 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:51:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:51:58,798 INFO L93 Difference]: Finished difference Result 1497 states and 2757 transitions. [2019-09-07 20:51:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:51:58,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-09-07 20:51:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:51:58,829 INFO L225 Difference]: With dead ends: 1497 [2019-09-07 20:51:58,830 INFO L226 Difference]: Without dead ends: 993 [2019-09-07 20:51:58,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:51:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-07 20:51:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 682. [2019-09-07 20:51:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 20:51:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1002 transitions. [2019-09-07 20:51:58,977 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1002 transitions. Word has length 39 [2019-09-07 20:51:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:51:58,977 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1002 transitions. [2019-09-07 20:51:58,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:51:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1002 transitions. [2019-09-07 20:51:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 20:51:58,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:51:58,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:51:58,988 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:51:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:51:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1497947422, now seen corresponding path program 1 times [2019-09-07 20:51:58,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:51:58,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:51:58,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:58,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:58,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:51:59,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:51:59,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:51:59,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:51:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:51:59,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:51:59,194 INFO L87 Difference]: Start difference. First operand 682 states and 1002 transitions. Second operand 4 states. [2019-09-07 20:52:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:03,369 INFO L93 Difference]: Finished difference Result 2602 states and 3858 transitions. [2019-09-07 20:52:03,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:52:03,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-07 20:52:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:03,381 INFO L225 Difference]: With dead ends: 2602 [2019-09-07 20:52:03,382 INFO L226 Difference]: Without dead ends: 1926 [2019-09-07 20:52:03,384 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:52:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-09-07 20:52:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2019-09-07 20:52:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-09-07 20:52:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2563 transitions. [2019-09-07 20:52:03,449 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2563 transitions. Word has length 108 [2019-09-07 20:52:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:03,451 INFO L475 AbstractCegarLoop]: Abstraction has 1924 states and 2563 transitions. [2019-09-07 20:52:03,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:52:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2563 transitions. [2019-09-07 20:52:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-07 20:52:03,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:52:03,464 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:52:03,465 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:52:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:52:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash -311064930, now seen corresponding path program 1 times [2019-09-07 20:52:03,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:52:03,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:52:03,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:03,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:03,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 67 proven. 71 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 20:52:03,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:52:03,850 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:52:03,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:03,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:52:03,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:52:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:52:04,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:52:04,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 20:52:04,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:52:04,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:52:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:52:04,180 INFO L87 Difference]: Start difference. First operand 1924 states and 2563 transitions. Second operand 11 states. [2019-09-07 20:52:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:17,231 INFO L93 Difference]: Finished difference Result 9652 states and 13500 transitions. [2019-09-07 20:52:17,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 20:52:17,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2019-09-07 20:52:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:17,275 INFO L225 Difference]: With dead ends: 9652 [2019-09-07 20:52:17,275 INFO L226 Difference]: Without dead ends: 7734 [2019-09-07 20:52:17,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=520, Invalid=2132, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 20:52:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7734 states. [2019-09-07 20:52:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7734 to 6724. [2019-09-07 20:52:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6724 states. [2019-09-07 20:52:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6724 states to 6724 states and 8367 transitions. [2019-09-07 20:52:17,522 INFO L78 Accepts]: Start accepts. Automaton has 6724 states and 8367 transitions. Word has length 213 [2019-09-07 20:52:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:17,522 INFO L475 AbstractCegarLoop]: Abstraction has 6724 states and 8367 transitions. [2019-09-07 20:52:17,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:52:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6724 states and 8367 transitions. [2019-09-07 20:52:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-07 20:52:17,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:52:17,533 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:17,533 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:52:17,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:52:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash 698078374, now seen corresponding path program 1 times [2019-09-07 20:52:17,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:52:17,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:52:17,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:17,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:17,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:52:18,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:52:18,009 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:52:18,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:18,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:52:18,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:52:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:52:18,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:52:18,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:52:18,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:52:18,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:52:18,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:52:18,261 INFO L87 Difference]: Start difference. First operand 6724 states and 8367 transitions. Second operand 9 states. [2019-09-07 20:52:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:25,097 INFO L93 Difference]: Finished difference Result 17517 states and 23776 transitions. [2019-09-07 20:52:25,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:52:25,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 398 [2019-09-07 20:52:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:25,154 INFO L225 Difference]: With dead ends: 17517 [2019-09-07 20:52:25,154 INFO L226 Difference]: Without dead ends: 11106 [2019-09-07 20:52:25,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:52:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11106 states. [2019-09-07 20:52:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11106 to 10035. [2019-09-07 20:52:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10035 states. [2019-09-07 20:52:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10035 states to 10035 states and 12406 transitions. [2019-09-07 20:52:25,477 INFO L78 Accepts]: Start accepts. Automaton has 10035 states and 12406 transitions. Word has length 398 [2019-09-07 20:52:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:25,480 INFO L475 AbstractCegarLoop]: Abstraction has 10035 states and 12406 transitions. [2019-09-07 20:52:25,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:52:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 10035 states and 12406 transitions. [2019-09-07 20:52:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-07 20:52:25,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:52:25,494 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 20:52:25,494 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:52:25,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:52:25,495 INFO L82 PathProgramCache]: Analyzing trace with hash -795297702, now seen corresponding path program 1 times [2019-09-07 20:52:25,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:52:25,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:52:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:25,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 79 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:52:25,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:52:25,941 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:52:25,963 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:52:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:26,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:52:26,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:52:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-07 20:52:26,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:52:26,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 20:52:26,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:52:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:52:26,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:52:26,197 INFO L87 Difference]: Start difference. First operand 10035 states and 12406 transitions. Second operand 7 states. [2019-09-07 20:52:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:33,542 INFO L93 Difference]: Finished difference Result 28805 states and 44058 transitions. [2019-09-07 20:52:33,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:52:33,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 404 [2019-09-07 20:52:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:33,686 INFO L225 Difference]: With dead ends: 28805 [2019-09-07 20:52:33,686 INFO L226 Difference]: Without dead ends: 19083 [2019-09-07 20:52:33,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:52:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19083 states. [2019-09-07 20:52:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19083 to 18104. [2019-09-07 20:52:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18104 states. [2019-09-07 20:52:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18104 states to 18104 states and 28138 transitions. [2019-09-07 20:52:34,407 INFO L78 Accepts]: Start accepts. Automaton has 18104 states and 28138 transitions. Word has length 404 [2019-09-07 20:52:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:34,408 INFO L475 AbstractCegarLoop]: Abstraction has 18104 states and 28138 transitions. [2019-09-07 20:52:34,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:52:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 18104 states and 28138 transitions. [2019-09-07 20:52:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-07 20:52:34,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:52:34,440 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:52:34,441 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:52:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:52:34,441 INFO L82 PathProgramCache]: Analyzing trace with hash -984298760, now seen corresponding path program 1 times [2019-09-07 20:52:34,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:52:34,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:52:34,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:34,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:34,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 20:52:34,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:52:34,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:52:34,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:52:34,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:52:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:52:34,935 INFO L87 Difference]: Start difference. First operand 18104 states and 28138 transitions. Second operand 3 states. [2019-09-07 20:52:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:37,077 INFO L93 Difference]: Finished difference Result 36233 states and 56641 transitions. [2019-09-07 20:52:37,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:52:37,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-07 20:52:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:37,190 INFO L225 Difference]: With dead ends: 36233 [2019-09-07 20:52:37,190 INFO L226 Difference]: Without dead ends: 18442 [2019-09-07 20:52:37,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:52:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18442 states. [2019-09-07 20:52:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18442 to 18103. [2019-09-07 20:52:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18103 states. [2019-09-07 20:52:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18103 states to 18103 states and 28139 transitions. [2019-09-07 20:52:39,047 INFO L78 Accepts]: Start accepts. Automaton has 18103 states and 28139 transitions. Word has length 478 [2019-09-07 20:52:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:39,051 INFO L475 AbstractCegarLoop]: Abstraction has 18103 states and 28139 transitions. [2019-09-07 20:52:39,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:52:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 18103 states and 28139 transitions. [2019-09-07 20:52:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-07 20:52:39,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:52:39,074 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:39,074 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:52:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:52:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash -118270404, now seen corresponding path program 1 times [2019-09-07 20:52:39,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:52:39,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:52:39,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:39,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:39,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:52:39,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:52:39,570 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:52:39,583 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:52:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:39,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:52:39,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:52:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-09-07 20:52:40,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:52:40,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 20:52:40,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:52:40,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:52:40,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:52:40,054 INFO L87 Difference]: Start difference. First operand 18103 states and 28139 transitions. Second operand 7 states. [2019-09-07 20:52:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:46,873 INFO L93 Difference]: Finished difference Result 57089 states and 93865 transitions. [2019-09-07 20:52:46,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:52:46,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 487 [2019-09-07 20:52:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:47,035 INFO L225 Difference]: With dead ends: 57089 [2019-09-07 20:52:47,036 INFO L226 Difference]: Without dead ends: 28791 [2019-09-07 20:52:47,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 491 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:52:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-09-07 20:52:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 26497. [2019-09-07 20:52:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26497 states. [2019-09-07 20:52:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26497 states to 26497 states and 37489 transitions. [2019-09-07 20:52:47,917 INFO L78 Accepts]: Start accepts. Automaton has 26497 states and 37489 transitions. Word has length 487 [2019-09-07 20:52:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:47,918 INFO L475 AbstractCegarLoop]: Abstraction has 26497 states and 37489 transitions. [2019-09-07 20:52:47,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:52:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26497 states and 37489 transitions. [2019-09-07 20:52:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-09-07 20:52:47,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:52:47,942 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:47,942 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:52:47,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:52:47,943 INFO L82 PathProgramCache]: Analyzing trace with hash -731231248, now seen corresponding path program 1 times [2019-09-07 20:52:47,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:52:47,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:52:47,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:47,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:47,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 20:52:48,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:52:48,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:52:48,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:52:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:52:48,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:52:48,484 INFO L87 Difference]: Start difference. First operand 26497 states and 37489 transitions. Second operand 3 states. [2019-09-07 20:52:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:50,515 INFO L93 Difference]: Finished difference Result 55337 states and 80044 transitions. [2019-09-07 20:52:50,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:52:50,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 513 [2019-09-07 20:52:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:50,716 INFO L225 Difference]: With dead ends: 55337 [2019-09-07 20:52:50,716 INFO L226 Difference]: Without dead ends: 31326 [2019-09-07 20:52:50,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:52:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31326 states. [2019-09-07 20:52:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31326 to 30343. [2019-09-07 20:52:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30343 states. [2019-09-07 20:52:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30343 states to 30343 states and 42419 transitions. [2019-09-07 20:52:52,891 INFO L78 Accepts]: Start accepts. Automaton has 30343 states and 42419 transitions. Word has length 513 [2019-09-07 20:52:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:52,892 INFO L475 AbstractCegarLoop]: Abstraction has 30343 states and 42419 transitions. [2019-09-07 20:52:52,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:52:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 30343 states and 42419 transitions. [2019-09-07 20:52:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-09-07 20:52:52,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:52:52,917 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:52,917 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:52:52,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:52:52,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1886707854, now seen corresponding path program 1 times [2019-09-07 20:52:52,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:52:52,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:52:52,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:52,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:52,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-09-07 20:52:53,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:52:53,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:52:53,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:52:53,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:52:53,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:52:53,289 INFO L87 Difference]: Start difference. First operand 30343 states and 42419 transitions. Second operand 3 states. [2019-09-07 20:52:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:52:55,250 INFO L93 Difference]: Finished difference Result 48942 states and 68715 transitions. [2019-09-07 20:52:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:52:55,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 573 [2019-09-07 20:52:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:52:55,309 INFO L225 Difference]: With dead ends: 48942 [2019-09-07 20:52:55,310 INFO L226 Difference]: Without dead ends: 17807 [2019-09-07 20:52:55,391 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:52:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17807 states. [2019-09-07 20:52:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17807 to 17805. [2019-09-07 20:52:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17805 states. [2019-09-07 20:52:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17805 states to 17805 states and 22571 transitions. [2019-09-07 20:52:55,933 INFO L78 Accepts]: Start accepts. Automaton has 17805 states and 22571 transitions. Word has length 573 [2019-09-07 20:52:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:52:55,934 INFO L475 AbstractCegarLoop]: Abstraction has 17805 states and 22571 transitions. [2019-09-07 20:52:55,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:52:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17805 states and 22571 transitions. [2019-09-07 20:52:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-09-07 20:52:55,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:52:55,987 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:52:55,987 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:52:55,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:52:55,987 INFO L82 PathProgramCache]: Analyzing trace with hash 727595466, now seen corresponding path program 1 times [2019-09-07 20:52:55,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:52:55,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:52:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:55,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:52:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 414 proven. 370 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-07 20:52:56,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:52:56,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:52:56,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:52:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:52:56,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:52:56,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:52:57,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:52:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2019-09-07 20:52:57,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:52:57,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 20:52:57,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:52:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:52:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:52:57,710 INFO L87 Difference]: Start difference. First operand 17805 states and 22571 transitions. Second operand 11 states. [2019-09-07 20:53:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:53:04,851 INFO L93 Difference]: Finished difference Result 44020 states and 53337 transitions. [2019-09-07 20:53:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 20:53:04,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 676 [2019-09-07 20:53:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:53:04,920 INFO L225 Difference]: With dead ends: 44020 [2019-09-07 20:53:04,921 INFO L226 Difference]: Without dead ends: 26528 [2019-09-07 20:53:04,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 20:53:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26528 states. [2019-09-07 20:53:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26528 to 25705. [2019-09-07 20:53:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-09-07 20:53:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 28880 transitions. [2019-09-07 20:53:05,372 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 28880 transitions. Word has length 676 [2019-09-07 20:53:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:53:05,372 INFO L475 AbstractCegarLoop]: Abstraction has 25705 states and 28880 transitions. [2019-09-07 20:53:05,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:53:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 28880 transitions. [2019-09-07 20:53:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2019-09-07 20:53:05,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:05,405 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:05,405 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:05,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:05,406 INFO L82 PathProgramCache]: Analyzing trace with hash 825430679, now seen corresponding path program 1 times [2019-09-07 20:53:05,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:05,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:05,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:05,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:05,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 233 proven. 196 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2019-09-07 20:53:06,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:53:06,276 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:53:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:06,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:53:06,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:53:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 676 proven. 2 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 20:53:06,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:53:06,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:53:06,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:53:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:53:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:53:06,753 INFO L87 Difference]: Start difference. First operand 25705 states and 28880 transitions. Second operand 9 states. [2019-09-07 20:53:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:53:10,787 INFO L93 Difference]: Finished difference Result 52929 states and 62067 transitions. [2019-09-07 20:53:10,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:53:10,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 733 [2019-09-07 20:53:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:53:10,857 INFO L225 Difference]: With dead ends: 52929 [2019-09-07 20:53:10,858 INFO L226 Difference]: Without dead ends: 27537 [2019-09-07 20:53:10,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2019-09-07 20:53:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27537 states. [2019-09-07 20:53:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27537 to 26404. [2019-09-07 20:53:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26404 states. [2019-09-07 20:53:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26404 states to 26404 states and 29678 transitions. [2019-09-07 20:53:11,497 INFO L78 Accepts]: Start accepts. Automaton has 26404 states and 29678 transitions. Word has length 733 [2019-09-07 20:53:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:53:11,501 INFO L475 AbstractCegarLoop]: Abstraction has 26404 states and 29678 transitions. [2019-09-07 20:53:11,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:53:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 26404 states and 29678 transitions. [2019-09-07 20:53:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2019-09-07 20:53:11,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:11,531 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:53:11,532 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:11,532 INFO L82 PathProgramCache]: Analyzing trace with hash -593570117, now seen corresponding path program 1 times [2019-09-07 20:53:11,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:11,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:11,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:11,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 139 proven. 793 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-07 20:53:13,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:53:13,934 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:53:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:14,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:53:14,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:53:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2019-09-07 20:53:15,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:53:15,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-07 20:53:15,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:53:15,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:53:15,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:53:15,398 INFO L87 Difference]: Start difference. First operand 26404 states and 29678 transitions. Second operand 13 states. [2019-09-07 20:53:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:53:24,731 INFO L93 Difference]: Finished difference Result 60973 states and 68907 transitions. [2019-09-07 20:53:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 20:53:24,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 861 [2019-09-07 20:53:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:53:24,805 INFO L225 Difference]: With dead ends: 60973 [2019-09-07 20:53:24,805 INFO L226 Difference]: Without dead ends: 36724 [2019-09-07 20:53:24,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 890 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 20:53:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36724 states. [2019-09-07 20:53:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36724 to 35712. [2019-09-07 20:53:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35712 states. [2019-09-07 20:53:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35712 states to 35712 states and 40167 transitions. [2019-09-07 20:53:25,460 INFO L78 Accepts]: Start accepts. Automaton has 35712 states and 40167 transitions. Word has length 861 [2019-09-07 20:53:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:53:25,461 INFO L475 AbstractCegarLoop]: Abstraction has 35712 states and 40167 transitions. [2019-09-07 20:53:25,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:53:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 35712 states and 40167 transitions. [2019-09-07 20:53:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2019-09-07 20:53:25,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:25,500 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:53:25,501 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:25,501 INFO L82 PathProgramCache]: Analyzing trace with hash -908075162, now seen corresponding path program 1 times [2019-09-07 20:53:25,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:25,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:25,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:25,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:25,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 605 proven. 31 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2019-09-07 20:53:26,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:53:26,373 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:53:26,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:26,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:53:26,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:53:26,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:26,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:53:46,762 WARN L188 SmtUtils]: Spent 17.48 s on a formula simplification. DAG size of input: 551 DAG size of output: 28 [2019-09-07 20:53:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-07 20:53:47,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:53:47,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 20:53:47,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:53:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:53:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:53:47,395 INFO L87 Difference]: Start difference. First operand 35712 states and 40167 transitions. Second operand 8 states. [2019-09-07 20:54:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:54:16,569 INFO L93 Difference]: Finished difference Result 84025 states and 94476 transitions. [2019-09-07 20:54:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 20:54:16,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 910 [2019-09-07 20:54:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:54:16,572 INFO L225 Difference]: With dead ends: 84025 [2019-09-07 20:54:16,572 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:54:16,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 941 GetRequests, 923 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:54:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:54:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:54:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:54:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:54:16,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 910 [2019-09-07 20:54:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:54:16,702 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:54:16,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:54:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:54:16,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:54:16,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:54:26,947 WARN L188 SmtUtils]: Spent 6.90 s on a formula simplification. DAG size of input: 1506 DAG size of output: 725 [2019-09-07 20:54:32,388 WARN L188 SmtUtils]: Spent 5.44 s on a formula simplification. DAG size of input: 1506 DAG size of output: 725 [2019-09-07 20:54:42,521 WARN L188 SmtUtils]: Spent 8.56 s on a formula simplification. DAG size of input: 710 DAG size of output: 178 [2019-09-07 20:54:54,318 WARN L188 SmtUtils]: Spent 11.76 s on a formula simplification. DAG size of input: 710 DAG size of output: 178 [2019-09-07 20:55:01,695 WARN L188 SmtUtils]: Spent 7.35 s on a formula simplification. DAG size of input: 644 DAG size of output: 130 [2019-09-07 20:55:09,153 WARN L188 SmtUtils]: Spent 7.45 s on a formula simplification. DAG size of input: 644 DAG size of output: 130 [2019-09-07 20:55:19,726 WARN L188 SmtUtils]: Spent 10.45 s on a formula simplification. DAG size of input: 722 DAG size of output: 189 [2019-09-07 20:55:19,730 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:55:19,730 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:55:19,730 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:55:19,731 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:55:19,731 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,731 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,731 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse26 (not (<= (+ |old(~a4~0)| 89) 0)))) (let ((.cse9 (<= ~a29~0 |old(~a29~0)|)) (.cse32 (not (<= |old(~a29~0)| 43))) (.cse33 (= ~a2~0 |old(~a2~0)|)) (.cse23 (not (= 1 |old(~a2~0)|))) (.cse0 (= ~a29~0 |old(~a29~0)|)) (.cse16 (= 2 ~a2~0)) (.cse1 (= ~a0~0 |old(~a0~0)|)) (.cse3 (= ~a4~0 |old(~a4~0)|)) (.cse15 (not (= 2 |old(~a2~0)|))) (.cse28 (not (<= 0 (+ |old(~a29~0)| 16)))) (.cse10 (or .cse26 (= 5 |old(~a2~0)|)))) (let ((.cse8 (or (not (= 4 |old(~a2~0)|)) .cse10)) (.cse21 (forall ((v_~a29~0_905 Int)) (let ((.cse34 (mod v_~a29~0_905 29))) (or (not (= .cse34 0)) (not (<= (+ .cse34 8) |old(~a29~0)|)) (not (< 43 v_~a29~0_905)))))) (.cse22 (or .cse10 .cse15 .cse28)) (.cse24 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse2 (= 3 ~a2~0)) (.cse7 (not (= 3 |old(~a2~0)|))) (.cse20 (and .cse0 .cse16 .cse1 .cse3)) (.cse27 (not (< 0 (+ |old(~a0~0)| 61)))) (.cse19 (+ |old(~a29~0)| 127)) (.cse25 (and .cse0 (= 1 ~a2~0) .cse1 .cse3)) (.cse12 (or .cse26 .cse23)) (.cse18 (not (<= 4 |old(~a2~0)|))) (.cse17 (and .cse0 .cse33 .cse1 .cse3)) (.cse4 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse5 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse13 (not (<= 0 (+ |old(~a0~0)| 600000)))) (.cse14 (or .cse32 .cse10)) (.cse6 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse11 (and .cse33 .cse9 .cse1 .cse3))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0) (or (and .cse9 .cse1 .cse3 .cse2) .cse10 .cse7) (or .cse11 .cse12) (or .cse13 (or .cse14 .cse15 (not (<= (+ |old(~a29~0)| 192406) 0))) (and .cse1 (and .cse0 .cse16 .cse3))) (or .cse17 .cse18 .cse4 .cse5 (not (<= .cse19 0)) .cse6 .cse13) (or .cse20 .cse21 .cse22) (or (and .cse1 .cse3 (= 4 ~a2~0)) .cse8) (or .cse21 (or .cse23 .cse4 .cse24) .cse25 .cse13) (or .cse10 .cse13 .cse7 .cse0) (or .cse21 .cse17 (or .cse18 .cse4 .cse24) .cse13) (or .cse18 .cse26 .cse11 .cse6) (or .cse20 .cse22 .cse13) (or .cse4 .cse24 .cse20 .cse5 .cse15 .cse13) (or .cse18 .cse26 .cse17 .cse27 .cse28) (or (forall ((v_~a29~0_906 Int)) (let ((.cse31 (* 9 v_~a29~0_906))) (let ((.cse29 (div .cse31 10))) (let ((.cse30 (div .cse29 5))) (or (not (= (mod (div (+ .cse29 1) 5) 29) 0)) (not (< 43 v_~a29~0_906)) (not (<= (mod .cse30 29) (+ |old(~a29~0)| 13))) (not (<= 0 .cse29)) (not (<= 0 .cse30)) (not (<= 0 .cse31)) (not (<= 0 (+ .cse30 1)))))))) .cse4 .cse20 .cse5 .cse15 .cse6 .cse13) (or (and .cse0 (and .cse2 .cse3) .cse1) (or (not (<= (+ (div (+ (* (- 1) |old(~a0~0)|) (- 30500)) (- 25)) 98) 0)) .cse4 .cse32 .cse7)) (or .cse23 .cse4 .cse32 .cse5 .cse13 .cse17) (or .cse20 .cse14 .cse15 .cse27) (or .cse18 .cse4 .cse17 .cse32 .cse5 (not (<= 0 .cse19)) .cse6) (or .cse25 .cse12 .cse13) (or .cse18 .cse17 .cse4 (not (<= 54229 |old(~a29~0)|)) .cse5 .cse6 .cse13) (or .cse17 .cse23 .cse4 .cse5 .cse6 .cse13) (or .cse14 .cse6 .cse11))))) [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:55:19,732 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-09-07 20:55:19,733 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:55:19,734 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,735 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 106) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,736 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,737 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,738 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,739 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,740 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,741 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,742 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:55:19,743 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,744 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,745 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,746 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:55:19,747 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,748 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,748 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,748 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:55:19,748 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:55:19,748 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:55:19,748 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:55:19,748 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,749 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse26 (not (<= (+ |old(~a4~0)| 89) 0)))) (let ((.cse9 (<= ~a29~0 |old(~a29~0)|)) (.cse32 (not (<= |old(~a29~0)| 43))) (.cse33 (= ~a2~0 |old(~a2~0)|)) (.cse23 (not (= 1 |old(~a2~0)|))) (.cse0 (= ~a29~0 |old(~a29~0)|)) (.cse16 (= 2 ~a2~0)) (.cse1 (= ~a0~0 |old(~a0~0)|)) (.cse3 (= ~a4~0 |old(~a4~0)|)) (.cse15 (not (= 2 |old(~a2~0)|))) (.cse28 (not (<= 0 (+ |old(~a29~0)| 16)))) (.cse10 (or .cse26 (= 5 |old(~a2~0)|)))) (let ((.cse8 (or (not (= 4 |old(~a2~0)|)) .cse10)) (.cse21 (forall ((v_~a29~0_905 Int)) (let ((.cse34 (mod v_~a29~0_905 29))) (or (not (= .cse34 0)) (not (<= (+ .cse34 8) |old(~a29~0)|)) (not (< 43 v_~a29~0_905)))))) (.cse22 (or .cse10 .cse15 .cse28)) (.cse24 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse2 (= 3 ~a2~0)) (.cse7 (not (= 3 |old(~a2~0)|))) (.cse20 (and .cse0 .cse16 .cse1 .cse3)) (.cse27 (not (< 0 (+ |old(~a0~0)| 61)))) (.cse19 (+ |old(~a29~0)| 127)) (.cse25 (and .cse0 (= 1 ~a2~0) .cse1 .cse3)) (.cse12 (or .cse26 .cse23)) (.cse18 (not (<= 4 |old(~a2~0)|))) (.cse17 (and .cse0 .cse33 .cse1 .cse3)) (.cse4 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse5 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse13 (not (<= 0 (+ |old(~a0~0)| 600000)))) (.cse14 (or .cse32 .cse10)) (.cse6 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse11 (and .cse33 .cse9 .cse1 .cse3))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0) (or (and .cse9 .cse1 .cse3 .cse2) .cse10 .cse7) (or .cse11 .cse12) (or .cse13 (or .cse14 .cse15 (not (<= (+ |old(~a29~0)| 192406) 0))) (and .cse1 (and .cse0 .cse16 .cse3))) (or .cse17 .cse18 .cse4 .cse5 (not (<= .cse19 0)) .cse6 .cse13) (or .cse20 .cse21 .cse22) (or (and .cse1 .cse3 (= 4 ~a2~0)) .cse8) (or .cse21 (or .cse23 .cse4 .cse24) .cse25 .cse13) (or .cse10 .cse13 .cse7 .cse0) (or .cse21 .cse17 (or .cse18 .cse4 .cse24) .cse13) (or .cse18 .cse26 .cse11 .cse6) (or .cse20 .cse22 .cse13) (or .cse4 .cse24 .cse20 .cse5 .cse15 .cse13) (or .cse18 .cse26 .cse17 .cse27 .cse28) (or (forall ((v_~a29~0_906 Int)) (let ((.cse31 (* 9 v_~a29~0_906))) (let ((.cse29 (div .cse31 10))) (let ((.cse30 (div .cse29 5))) (or (not (= (mod (div (+ .cse29 1) 5) 29) 0)) (not (< 43 v_~a29~0_906)) (not (<= (mod .cse30 29) (+ |old(~a29~0)| 13))) (not (<= 0 .cse29)) (not (<= 0 .cse30)) (not (<= 0 .cse31)) (not (<= 0 (+ .cse30 1)))))))) .cse4 .cse20 .cse5 .cse15 .cse6 .cse13) (or (and .cse0 (and .cse2 .cse3) .cse1) (or (not (<= (+ (div (+ (* (- 1) |old(~a0~0)|) (- 30500)) (- 25)) 98) 0)) .cse4 .cse32 .cse7)) (or .cse23 .cse4 .cse32 .cse5 .cse13 .cse17) (or .cse20 .cse14 .cse15 .cse27) (or .cse18 .cse4 .cse17 .cse32 .cse5 (not (<= 0 .cse19)) .cse6) (or .cse25 .cse12 .cse13) (or .cse18 .cse17 .cse4 (not (<= 54229 |old(~a29~0)|)) .cse5 .cse6 .cse13) (or .cse17 .cse23 .cse4 .cse5 .cse6 .cse13) (or .cse14 .cse6 .cse11))))) [2019-09-07 20:55:19,749 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,749 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,749 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,749 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,749 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,749 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,749 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,750 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,751 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,752 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,753 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,754 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,755 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,756 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse26 (not (<= (+ |old(~a4~0)| 89) 0)))) (let ((.cse6 (<= ~a29~0 |old(~a29~0)|)) (.cse19 (not (<= |old(~a29~0)| 43))) (.cse34 (= ~a2~0 |old(~a2~0)|)) (.cse15 (not (= 1 |old(~a2~0)|))) (.cse4 (= ~a29~0 |old(~a29~0)|)) (.cse23 (= 2 ~a2~0)) (.cse7 (= ~a0~0 |old(~a0~0)|)) (.cse8 (= ~a4~0 |old(~a4~0)|)) (.cse10 (or .cse26 (= 5 |old(~a2~0)|))) (.cse22 (not (= 2 |old(~a2~0)|))) (.cse33 (not (<= 0 (+ |old(~a29~0)| 16))))) (let ((.cse2 (or .cse10 .cse22 .cse33)) (.cse0 (and .cse4 .cse23 .cse7 (and (<= (+ ~a4~0 89) 0) .cse8))) (.cse9 (= 3 ~a2~0)) (.cse11 (not (= 3 |old(~a2~0)|))) (.cse1 (forall ((v_~a29~0_905 Int)) (let ((.cse35 (mod v_~a29~0_905 29))) (or (not (= .cse35 0)) (not (<= (+ .cse35 8) |old(~a29~0)|)) (not (< 43 v_~a29~0_905)))))) (.cse20 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse28 (and .cse4 .cse23 .cse7 .cse8)) (.cse29 (not (< 0 (+ |old(~a0~0)| 61)))) (.cse3 (or (not (= 4 |old(~a2~0)|)) .cse10)) (.cse27 (+ |old(~a29~0)| 127)) (.cse16 (and .cse4 (= 1 ~a2~0) .cse7 .cse8)) (.cse18 (or .cse26 .cse15)) (.cse25 (not (<= 4 |old(~a2~0)|))) (.cse24 (and .cse4 .cse34 .cse7 .cse8)) (.cse12 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse13 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse5 (not (<= 0 (+ |old(~a0~0)| 600000)))) (.cse21 (or .cse19 .cse10)) (.cse14 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse17 (and .cse34 .cse6 .cse7 .cse8))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4) (or .cse2 .cse0 .cse5) (or (and .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (or .cse12 .cse13 (and .cse4 .cse7 .cse9 .cse8) .cse14 .cse11) (or .cse15 .cse12 .cse13 .cse16 .cse14 .cse5) (or .cse17 .cse18) (or .cse15 .cse12 .cse19 .cse13 .cse5 .cse16) (or .cse1 (or .cse15 .cse12 .cse20) .cse16 .cse5) (or (or (not (<= (+ (div (+ (* (- 1) |old(~a0~0)|) (- 30500)) (- 25)) 98) 0)) .cse12 .cse19 .cse11) (and .cse4 (and .cse9 .cse8) .cse7)) (or .cse5 (or .cse21 .cse22 (not (<= (+ |old(~a29~0)| 192406) 0))) (and (and .cse4 .cse23 .cse8) .cse7)) (or .cse10 .cse5 .cse11 .cse4) (or .cse1 .cse24 (or .cse25 .cse12 .cse20) .cse5) (or .cse25 .cse26 .cse17 .cse14) (or .cse25 .cse12 .cse13 .cse24 (not (<= .cse27 0)) .cse14 .cse5) (or .cse12 .cse20 .cse28 .cse13 .cse22 .cse5) (or (and .cse4 (or (< 0 (+ ~a29~0 16)) (not (= calculate_output_~input 4))) .cse23 .cse7 .cse8) .cse21 .cse22 .cse29) (or (forall ((v_~a29~0_906 Int)) (let ((.cse32 (* 9 v_~a29~0_906))) (let ((.cse30 (div .cse32 10))) (let ((.cse31 (div .cse30 5))) (or (not (= (mod (div (+ .cse30 1) 5) 29) 0)) (not (< 43 v_~a29~0_906)) (not (<= (mod .cse31 29) (+ |old(~a29~0)| 13))) (not (<= 0 .cse30)) (not (<= 0 .cse31)) (not (<= 0 .cse32)) (not (<= 0 (+ .cse31 1)))))))) .cse12 .cse28 .cse13 .cse22 .cse14 .cse5) (or .cse25 .cse26 .cse24 .cse29 .cse33) (or .cse3 (and (= 4 ~a2~0) .cse7 .cse8)) (or .cse25 .cse12 .cse19 .cse13 .cse24 (not (<= 0 .cse27)) .cse14) (or .cse16 .cse18 .cse5) (or .cse25 .cse24 .cse12 (not (<= 54229 |old(~a29~0)|)) .cse13 .cse14 .cse5) (or .cse21 .cse14 .cse17))))) [2019-09-07 20:55:19,756 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-09-07 20:55:19,756 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,756 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,757 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-07 20:55:19,758 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,759 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:55:19,760 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,761 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,762 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,763 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,764 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:55:19,765 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,766 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,767 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:55:19,768 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,769 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,770 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:55:19,771 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:55:19,772 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,773 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,774 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:55:19,775 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a4~0 89) 0) (= 1 ~a2~0) (<= 0 (+ ~a0~0 44)) (= (+ ~a29~0 127) 0)) [2019-09-07 20:55:19,775 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:55:19,776 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:55:19,776 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (or (not (<= (+ |old(~a4~0)| 89) 0)) (not (= 1 |old(~a2~0)|)) (not (<= 0 (+ |old(~a0~0)| 44))) (not (= 0 (+ |old(~a29~0)| 127))) (and (= 1 ~a2~0) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0))) [2019-09-07 20:55:19,776 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:55:19,776 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse0 (<= (+ ~a4~0 89) 0)) (.cse17 (= 1 |old(~a2~0)|)) (.cse15 (<= ~a29~0 43))) (let ((.cse1 (<= 0 (+ ~a29~0 16))) (.cse3 (< 0 (+ ~a0~0 61))) (.cse13 (<= (+ ~a0~0 147) 0)) (.cse14 (exists ((v_~a29~0_905 Int)) (let ((.cse20 (mod v_~a29~0_905 29))) (and (<= (+ .cse20 8) ~a29~0) (< 43 v_~a29~0_905) (= .cse20 0))))) (.cse7 (<= 0 (+ ~a0~0 600000))) (.cse8 (= 3 ~a2~0)) (.cse9 (= 2 ~a2~0)) (.cse4 (<= 0 (+ ~a4~0 85))) (.cse6 (<= (+ ~a4~0 42) 0)) (.cse2 (<= 4 ~a2~0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse18 (and (not (= 5 ~a2~0)) .cse0 .cse17 .cse15)) (.cse16 (= 1 ~a2~0)) (.cse19 (= 4 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 (<= 54229 ~a29~0) .cse2 .cse7) (and .cse0 .cse8) (and .cse0 .cse5 .cse2) (and .cse0 .cse1 .cse9) (and .cse4 .cse5 .cse7 .cse9 (exists ((v_~a29~0_906 Int)) (let ((.cse10 (* 9 v_~a29~0_906))) (let ((.cse11 (div .cse10 10))) (let ((.cse12 (div .cse11 5))) (and (< 43 v_~a29~0_906) (<= 0 .cse10) (= (mod (div (+ .cse11 1) 5) 29) 0) (<= (mod .cse12 29) (+ ~a29~0 13)) (<= 0 (+ .cse12 1)) (<= 0 .cse11) (<= 0 .cse12)))))) .cse6) (and .cse4 .cse6 .cse13 .cse7 .cse9) (and .cse6 .cse2 .cse13 .cse7 .cse14) (and .cse6 (<= (+ (div (+ (- ~a0~0) (- 30500)) (- 25)) 98) 0) .cse15 .cse8) (and .cse4 .cse6 .cse16 .cse15 .cse7) (not .cse17) (and .cse18 .cse3 .cse9) (and .cse4 .cse5 .cse6 .cse2 .cse15 .cse7) (and (and .cse6 .cse16 .cse13 .cse14) .cse7) (and .cse4 .cse5 .cse6 .cse16 .cse7) (not (= 0 (+ |old(~a29~0)| 127))) (and .cse4 .cse5 .cse6 .cse8) (and (<= (+ ~a29~0 192406) 0) .cse18 .cse9) (and .cse4 .cse5 .cse6 (not .cse19) .cse2 .cse15 (<= 0 (+ ~a29~0 127))) (and .cse5 .cse18) (and .cse0 .cse16) (not (<= 0 (+ |old(~a0~0)| 44))) (not (<= (+ |old(~a4~0)| 89) 0)) (and .cse0 .cse19)))) [2019-09-07 20:55:19,776 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-09-07 20:55:19,777 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-09-07 20:55:19,777 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse0 (<= (+ ~a4~0 89) 0)) (.cse17 (= 1 |old(~a2~0)|)) (.cse15 (<= ~a29~0 43))) (let ((.cse1 (<= 0 (+ ~a29~0 16))) (.cse3 (< 0 (+ ~a0~0 61))) (.cse13 (<= (+ ~a0~0 147) 0)) (.cse14 (exists ((v_~a29~0_905 Int)) (let ((.cse20 (mod v_~a29~0_905 29))) (and (<= (+ .cse20 8) ~a29~0) (< 43 v_~a29~0_905) (= .cse20 0))))) (.cse7 (<= 0 (+ ~a0~0 600000))) (.cse8 (= 3 ~a2~0)) (.cse9 (= 2 ~a2~0)) (.cse4 (<= 0 (+ ~a4~0 85))) (.cse6 (<= (+ ~a4~0 42) 0)) (.cse2 (<= 4 ~a2~0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse18 (and (not (= 5 ~a2~0)) .cse0 .cse17 .cse15)) (.cse16 (= 1 ~a2~0)) (.cse19 (= 4 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 (<= 54229 ~a29~0) .cse2 .cse7) (and .cse0 .cse8) (and .cse0 .cse5 .cse2) (and .cse0 .cse1 .cse9) (and .cse4 .cse5 .cse7 .cse9 (exists ((v_~a29~0_906 Int)) (let ((.cse10 (* 9 v_~a29~0_906))) (let ((.cse11 (div .cse10 10))) (let ((.cse12 (div .cse11 5))) (and (< 43 v_~a29~0_906) (<= 0 .cse10) (= (mod (div (+ .cse11 1) 5) 29) 0) (<= (mod .cse12 29) (+ ~a29~0 13)) (<= 0 (+ .cse12 1)) (<= 0 .cse11) (<= 0 .cse12)))))) .cse6) (and .cse4 .cse6 .cse13 .cse7 .cse9) (and .cse6 .cse2 .cse13 .cse7 .cse14) (and .cse6 (<= (+ (div (+ (- ~a0~0) (- 30500)) (- 25)) 98) 0) .cse15 .cse8) (and .cse4 .cse6 .cse16 .cse15 .cse7) (not .cse17) (and .cse18 .cse3 .cse9) (and .cse4 .cse5 .cse6 .cse2 .cse15 .cse7) (and (and .cse6 .cse16 .cse13 .cse14) .cse7) (and .cse4 .cse5 .cse6 .cse16 .cse7) (not (= 0 (+ |old(~a29~0)| 127))) (and .cse4 .cse5 .cse6 .cse8) (and (<= (+ ~a29~0 192406) 0) .cse18 .cse9) (and .cse4 .cse5 .cse6 (not .cse19) .cse2 .cse15 (<= 0 (+ ~a29~0 127))) (and .cse5 .cse18) (and .cse0 .cse16) (not (<= 0 (+ |old(~a0~0)| 44))) (not (<= (+ |old(~a4~0)| 89) 0)) (and .cse0 .cse19)))) [2019-09-07 20:55:19,777 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:55:19,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:55:19 BoogieIcfgContainer [2019-09-07 20:55:19,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:55:19,813 INFO L168 Benchmark]: Toolchain (without parser) took 211381.88 ms. Allocated memory was 141.6 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 84.2 MB in the beginning and 734.1 MB in the end (delta: -650.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-09-07 20:55:19,814 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.5 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:55:19,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1356.23 ms. Allocated memory was 141.6 MB in the beginning and 226.0 MB in the end (delta: 84.4 MB). Free memory was 84.0 MB in the beginning and 147.7 MB in the end (delta: -63.8 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. [2019-09-07 20:55:19,816 INFO L168 Benchmark]: Boogie Preprocessor took 234.27 ms. Allocated memory is still 226.0 MB. Free memory was 147.7 MB in the beginning and 135.4 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-09-07 20:55:19,817 INFO L168 Benchmark]: RCFGBuilder took 3354.20 ms. Allocated memory was 226.0 MB in the beginning and 271.1 MB in the end (delta: 45.1 MB). Free memory was 135.4 MB in the beginning and 156.9 MB in the end (delta: -21.5 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. [2019-09-07 20:55:19,817 INFO L168 Benchmark]: TraceAbstraction took 206433.03 ms. Allocated memory was 271.1 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 156.9 MB in the beginning and 734.1 MB in the end (delta: -577.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-07 20:55:19,822 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.20 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1356.23 ms. Allocated memory was 141.6 MB in the beginning and 226.0 MB in the end (delta: 84.4 MB). Free memory was 84.0 MB in the beginning and 147.7 MB in the end (delta: -63.8 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 234.27 ms. Allocated memory is still 226.0 MB. Free memory was 147.7 MB in the beginning and 135.4 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3354.20 ms. Allocated memory was 226.0 MB in the beginning and 271.1 MB in the end (delta: 45.1 MB). Free memory was 135.4 MB in the beginning and 156.9 MB in the end (delta: -21.5 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206433.03 ms. Allocated memory was 271.1 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 156.9 MB in the beginning and 734.1 MB in the end (delta: -577.2 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_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 106]: 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:55:19,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_906,QUANTIFIED] [2019-09-07 20:55:19,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-09-07 20:55:19,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a4 + 89 <= 0 && 0 <= a29 + 16) && 4 <= a2) && 0 < a0 + 61) || (((((0 <= a4 + 85 && a0 + 98 <= 0) && a4 + 42 <= 0) && 54229 <= a29) && 4 <= a2) && 0 <= a0 + 600000)) || (a4 + 89 <= 0 && 3 == a2)) || ((a4 + 89 <= 0 && a0 + 98 <= 0) && 4 <= a2)) || ((a4 + 89 <= 0 && 0 <= a29 + 16) && 2 == a2)) || (((((0 <= a4 + 85 && a0 + 98 <= 0) && 0 <= a0 + 600000) && 2 == a2) && (\exists v_~a29~0_906 : int :: (((((43 < v_~a29~0_906 && 0 <= 9 * v_~a29~0_906) && (9 * v_~a29~0_906 / 10 + 1) / 5 % 29 == 0) && 9 * v_~a29~0_906 / 10 / 5 % 29 <= a29 + 13) && 0 <= 9 * v_~a29~0_906 / 10 / 5 + 1) && 0 <= 9 * v_~a29~0_906 / 10) && 0 <= 9 * v_~a29~0_906 / 10 / 5)) && a4 + 42 <= 0)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 600000) && 2 == a2)) || ((((a4 + 42 <= 0 && 4 <= a2) && a0 + 147 <= 0) && 0 <= a0 + 600000) && (\exists v_~a29~0_905 : int :: (v_~a29~0_905 % 29 + 8 <= a29 && 43 < v_~a29~0_905) && v_~a29~0_905 % 29 == 0))) || (((a4 + 42 <= 0 && (-a0 + -30500) / -25 + 98 <= 0) && a29 <= 43) && 3 == a2)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && 1 == a2) && a29 <= 43) && 0 <= a0 + 600000)) || !(1 == \old(a2))) || (((((!(5 == a2) && a4 + 89 <= 0) && 1 == \old(a2)) && a29 <= 43) && 0 < a0 + 61) && 2 == a2)) || (((((0 <= a4 + 85 && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && a29 <= 43) && 0 <= a0 + 600000)) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 147 <= 0) && (\exists v_~a29~0_905 : int :: (v_~a29~0_905 % 29 + 8 <= a29 && 43 < v_~a29~0_905) && v_~a29~0_905 % 29 == 0)) && 0 <= a0 + 600000)) || ((((0 <= a4 + 85 && a0 + 98 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 600000)) || !(0 == \old(a29) + 127)) || (((0 <= a4 + 85 && a0 + 98 <= 0) && a4 + 42 <= 0) && 3 == a2)) || ((a29 + 192406 <= 0 && ((!(5 == a2) && a4 + 89 <= 0) && 1 == \old(a2)) && a29 <= 43) && 2 == a2)) || ((((((0 <= a4 + 85 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(4 == a2)) && 4 <= a2) && a29 <= 43) && 0 <= a29 + 127)) || (a0 + 98 <= 0 && ((!(5 == a2) && a4 + 89 <= 0) && 1 == \old(a2)) && a29 <= 43)) || (a4 + 89 <= 0 && 1 == a2)) || !(0 <= \old(a0) + 44)) || !(\old(a4) + 89 <= 0)) || (a4 + 89 <= 0 && 4 == a2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 206.3s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 100.8s AutomataDifference, 0.0s DeadEndRemovalTime, 63.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2472 SDtfs, 22299 SDslu, 2974 SDs, 0 SdLazy, 49456 SolverSat, 7051 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 80.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5005 GetRequests, 4790 SyntacticMatches, 2 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35712occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 9959 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 7636 PreInvPairs, 9863 NumberOfFragments, 4158 HoareAnnotationTreeSize, 7636 FomulaSimplifications, 485014 FormulaSimplificationTreeSizeReduction, 16.9s HoareSimplificationTime, 9 FomulaSimplificationsInter, 225069 FormulaSimplificationTreeSizeReductionInter, 45.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 11075 NumberOfCodeBlocks, 11075 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 11054 ConstructedInterpolants, 70 QuantifiedInterpolants, 19063293 SizeOfPredicates, 9 NumberOfNonLiveVariables, 6554 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 10196/11746 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...