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_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:25:16,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:25:16,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:25:16,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:25:16,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:25:16,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:25:16,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:25:16,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:25:16,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:25:16,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:25:16,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:25:16,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:25:16,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:25:16,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:25:16,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:25:16,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:25:16,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:25:16,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:25:16,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:25:16,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:25:16,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:25:16,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:25:16,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:25:16,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:25:16,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:25:16,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:25:16,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:25:16,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:25:16,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:25:16,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:25:16,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:25:16,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:25:16,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:25:16,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:25:16,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:25:16,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:25:16,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:25:16,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:25:16,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:25:16,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:25:16,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:25:16,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:25:16,818 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:25:16,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:25:16,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:25:16,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:25:16,821 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:25:16,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:25:16,821 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:25:16,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:25:16,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:25:16,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:25:16,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:25:16,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:25:16,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:25:16,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:25:16,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:25:16,825 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:25:16,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:25:16,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:25:16,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:25:16,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:25:16,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:25:16,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:25:16,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:25:16,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:25:16,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:25:16,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:25:16,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:25:16,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:25:16,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:25:16,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:25:16,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:25:16,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:25:16,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:25:16,914 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:25:16,915 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label28.c [2019-10-02 01:25:16,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a5a4380/0f606f8e04964251877ae67ad28b67e1/FLAGa6c4aa7a7 [2019-10-02 01:25:17,660 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:25:17,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label28.c [2019-10-02 01:25:17,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a5a4380/0f606f8e04964251877ae67ad28b67e1/FLAGa6c4aa7a7 [2019-10-02 01:25:17,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a5a4380/0f606f8e04964251877ae67ad28b67e1 [2019-10-02 01:25:17,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:25:17,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:25:17,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:25:17,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:25:17,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:25:17,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:25:17" (1/1) ... [2019-10-02 01:25:17,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eff091d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:17, skipping insertion in model container [2019-10-02 01:25:17,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:25:17" (1/1) ... [2019-10-02 01:25:17,852 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:25:17,936 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:25:18,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:25:18,804 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:25:19,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:25:19,228 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:25:19,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19 WrapperNode [2019-10-02 01:25:19,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:25:19,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:25:19,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:25:19,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:25:19,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (1/1) ... [2019-10-02 01:25:19,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (1/1) ... [2019-10-02 01:25:19,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (1/1) ... [2019-10-02 01:25:19,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (1/1) ... [2019-10-02 01:25:19,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (1/1) ... [2019-10-02 01:25:19,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (1/1) ... [2019-10-02 01:25:19,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (1/1) ... [2019-10-02 01:25:19,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:25:19,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:25:19,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:25:19,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:25:19,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:25:19,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:25:19,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:25:19,509 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:25:19,510 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:25:19,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:25:19,510 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:25:19,510 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:25:19,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:25:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:25:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:25:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:25:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:25:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:25:22,575 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:25:22,575 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:25:22,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:25:22 BoogieIcfgContainer [2019-10-02 01:25:22,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:25:22,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:25:22,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:25:22,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:25:22,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:25:17" (1/3) ... [2019-10-02 01:25:22,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db27e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:25:22, skipping insertion in model container [2019-10-02 01:25:22,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:19" (2/3) ... [2019-10-02 01:25:22,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db27e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:25:22, skipping insertion in model container [2019-10-02 01:25:22,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:25:22" (3/3) ... [2019-10-02 01:25:22,585 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label28.c [2019-10-02 01:25:22,595 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:25:22,603 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:25:22,620 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:25:22,655 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:25:22,656 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:25:22,656 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:25:22,657 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:25:22,657 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:25:22,657 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:25:22,657 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:25:22,657 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:25:22,657 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:25:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-10-02 01:25:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 01:25:22,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:22,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:22,697 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1729511136, now seen corresponding path program 1 times [2019-10-02 01:25:22,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:22,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:22,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:22,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:22,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:22,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:25:22,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:25:22,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:25:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:25:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:25:22,999 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 3 states. [2019-10-02 01:25:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:25,773 INFO L93 Difference]: Finished difference Result 1191 states and 2149 transitions. [2019-10-02 01:25:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:25:25,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 01:25:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:25,798 INFO L225 Difference]: With dead ends: 1191 [2019-10-02 01:25:25,798 INFO L226 Difference]: Without dead ends: 692 [2019-10-02 01:25:25,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:25:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-10-02 01:25:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2019-10-02 01:25:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-10-02 01:25:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1154 transitions. [2019-10-02 01:25:25,910 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1154 transitions. Word has length 38 [2019-10-02 01:25:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:25,911 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 1154 transitions. [2019-10-02 01:25:25,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:25:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1154 transitions. [2019-10-02 01:25:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 01:25:25,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:25,917 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:25,918 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1320950948, now seen corresponding path program 1 times [2019-10-02 01:25:25,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:25,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:25,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:25,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:25,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:26,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:25:26,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:25:26,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:25:26,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:25:26,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:25:26,256 INFO L87 Difference]: Start difference. First operand 690 states and 1154 transitions. Second operand 6 states. [2019-10-02 01:25:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:30,530 INFO L93 Difference]: Finished difference Result 2057 states and 3487 transitions. [2019-10-02 01:25:30,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:25:30,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-10-02 01:25:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:30,545 INFO L225 Difference]: With dead ends: 2057 [2019-10-02 01:25:30,545 INFO L226 Difference]: Without dead ends: 1373 [2019-10-02 01:25:30,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:25:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-10-02 01:25:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1342. [2019-10-02 01:25:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-02 01:25:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2245 transitions. [2019-10-02 01:25:30,637 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2245 transitions. Word has length 111 [2019-10-02 01:25:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:30,638 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 2245 transitions. [2019-10-02 01:25:30,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:25:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2245 transitions. [2019-10-02 01:25:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 01:25:30,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:30,642 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:30,643 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1532585933, now seen corresponding path program 1 times [2019-10-02 01:25:30,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:30,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:30,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:30,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:30,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:30,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:25:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:25:30,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:25:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:25:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:25:30,831 INFO L87 Difference]: Start difference. First operand 1342 states and 2245 transitions. Second operand 5 states. [2019-10-02 01:25:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:34,606 INFO L93 Difference]: Finished difference Result 3990 states and 6801 transitions. [2019-10-02 01:25:34,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:25:34,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-10-02 01:25:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:34,626 INFO L225 Difference]: With dead ends: 3990 [2019-10-02 01:25:34,626 INFO L226 Difference]: Without dead ends: 2654 [2019-10-02 01:25:34,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:25:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-10-02 01:25:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2615. [2019-10-02 01:25:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2615 states. [2019-10-02 01:25:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 3768 transitions. [2019-10-02 01:25:34,739 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 3768 transitions. Word has length 114 [2019-10-02 01:25:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:34,749 INFO L475 AbstractCegarLoop]: Abstraction has 2615 states and 3768 transitions. [2019-10-02 01:25:34,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:25:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3768 transitions. [2019-10-02 01:25:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 01:25:34,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:34,754 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:34,759 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1482212639, now seen corresponding path program 1 times [2019-10-02 01:25:34,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:34,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:34,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:34,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:34,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:25:34,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:25:34,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:25:34,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:25:34,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:25:34,946 INFO L87 Difference]: Start difference. First operand 2615 states and 3768 transitions. Second operand 6 states. [2019-10-02 01:25:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:38,180 INFO L93 Difference]: Finished difference Result 6572 states and 9809 transitions. [2019-10-02 01:25:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:25:38,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-10-02 01:25:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:38,205 INFO L225 Difference]: With dead ends: 6572 [2019-10-02 01:25:38,205 INFO L226 Difference]: Without dead ends: 3963 [2019-10-02 01:25:38,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:25:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2019-10-02 01:25:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3910. [2019-10-02 01:25:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3910 states. [2019-10-02 01:25:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3910 states to 3910 states and 5486 transitions. [2019-10-02 01:25:38,326 INFO L78 Accepts]: Start accepts. Automaton has 3910 states and 5486 transitions. Word has length 124 [2019-10-02 01:25:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:38,326 INFO L475 AbstractCegarLoop]: Abstraction has 3910 states and 5486 transitions. [2019-10-02 01:25:38,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:25:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3910 states and 5486 transitions. [2019-10-02 01:25:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 01:25:38,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:38,329 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:38,330 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash 934964196, now seen corresponding path program 1 times [2019-10-02 01:25:38,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:38,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:38,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:38,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:38,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:38,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:25:38,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:25:38,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:25:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:25:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:25:38,448 INFO L87 Difference]: Start difference. First operand 3910 states and 5486 transitions. Second operand 5 states. [2019-10-02 01:25:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:43,800 INFO L93 Difference]: Finished difference Result 10080 states and 14344 transitions. [2019-10-02 01:25:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:25:43,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-10-02 01:25:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:43,828 INFO L225 Difference]: With dead ends: 10080 [2019-10-02 01:25:43,829 INFO L226 Difference]: Without dead ends: 6176 [2019-10-02 01:25:43,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:25:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2019-10-02 01:25:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 6153. [2019-10-02 01:25:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2019-10-02 01:25:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8483 transitions. [2019-10-02 01:25:43,975 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8483 transitions. Word has length 134 [2019-10-02 01:25:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:43,975 INFO L475 AbstractCegarLoop]: Abstraction has 6153 states and 8483 transitions. [2019-10-02 01:25:43,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:25:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8483 transitions. [2019-10-02 01:25:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 01:25:43,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:43,978 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:43,978 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1847889797, now seen corresponding path program 1 times [2019-10-02 01:25:43,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:43,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:43,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:44,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:44,166 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:25:44,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:25:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:44,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:25:44,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:44,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:25:44,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-10-02 01:25:44,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:25:44,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:25:44,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:25:44,417 INFO L87 Difference]: Start difference. First operand 6153 states and 8483 transitions. Second operand 9 states. [2019-10-02 01:25:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:56,429 INFO L93 Difference]: Finished difference Result 19340 states and 28765 transitions. [2019-10-02 01:25:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 01:25:56,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-10-02 01:25:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:56,505 INFO L225 Difference]: With dead ends: 19340 [2019-10-02 01:25:56,505 INFO L226 Difference]: Without dead ends: 13500 [2019-10-02 01:25:56,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-10-02 01:25:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13500 states. [2019-10-02 01:25:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13500 to 13441. [2019-10-02 01:25:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13441 states. [2019-10-02 01:25:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13441 states to 13441 states and 19539 transitions. [2019-10-02 01:25:56,914 INFO L78 Accepts]: Start accepts. Automaton has 13441 states and 19539 transitions. Word has length 149 [2019-10-02 01:25:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:56,915 INFO L475 AbstractCegarLoop]: Abstraction has 13441 states and 19539 transitions. [2019-10-02 01:25:56,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:25:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 13441 states and 19539 transitions. [2019-10-02 01:25:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 01:25:56,920 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:56,921 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 01:25:56,921 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:56,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:56,921 INFO L82 PathProgramCache]: Analyzing trace with hash -317200273, now seen corresponding path program 1 times [2019-10-02 01:25:56,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:56,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:56,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:57,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:57,212 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:25:57,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:57,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:25:57,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:57,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:25:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:25:57,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:25:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:25:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:25:57,416 INFO L87 Difference]: Start difference. First operand 13441 states and 19539 transitions. Second operand 9 states. [2019-10-02 01:26:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:01,926 INFO L93 Difference]: Finished difference Result 30896 states and 48069 transitions. [2019-10-02 01:26:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:26:01,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2019-10-02 01:26:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:02,021 INFO L225 Difference]: With dead ends: 30896 [2019-10-02 01:26:02,021 INFO L226 Difference]: Without dead ends: 17772 [2019-10-02 01:26:02,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:26:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17772 states. [2019-10-02 01:26:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17772 to 17586. [2019-10-02 01:26:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17586 states. [2019-10-02 01:26:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17586 states to 17586 states and 23629 transitions. [2019-10-02 01:26:02,584 INFO L78 Accepts]: Start accepts. Automaton has 17586 states and 23629 transitions. Word has length 214 [2019-10-02 01:26:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:02,585 INFO L475 AbstractCegarLoop]: Abstraction has 17586 states and 23629 transitions. [2019-10-02 01:26:02,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:26:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 17586 states and 23629 transitions. [2019-10-02 01:26:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 01:26:02,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:02,591 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:02,591 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2071151099, now seen corresponding path program 1 times [2019-10-02 01:26:02,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:02,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:02,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:26:03,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:03,003 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:26:03,031 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-10-02 01:26:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:03,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 01:26:03,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:26:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 01:26:03,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:26:03,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-10-02 01:26:03,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 01:26:03,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 01:26:03,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:26:03,437 INFO L87 Difference]: Start difference. First operand 17586 states and 23629 transitions. Second operand 12 states. [2019-10-02 01:26:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:26,629 INFO L93 Difference]: Finished difference Result 62912 states and 86972 transitions. [2019-10-02 01:26:26,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 01:26:26,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 224 [2019-10-02 01:26:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:26,771 INFO L225 Difference]: With dead ends: 62912 [2019-10-02 01:26:26,771 INFO L226 Difference]: Without dead ends: 45639 [2019-10-02 01:26:26,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=443, Invalid=1909, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 01:26:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45639 states. [2019-10-02 01:26:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45639 to 37265. [2019-10-02 01:26:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37265 states. [2019-10-02 01:26:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37265 states to 37265 states and 51522 transitions. [2019-10-02 01:26:27,642 INFO L78 Accepts]: Start accepts. Automaton has 37265 states and 51522 transitions. Word has length 224 [2019-10-02 01:26:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:27,643 INFO L475 AbstractCegarLoop]: Abstraction has 37265 states and 51522 transitions. [2019-10-02 01:26:27,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 01:26:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 37265 states and 51522 transitions. [2019-10-02 01:26:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-02 01:26:27,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:27,653 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:27,653 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1787868166, now seen corresponding path program 1 times [2019-10-02 01:26:27,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:27,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:27,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:27,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-02 01:26:27,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:26:27,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:26:27,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:26:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:26:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:26:27,940 INFO L87 Difference]: Start difference. First operand 37265 states and 51522 transitions. Second operand 3 states. [2019-10-02 01:26:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:31,222 INFO L93 Difference]: Finished difference Result 84067 states and 116998 transitions. [2019-10-02 01:26:31,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:26:31,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-10-02 01:26:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:31,354 INFO L225 Difference]: With dead ends: 84067 [2019-10-02 01:26:31,355 INFO L226 Difference]: Without dead ends: 38311 [2019-10-02 01:26:31,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:26:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38311 states. [2019-10-02 01:26:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38311 to 33381. [2019-10-02 01:26:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33381 states. [2019-10-02 01:26:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33381 states to 33381 states and 42597 transitions. [2019-10-02 01:26:32,092 INFO L78 Accepts]: Start accepts. Automaton has 33381 states and 42597 transitions. Word has length 335 [2019-10-02 01:26:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:32,092 INFO L475 AbstractCegarLoop]: Abstraction has 33381 states and 42597 transitions. [2019-10-02 01:26:32,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:26:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 33381 states and 42597 transitions. [2019-10-02 01:26:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-10-02 01:26:32,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:32,150 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-02 01:26:32,151 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:32,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:32,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2098378540, now seen corresponding path program 1 times [2019-10-02 01:26:32,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:32,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:32,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:32,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:32,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 366 proven. 122 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-10-02 01:26:33,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:33,159 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:33,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:33,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:26:33,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 699 proven. 2 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-02 01:26:33,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:33,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:26:33,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:26:33,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:26:33,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:26:33,837 INFO L87 Difference]: Start difference. First operand 33381 states and 42597 transitions. Second operand 9 states. [2019-10-02 01:26:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:40,247 INFO L93 Difference]: Finished difference Result 71823 states and 97342 transitions. [2019-10-02 01:26:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 01:26:40,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 652 [2019-10-02 01:26:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:40,418 INFO L225 Difference]: With dead ends: 71823 [2019-10-02 01:26:40,418 INFO L226 Difference]: Without dead ends: 38755 [2019-10-02 01:26:40,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:26:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38755 states. [2019-10-02 01:26:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38755 to 37423. [2019-10-02 01:26:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37423 states. [2019-10-02 01:26:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37423 states to 37423 states and 48180 transitions. [2019-10-02 01:26:41,358 INFO L78 Accepts]: Start accepts. Automaton has 37423 states and 48180 transitions. Word has length 652 [2019-10-02 01:26:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:41,359 INFO L475 AbstractCegarLoop]: Abstraction has 37423 states and 48180 transitions. [2019-10-02 01:26:41,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:26:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 37423 states and 48180 transitions. [2019-10-02 01:26:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2019-10-02 01:26:41,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:41,448 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:41,448 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:41,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:41,449 INFO L82 PathProgramCache]: Analyzing trace with hash 876790556, now seen corresponding path program 1 times [2019-10-02 01:26:41,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:41,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:41,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 519 proven. 2 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-10-02 01:26:42,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:42,498 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:26:42,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:42,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:26:42,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 519 proven. 2 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-10-02 01:26:43,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:43,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 01:26:43,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:26:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:26:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:26:43,160 INFO L87 Difference]: Start difference. First operand 37423 states and 48180 transitions. Second operand 7 states. [2019-10-02 01:26:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:46,535 INFO L93 Difference]: Finished difference Result 77070 states and 99536 transitions. [2019-10-02 01:26:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 01:26:46,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 721 [2019-10-02 01:26:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:46,683 INFO L225 Difference]: With dead ends: 77070 [2019-10-02 01:26:46,684 INFO L226 Difference]: Without dead ends: 38018 [2019-10-02 01:26:46,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:26:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38018 states. [2019-10-02 01:26:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38018 to 37318. [2019-10-02 01:26:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37318 states. [2019-10-02 01:26:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37318 states to 37318 states and 46042 transitions. [2019-10-02 01:26:49,120 INFO L78 Accepts]: Start accepts. Automaton has 37318 states and 46042 transitions. Word has length 721 [2019-10-02 01:26:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:49,123 INFO L475 AbstractCegarLoop]: Abstraction has 37318 states and 46042 transitions. [2019-10-02 01:26:49,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:26:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 37318 states and 46042 transitions. [2019-10-02 01:26:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2019-10-02 01:26:49,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:49,177 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:49,177 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:49,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:49,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1725675991, now seen corresponding path program 1 times [2019-10-02 01:26:49,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:49,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:49,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 129 proven. 682 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-10-02 01:26:51,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:51,141 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:51,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:26:51,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:51,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:26:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 739 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-10-02 01:26:51,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:51,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-10-02 01:26:51,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 01:26:51,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 01:26:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:26:51,650 INFO L87 Difference]: Start difference. First operand 37318 states and 46042 transitions. Second operand 21 states. [2019-10-02 01:26:53,617 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-10-02 01:27:07,570 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-02 01:27:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:27:14,257 INFO L93 Difference]: Finished difference Result 82941 states and 99253 transitions. [2019-10-02 01:27:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-10-02 01:27:14,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 738 [2019-10-02 01:27:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:27:14,360 INFO L225 Difference]: With dead ends: 82941 [2019-10-02 01:27:14,360 INFO L226 Difference]: Without dead ends: 44997 [2019-10-02 01:27:14,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5795 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1991, Invalid=13759, Unknown=0, NotChecked=0, Total=15750 [2019-10-02 01:27:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44997 states. [2019-10-02 01:27:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44997 to 39604. [2019-10-02 01:27:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39604 states. [2019-10-02 01:27:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39604 states to 39604 states and 44482 transitions. [2019-10-02 01:27:15,112 INFO L78 Accepts]: Start accepts. Automaton has 39604 states and 44482 transitions. Word has length 738 [2019-10-02 01:27:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:27:15,115 INFO L475 AbstractCegarLoop]: Abstraction has 39604 states and 44482 transitions. [2019-10-02 01:27:15,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 01:27:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 39604 states and 44482 transitions. [2019-10-02 01:27:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2019-10-02 01:27:15,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:27:15,169 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:27:15,169 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:27:15,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:27:15,170 INFO L82 PathProgramCache]: Analyzing trace with hash -687783567, now seen corresponding path program 1 times [2019-10-02 01:27:15,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:27:15,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:27:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:15,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:15,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 769 proven. 101 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-10-02 01:27:16,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:27:16,877 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:27:16,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:17,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:27:17,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:27:17,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:27:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 732 proven. 2 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-02 01:27:17,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:27:17,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 01:27:17,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:27:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:27:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:27:17,623 INFO L87 Difference]: Start difference. First operand 39604 states and 44482 transitions. Second operand 14 states. [2019-10-02 01:27:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:27:35,827 INFO L93 Difference]: Finished difference Result 90319 states and 100834 transitions. [2019-10-02 01:27:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-02 01:27:35,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 753 [2019-10-02 01:27:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:27:35,908 INFO L225 Difference]: With dead ends: 90319 [2019-10-02 01:27:35,908 INFO L226 Difference]: Without dead ends: 46041 [2019-10-02 01:27:35,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 828 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3451 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1205, Invalid=8301, Unknown=0, NotChecked=0, Total=9506 [2019-10-02 01:27:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46041 states. [2019-10-02 01:27:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46041 to 41981. [2019-10-02 01:27:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41981 states. [2019-10-02 01:27:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41981 states to 41981 states and 45080 transitions. [2019-10-02 01:27:36,698 INFO L78 Accepts]: Start accepts. Automaton has 41981 states and 45080 transitions. Word has length 753 [2019-10-02 01:27:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:27:36,699 INFO L475 AbstractCegarLoop]: Abstraction has 41981 states and 45080 transitions. [2019-10-02 01:27:36,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:27:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 41981 states and 45080 transitions. [2019-10-02 01:27:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2019-10-02 01:27:36,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:27:36,723 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:27:36,723 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:27:36,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:27:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash -721555720, now seen corresponding path program 1 times [2019-10-02 01:27:36,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:27:36,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:27:36,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:36,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 570 proven. 30 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-10-02 01:27:37,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:27:37,817 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:27:37,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:38,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:27:38,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:27:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2019-10-02 01:27:38,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:27:38,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-10-02 01:27:38,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:27:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:27:38,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:27:38,533 INFO L87 Difference]: Start difference. First operand 41981 states and 45080 transitions. Second operand 4 states. [2019-10-02 01:27:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:27:40,604 INFO L93 Difference]: Finished difference Result 83663 states and 89998 transitions. [2019-10-02 01:27:40,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 01:27:40,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 814 [2019-10-02 01:27:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:27:40,691 INFO L225 Difference]: With dead ends: 83663 [2019-10-02 01:27:40,691 INFO L226 Difference]: Without dead ends: 42306 [2019-10-02 01:27:40,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 819 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:27:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42306 states. [2019-10-02 01:27:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42306 to 41963. [2019-10-02 01:27:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41963 states. [2019-10-02 01:27:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41963 states to 41963 states and 44878 transitions. [2019-10-02 01:27:41,167 INFO L78 Accepts]: Start accepts. Automaton has 41963 states and 44878 transitions. Word has length 814 [2019-10-02 01:27:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:27:41,168 INFO L475 AbstractCegarLoop]: Abstraction has 41963 states and 44878 transitions. [2019-10-02 01:27:41,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:27:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 41963 states and 44878 transitions. [2019-10-02 01:27:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 992 [2019-10-02 01:27:41,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:27:41,201 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:27:41,201 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:27:41,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:27:41,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2062044772, now seen corresponding path program 1 times [2019-10-02 01:27:41,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:27:41,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:27:41,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:41,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:41,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2292 backedges. 708 proven. 1370 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-10-02 01:27:43,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:27:43,594 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:27:43,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:43,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:27:43,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:27:43,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:43,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2292 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 2057 trivial. 0 not checked. [2019-10-02 01:27:44,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:27:44,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [21] total 23 [2019-10-02 01:27:44,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 01:27:44,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 01:27:44,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-10-02 01:27:44,500 INFO L87 Difference]: Start difference. First operand 41963 states and 44878 transitions. Second operand 23 states. [2019-10-02 01:28:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:50,013 INFO L93 Difference]: Finished difference Result 118248 states and 130451 transitions. [2019-10-02 01:28:50,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-10-02 01:28:50,014 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 991 [2019-10-02 01:28:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:50,140 INFO L225 Difference]: With dead ends: 118248 [2019-10-02 01:28:50,141 INFO L226 Difference]: Without dead ends: 76283 [2019-10-02 01:28:50,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1416 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30286 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5988, Invalid=65034, Unknown=0, NotChecked=0, Total=71022 [2019-10-02 01:28:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76283 states. [2019-10-02 01:28:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76283 to 68169. [2019-10-02 01:28:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68169 states. [2019-10-02 01:28:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68169 states to 68169 states and 72301 transitions. [2019-10-02 01:28:51,091 INFO L78 Accepts]: Start accepts. Automaton has 68169 states and 72301 transitions. Word has length 991 [2019-10-02 01:28:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:51,091 INFO L475 AbstractCegarLoop]: Abstraction has 68169 states and 72301 transitions. [2019-10-02 01:28:51,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 01:28:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 68169 states and 72301 transitions. [2019-10-02 01:28:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2019-10-02 01:28:51,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:51,133 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:28:51,133 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:51,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1575356989, now seen corresponding path program 1 times [2019-10-02 01:28:51,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:51,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:51,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:51,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:51,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1839 backedges. 977 proven. 418 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-10-02 01:28:53,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:28:53,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:28:53,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:53,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:28:53,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:28:53,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:53,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:28:56,814 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 33 [2019-10-02 01:28:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1839 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2019-10-02 01:28:57,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:28:57,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 18 [2019-10-02 01:28:57,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:28:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:28:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=257, Unknown=1, NotChecked=0, Total=306 [2019-10-02 01:28:57,829 INFO L87 Difference]: Start difference. First operand 68169 states and 72301 transitions. Second operand 18 states. [2019-10-02 01:29:13,415 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-02 01:29:25,078 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-02 01:29:31,805 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-02 01:29:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:35,655 INFO L93 Difference]: Finished difference Result 139828 states and 149541 transitions. [2019-10-02 01:29:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-02 01:29:35,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1142 [2019-10-02 01:29:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:35,658 INFO L225 Difference]: With dead ends: 139828 [2019-10-02 01:29:35,658 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:29:35,747 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1287 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2746 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1544, Invalid=6287, Unknown=1, NotChecked=0, Total=7832 [2019-10-02 01:29:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:29:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:29:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:29:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:29:35,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1142 [2019-10-02 01:29:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:35,750 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:29:35,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:29:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:29:35,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:29:35,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:29:50,060 WARN L191 SmtUtils]: Spent 10.73 s on a formula simplification. DAG size of input: 1856 DAG size of output: 1318 [2019-10-02 01:30:00,701 WARN L191 SmtUtils]: Spent 10.64 s on a formula simplification. DAG size of input: 1856 DAG size of output: 1318 [2019-10-02 01:30:02,325 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 39 [2019-10-02 01:30:21,795 WARN L191 SmtUtils]: Spent 19.33 s on a formula simplification. DAG size of input: 1229 DAG size of output: 265 [2019-10-02 01:30:42,489 WARN L191 SmtUtils]: Spent 20.56 s on a formula simplification. DAG size of input: 1206 DAG size of output: 263 [2019-10-02 01:31:08,489 WARN L191 SmtUtils]: Spent 25.98 s on a formula simplification. DAG size of input: 1251 DAG size of output: 217 [2019-10-02 01:31:34,095 WARN L191 SmtUtils]: Spent 25.60 s on a formula simplification. DAG size of input: 1251 DAG size of output: 217 [2019-10-02 01:31:57,249 WARN L191 SmtUtils]: Spent 23.05 s on a formula simplification. DAG size of input: 1250 DAG size of output: 266 [2019-10-02 01:31:57,253 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:31:57,254 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-10-02 01:31:57,254 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:31:57,254 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-10-02 01:31:57,254 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,254 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,255 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse51 (+ |old(~a4~0)| 86)) (.cse39 (= 4 |old(~a2~0)|)) (.cse53 (+ |old(~a29~0)| 144))) (let ((.cse5 (= 3 |old(~a2~0)|)) (.cse17 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse44 (= 3 ~a2~0)) (.cse37 (+ |old(~a29~0)| 127)) (.cse49 (+ |old(~a0~0)| 98)) (.cse42 (not (<= (+ |old(~a29~0)| 107095) (* 4 |old(~a0~0)|)))) (.cse47 (not (<= .cse53 0))) (.cse19 (= ~a29~0 |old(~a29~0)|)) (.cse20 (= ~a2~0 |old(~a2~0)|)) (.cse48 (= 4 ~a2~0)) (.cse22 (= ~a0~0 |old(~a0~0)|)) (.cse21 (= ~a4~0 |old(~a4~0)|)) (.cse27 (not .cse39)) (.cse8 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse50 (not (< 0 .cse51))) (.cse45 (= 1 |old(~a2~0)|)) (.cse29 (not (<= (+ |old(~a29~0)| (* 5 |old(~a0~0)|)) 599264))) (.cse13 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse54 (* 9 |old(~a0~0)|))) (let ((.cse16 (forall ((v_~a0~0_833 Int)) (let ((.cse58 (div v_~a0~0_833 5))) (let ((.cse57 (* 123 .cse58))) (let ((.cse55 (+ .cse57 123)) (.cse56 (* 3 .cse58))) (or (not (<= (+ v_~a0~0_833 61) 0)) (not (< .cse55 0)) (= (mod .cse56 10) 0) (= (mod v_~a0~0_833 5) 0) (not (< v_~a0~0_833 0)) (not (<= |old(~a0~0)| (+ (* 5 (div .cse55 10)) 5))) (not (< .cse57 0)) (= (mod (+ .cse56 3) 10) 0))))))) (.cse14 (not (<= (+ (* 2 |old(~a29~0)|) .cse54 650) 0))) (.cse23 (or .cse29 .cse13)) (.cse18 (not (<= |old(~a2~0)| 2))) (.cse31 (not (<= (+ (* 10 |old(~a29~0)|) .cse54) 14))) (.cse36 (and .cse8 .cse50 .cse45 (not (< 0 .cse53)))) (.cse33 (or .cse27 .cse13)) (.cse34 (forall ((v_~a29~0_905 Int)) (let ((.cse52 (mod v_~a29~0_905 299928))) (or (not (<= (+ |old(~a29~0)| 134555) .cse52)) (not (= .cse52 0)) (not (<= (+ v_~a29~0_905 16) 0)))))) (.cse30 (not (<= 96030 (+ |old(~a29~0)| |old(~a0~0)|)))) (.cse32 (and (and (<= (+ ~a4~0 89) 0) .cse19 .cse20 (<= (+ ~a29~0 144) 0) .cse48) .cse22 .cse21)) (.cse9 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse43 (not (<= .cse51 0))) (.cse38 (and .cse19 .cse22 .cse48 .cse21)) (.cse40 (not (<= |old(~a2~0)| 4))) (.cse7 (not (<= (+ |old(~a29~0)| 18) 0))) (.cse11 (not (<= 3 |old(~a2~0)|))) (.cse46 (not (<= (+ |old(~a4~0)| 172330) 0))) (.cse26 (and .cse42 .cse47)) (.cse25 (not (<= .cse49 0))) (.cse24 (and .cse19 .cse20)) (.cse10 (and .cse50 (not (< 0 (+ |old(~a29~0)| 16))))) (.cse6 (and (not (< 0 .cse49)) .cse47)) (.cse2 (not (<= 0 .cse37))) (.cse28 (and .cse19 .cse48 .cse22 .cse21)) (.cse12 (and .cse19 .cse22 .cse44 .cse21)) (.cse41 (and .cse17 .cse47)) (.cse15 (not .cse5)) (.cse35 (not (<= (+ |old(~a4~0)| 172335) 0))) (.cse3 (and .cse19 .cse20 .cse22 .cse21)) (.cse0 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse1 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse4 (not (<= |old(~a2~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3) (or .cse6 .cse7 .cse12 .cse8 .cse13 .cse14 .cse2 .cse15) (or .cse16 .cse0 .cse12 .cse15) (or .cse0 .cse17 .cse18 .cse3) (or .cse8 (and (and .cse19 .cse20 .cse21) .cse22) (or .cse23 .cse4)) (or .cse9 .cse0 (and .cse24 .cse22 .cse21) .cse25 (or .cse10 .cse26)) (or .cse27 .cse16 .cse0 .cse28 .cse1) (or .cse12 (or .cse29 .cse13 .cse10) .cse15) (or .cse27 .cse28 .cse13 .cse2 .cse30) (or .cse31 .cse32 .cse33 .cse34) (or .cse9 .cse8 .cse28 .cse27 .cse14 .cse0 .cse7) (or .cse3 .cse5 .cse25 .cse35) (or .cse3 (or .cse23 .cse36 .cse4) (not (<= .cse37 0)) (not (<= (+ |old(~a0~0)| 44) 0))) (or .cse0 .cse18 .cse1 .cse3 .cse2 .cse25) (or .cse0 .cse1 .cse31 .cse3 .cse8 .cse2) (or .cse9 .cse27 .cse38 .cse35) (or (or .cse36 (or .cse13 .cse5 .cse39 .cse40)) .cse41 .cse3) (or .cse33 .cse34 .cse30 .cse32 .cse35) (or .cse0 .cse10 .cse3 .cse42 .cse11 .cse39 .cse25) (or .cse0 .cse28 .cse1 (or .cse29 .cse27 .cse17 .cse2)) (or .cse3 (or .cse0 .cse17 .cse7 .cse9 .cse10)) (or .cse0 .cse41 .cse3 .cse29 .cse10 .cse2 .cse39) (or .cse43 (or .cse15 (or .cse17 .cse2)) .cse12) (or (or (or .cse25 .cse15) .cse1) .cse0 .cse12) (or (and (and .cse19 .cse22 .cse44) .cse21) (or .cse13 (not (<= 0 (+ |old(~a0~0)| 97))) .cse10 .cse15)) (or .cse13 .cse17 .cse3) (or (not (<= (+ |old(~a29~0)| |old(~a0~0)| 617317) 0)) (not .cse45) (and .cse19 .cse20 .cse21 .cse22) .cse8 .cse43) (or .cse8 .cse27 .cse38 .cse46) (or .cse7 (or .cse5 .cse2 .cse40) .cse3 .cse35) (or .cse8 .cse5 .cse7 .cse3 .cse2 .cse11 .cse46) (or .cse8 .cse12 (or (or .cse13 .cse26) .cse15)) (or .cse3 .cse0 .cse1 (not (<= 134559 (+ |old(~a4~0)| |old(~a29~0)|))) .cse39 .cse25) (or (and (and .cse24 .cse22) .cse21) (or .cse13 .cse5 .cse10)) (or .cse8 .cse27 .cse6 .cse0 .cse1 .cse2 .cse28) (or .cse12 .cse41 .cse15 .cse35) (or .cse8 .cse3 .cse0 .cse1 .cse4))))) [2019-10-02 01:31:57,255 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,255 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,256 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,256 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,256 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,256 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,256 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,256 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-10-02 01:31:57,256 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-10-02 01:31:57,256 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,257 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:31:57,258 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,259 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,260 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-10-02 01:31:57,261 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,262 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:31:57,263 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,264 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,265 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,266 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,267 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-10-02 01:31:57,268 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,268 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-10-02 01:31:57,268 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-10-02 01:31:57,268 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-10-02 01:31:57,268 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:31:57,268 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:31:57,268 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,269 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,270 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:31:57,271 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-10-02 01:31:57,272 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,274 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse34 (not (<= (+ |old(~a29~0)| 107095) (* 4 |old(~a0~0)|)))) (.cse44 (not (<= (+ |old(~a29~0)| 144) 0))) (.cse46 (+ |old(~a29~0)| 127)) (.cse27 (= 4 |old(~a2~0)|))) (let ((.cse10 (= 3 |old(~a2~0)|)) (.cse14 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse23 (= 3 ~a2~0)) (.cse18 (not (<= (+ |old(~a29~0)| (* 5 |old(~a0~0)|)) 599264))) (.cse17 (not (<= |old(~a2~0)| 1))) (.cse47 (+ |old(~a0~0)| 98)) (.cse28 (not .cse27)) (.cse4 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse43 (not (<= .cse46 0))) (.cse15 (and .cse34 .cse44)) (.cse37 (= ~a2~0 |old(~a2~0)|)) (.cse48 (* 9 |old(~a0~0)|)) (.cse22 (= ~a29~0 |old(~a29~0)|)) (.cse21 (= ~a0~0 |old(~a0~0)|)) (.cse45 (= 4 ~a2~0)) (.cse24 (= ~a4~0 |old(~a4~0)|)) (.cse49 (+ |old(~a4~0)| 86))) (let ((.cse8 (forall ((v_~a0~0_833 Int)) (let ((.cse54 (div v_~a0~0_833 5))) (let ((.cse53 (* 123 .cse54))) (let ((.cse51 (+ .cse53 123)) (.cse52 (* 3 .cse54))) (or (not (<= (+ v_~a0~0_833 61) 0)) (not (< .cse51 0)) (= (mod .cse52 10) 0) (= (mod v_~a0~0_833 5) 0) (not (< v_~a0~0_833 0)) (not (<= |old(~a0~0)| (+ (* 5 (div .cse51 10)) 5))) (not (< .cse53 0)) (= (mod (+ .cse52 3) 10) 0))))))) (.cse11 (not (<= |old(~a2~0)| 4))) (.cse36 (not (<= .cse49 0))) (.cse30 (not (<= 96030 (+ |old(~a29~0)| |old(~a0~0)|)))) (.cse32 (and .cse22 .cse21 .cse45 .cse24)) (.cse31 (not (<= (+ (* 10 |old(~a29~0)|) .cse48) 14))) (.cse39 (and (let ((.cse50 (<= (+ ~a4~0 89) 0))) (or (and .cse50 .cse22 .cse37 (<= (+ ~a29~0 144) 0) .cse45) (and .cse50 .cse22 .cse37 (<= (+ ~a29~0 107095) (* 4 ~a0~0)) (<= (+ ~a29~0 127) 0) .cse45))) .cse21 .cse24)) (.cse38 (or .cse28 .cse4 .cse43 .cse15)) (.cse40 (not (<= (+ |old(~a4~0)| 172330) 0))) (.cse42 (and (and .cse22 .cse37) .cse21 .cse24)) (.cse20 (not (<= .cse47 0))) (.cse19 (and (not (< 0 .cse49)) (not (< 0 (+ |old(~a29~0)| 16))))) (.cse35 (not (<= 3 |old(~a2~0)|))) (.cse25 (or (or .cse18 .cse4) .cse17)) (.cse26 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse5 (not (<= (+ (* 2 |old(~a29~0)|) .cse48 650) 0))) (.cse1 (not (<= (+ |old(~a29~0)| 18) 0))) (.cse0 (and (not (< 0 .cse47)) .cse44)) (.cse6 (not (<= 0 .cse46))) (.cse29 (and .cse22 .cse45 .cse21 .cse24)) (.cse3 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse13 (and .cse22 .cse37 .cse21 .cse24)) (.cse9 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse16 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse2 (and .cse22 .cse21 .cse23 .cse24)) (.cse33 (and .cse14 .cse44)) (.cse7 (not .cse10)) (.cse12 (not (<= (+ |old(~a4~0)| 172335) 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse2 .cse7) (or .cse1 (or .cse10 .cse6 .cse11) .cse12 .cse13) (or .cse9 .cse14 (not (<= |old(~a2~0)| 2)) .cse13) (or .cse3 (or (or .cse4 .cse15) .cse7) .cse2) (or .cse13 .cse9 .cse16 .cse6 .cse17) (or .cse2 (or .cse18 .cse4 .cse19) .cse7) (or .cse10 .cse13 .cse20 .cse12) (or (and .cse21 (and .cse22 .cse23) .cse24) (or .cse4 (not (<= 0 (+ |old(~a0~0)| 97))) .cse19 .cse7)) (or .cse3 .cse13 .cse25) (or (or .cse26 .cse9 .cse14 .cse16 .cse27) .cse13) (or .cse28 .cse4 .cse6 .cse29 .cse30) (or .cse28 .cse29 .cse8 .cse9 .cse16) (or .cse9 .cse16 .cse31 .cse13 .cse3 .cse6) (or .cse9 .cse2 (or .cse16 (or .cse20 .cse7))) (or .cse26 .cse28 .cse32 .cse12) (or (or .cse4 .cse10 .cse27 .cse11) .cse13 .cse33) (or .cse9 .cse19 .cse13 .cse34 .cse35 .cse27 .cse20) (or .cse9 .cse29 .cse16 (or .cse18 .cse28 .cse14 .cse6)) (or .cse9 .cse33 .cse13 .cse18 .cse19 .cse6 .cse27) (or .cse36 (or .cse7 (or .cse14 .cse6)) .cse2) (or .cse9 .cse13 .cse16 .cse6 .cse27 .cse20 .cse11) (or .cse4 .cse14 .cse13) (or (not (<= (+ |old(~a29~0)| |old(~a0~0)| 617317) 0)) (not (= 1 |old(~a2~0)|)) (and .cse22 .cse37 .cse24 .cse21) .cse3 .cse36) (or .cse38 .cse39 .cse30 .cse12) (or .cse3 .cse28 .cse32 .cse40) (or .cse31 .cse39 .cse38 (forall ((v_~a29~0_905 Int)) (let ((.cse41 (mod v_~a29~0_905 299928))) (or (not (<= (+ |old(~a29~0)| 134555) .cse41)) (not (= .cse41 0)) (not (<= (+ v_~a29~0_905 16) 0)))))) (or .cse26 .cse9 .cse20 .cse42 (or .cse19 .cse15)) (or .cse3 .cse10 .cse1 .cse13 .cse6 .cse35 .cse40) (or (or .cse4 .cse10 .cse19) .cse42) (or .cse13 .cse9 .cse16 (not (<= 134559 (+ |old(~a4~0)| |old(~a29~0)|))) .cse27 .cse20) (or .cse10 .cse0 .cse9 .cse1 .cse26 .cse3 .cse19 .cse35 .cse13) (or .cse43 .cse25 .cse13 (not (<= (+ |old(~a0~0)| 44) 0))) (or .cse26 .cse3 .cse28 .cse29 .cse5 .cse9 .cse1) (or .cse3 .cse28 .cse0 .cse9 .cse16 .cse6 .cse29) (or .cse3 .cse13 .cse9 .cse16 .cse17) (or .cse2 .cse33 .cse7 .cse12))))) [2019-10-02 01:31:57,274 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,274 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,274 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,274 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,274 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,274 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,275 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,276 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,277 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-10-02 01:31:57,278 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,279 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-10-02 01:31:57,279 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-10-02 01:31:57,279 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:31:57,279 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,279 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:31:57,279 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:31:57,279 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,280 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-10-02 01:31:57,280 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-10-02 01:31:57,280 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,280 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-10-02 01:31:57,280 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-10-02 01:31:57,280 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,280 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,280 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,281 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,281 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,281 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,281 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,281 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,282 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse9 (= 4 |old(~a2~0)|))) (let ((.cse8 (= 3 |old(~a2~0)|)) (.cse23 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse41 (= 3 ~a2~0)) (.cse5 (+ |old(~a29~0)| 127)) (.cse46 (+ |old(~a0~0)| 98)) (.cse29 (not .cse9)) (.cse47 (* 9 |old(~a0~0)|)) (.cse14 (= ~a0~0 |old(~a0~0)|)) (.cse45 (= 4 ~a2~0)) (.cse15 (= ~a4~0 |old(~a4~0)|)) (.cse48 (+ |old(~a4~0)| 86)) (.cse12 (= ~a29~0 |old(~a29~0)|)) (.cse13 (= ~a2~0 |old(~a2~0)|)) (.cse39 (not (<= (+ |old(~a29~0)| 107095) (* 4 |old(~a0~0)|)))) (.cse44 (not (<= (+ |old(~a29~0)| 144) 0))) (.cse31 (not (<= (+ |old(~a29~0)| (* 5 |old(~a0~0)|)) 599264))) (.cse7 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse4 (not (<= |old(~a2~0)| 1)))) (let ((.cse6 (or (or .cse31 .cse7) .cse4)) (.cse24 (and .cse39 .cse44)) (.cse22 (forall ((v_~a0~0_833 Int)) (let ((.cse53 (div v_~a0~0_833 5))) (let ((.cse52 (* 123 .cse53))) (let ((.cse50 (+ .cse52 123)) (.cse51 (* 3 .cse53))) (or (not (<= (+ v_~a0~0_833 61) 0)) (not (< .cse50 0)) (= (mod .cse51 10) 0) (= (mod v_~a0~0_833 5) 0) (not (< v_~a0~0_833 0)) (not (<= |old(~a0~0)| (+ (* 5 (div .cse50 10)) 5))) (not (< .cse52 0)) (= (mod (+ .cse51 3) 10) 0))))))) (.cse26 (and .cse12 .cse13)) (.cse33 (not (<= 96030 (+ |old(~a29~0)| |old(~a0~0)|)))) (.cse42 (not (<= .cse48 0))) (.cse35 (and .cse12 .cse14 .cse45 .cse15)) (.cse10 (not (<= |old(~a2~0)| 4))) (.cse43 (not (<= (+ |old(~a4~0)| 172330) 0))) (.cse38 (and (and (<= (+ ~a4~0 89) 0) .cse12 .cse13 (<= (+ ~a29~0 144) 0) .cse45) .cse14 .cse15)) (.cse34 (not (<= (+ (* 10 |old(~a29~0)|) .cse47) 14))) (.cse36 (or .cse29 .cse7)) (.cse37 (forall ((v_~a29~0_905 Int)) (let ((.cse49 (mod v_~a29~0_905 299928))) (or (not (<= (+ |old(~a29~0)| 134555) .cse49)) (not (= .cse49 0)) (not (<= (+ v_~a29~0_905 16) 0)))))) (.cse27 (not (<= .cse46 0))) (.cse28 (and (not (< 0 .cse48)) (not (< 0 (+ |old(~a29~0)| 16))))) (.cse40 (not (<= 3 |old(~a2~0)|))) (.cse25 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse20 (not (<= (+ (* 2 |old(~a29~0)|) .cse47 650) 0))) (.cse17 (not (<= (+ |old(~a29~0)| 18) 0))) (.cse16 (and (not (< 0 .cse46)) .cse44)) (.cse2 (not (<= 0 .cse5))) (.cse30 (and .cse12 .cse45 .cse14 .cse15)) (.cse19 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse3 (and .cse12 .cse13 .cse14 .cse15)) (.cse0 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse1 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse18 (and .cse12 .cse14 .cse41 .cse15)) (.cse11 (and .cse23 .cse44)) (.cse21 (not .cse8)) (.cse32 (not (<= (+ |old(~a4~0)| 172335) 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse3 (not (<= .cse5 0)) .cse6 (not (<= (+ |old(~a0~0)| 44) 0))) (or (or .cse7 .cse8 .cse9 .cse10) .cse11 (and .cse12 .cse13 .cse14 .cse15 (or (not (= 1 ~a2~0)) (<= (+ ~a0~0 61) 0)))) (or .cse16 .cse17 .cse18 .cse19 .cse7 .cse20 .cse2 .cse21) (or .cse22 .cse0 .cse18 .cse21) (or .cse0 .cse23 (not (<= |old(~a2~0)| 2)) .cse3) (or .cse19 (or (or .cse7 .cse24) .cse21) .cse18) (or .cse19 (and (and .cse12 .cse13 .cse15) .cse14) .cse6) (or .cse25 .cse0 (and .cse26 .cse14 .cse15) .cse27 (or .cse28 .cse24)) (or .cse29 .cse22 .cse0 .cse30 .cse1) (or .cse18 (or .cse31 .cse7 .cse28) .cse21) (or (or .cse7 .cse8 .cse28) (and (and .cse26 .cse14) .cse15)) (or .cse8 .cse3 .cse27 .cse32) (or (or .cse25 .cse0 .cse23 .cse1 .cse9) .cse3) (or .cse29 .cse7 .cse2 .cse30 .cse33) (or .cse0 .cse1 .cse34 .cse3 .cse19 .cse2) (or .cse25 .cse29 .cse35 .cse32) (or .cse0 .cse18 (or .cse1 (or .cse27 .cse21))) (or .cse36 .cse37 .cse33 .cse38 .cse32) (or .cse0 .cse28 .cse3 .cse39 .cse40 .cse9 .cse27) (or .cse0 .cse30 .cse1 (or .cse31 .cse29 .cse23 .cse2)) (or .cse0 .cse11 .cse3 .cse31 .cse28 .cse2 .cse9) (or (or .cse7 (not (<= 0 (+ |old(~a0~0)| 97))) .cse28 .cse21) (and (and .cse12 .cse14 .cse41) .cse15)) (or .cse42 (or .cse21 (or .cse23 .cse2)) .cse18) (or .cse0 .cse3 .cse1 .cse2 .cse9 .cse27 .cse10) (or .cse7 .cse23 .cse3) (or (not (<= (+ |old(~a29~0)| |old(~a0~0)| 617317) 0)) (not (= 1 |old(~a2~0)|)) (and .cse12 .cse13 .cse15 .cse14) .cse19 .cse42) (or .cse19 .cse29 .cse35 .cse43) (or .cse17 (or .cse8 .cse2 .cse10) .cse3 .cse32) (or .cse19 .cse8 .cse17 .cse3 .cse2 .cse40 .cse43) (or .cse38 .cse34 .cse36 .cse37) (or .cse3 .cse0 .cse1 (not (<= 134559 (+ |old(~a4~0)| |old(~a29~0)|))) .cse9 .cse27) (or .cse8 .cse16 .cse0 .cse17 .cse25 .cse19 .cse28 .cse40 .cse3) (or .cse25 .cse19 .cse29 .cse30 .cse20 .cse0 .cse17) (or .cse19 .cse29 .cse16 .cse0 .cse1 .cse2 .cse30) (or .cse19 .cse3 .cse0 .cse1 .cse4) (or .cse18 .cse11 .cse21 .cse32))))) [2019-10-02 01:31:57,282 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-10-02 01:31:57,282 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,282 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:31:57,282 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,283 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,284 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,284 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,284 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-10-02 01:31:57,284 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-10-02 01:31:57,284 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,284 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,284 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:31:57,285 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:31:57,285 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:31:57,285 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,285 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,285 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,285 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-10-02 01:31:57,285 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-10-02 01:31:57,285 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,286 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,286 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,286 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,286 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,286 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,286 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,286 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,287 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,287 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:31:57,287 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:31:57,287 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,287 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,287 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,287 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,287 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,288 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,288 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,288 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-10-02 01:31:57,288 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,288 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-10-02 01:31:57,288 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,288 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-10-02 01:31:57,288 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,289 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:31:57,290 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,291 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,292 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,293 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-10-02 01:31:57,294 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:31:57,294 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-10-02 01:31:57,294 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,294 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:31:57,294 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,294 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,294 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,294 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:31:57,295 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:31:57,296 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:31:57,296 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,296 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,296 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,296 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,296 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,296 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,296 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,297 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,298 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,299 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,300 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-10-02 01:31:57,301 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,302 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,303 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,303 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-10-02 01:31:57,303 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,303 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-10-02 01:31:57,303 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-10-02 01:31:57,303 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:31:57,303 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a4~0 89) 0) (< 0 (+ ~a0~0 98)) (<= (+ ~a0~0 44) 0) (<= ~a2~0 1) (= (+ ~a29~0 127) 0)) [2019-10-02 01:31:57,303 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:31:57,303 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:31:57,304 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (or (not (< 0 (+ |old(~a0~0)| 98))) (not (= 0 (+ |old(~a29~0)| 127))) (and (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0)) (not (<= |old(~a2~0)| 1)) (not (<= (+ |old(~a4~0)| 89) 0)) (not (<= (+ (* 2 |old(~a29~0)|) (* 9 |old(~a0~0)|) 650) 0))) [2019-10-02 01:31:57,304 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-10-02 01:31:57,304 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse40 (+ ~a29~0 127)) (.cse39 (<= (+ ~a29~0 144) 0)) (.cse4 (<= (+ ~a29~0 107095) (* 4 ~a0~0)))) (let ((.cse38 (+ ~a0~0 98)) (.cse14 (<= (+ ~a0~0 147) 0)) (.cse6 (or .cse39 .cse4)) (.cse21 (= 4 ~a2~0)) (.cse23 (<= (+ ~a4~0 89) 0)) (.cse1 (not (= ~a2~0 4))) (.cse17 (not (= ~a2~0 3))) (.cse9 (<= 0 .cse40)) (.cse37 (* 9 ~a0~0)) (.cse36 (+ ~a4~0 86))) (let ((.cse22 (<= (+ ~a4~0 172330) 0)) (.cse5 (<= 3 ~a2~0)) (.cse10 (<= ~a2~0 1)) (.cse30 (<= .cse36 0)) (.cse11 (<= (+ ~a0~0 61) 0)) (.cse25 (<= (+ (* 2 ~a29~0) .cse37 650) 0)) (.cse7 (<= 0 (+ ~a29~0 192415))) (.cse15 (<= (+ ~a29~0 18) 0)) (.cse12 (and .cse23 .cse1 .cse17 .cse9)) (.cse26 (<= 96030 (+ ~a29~0 ~a0~0))) (.cse29 (and .cse23 .cse6 (<= .cse40 0) .cse21)) (.cse20 (<= (+ ~a4~0 172335) 0)) (.cse19 (= 3 ~a2~0)) (.cse31 (or .cse14 .cse39)) (.cse16 (or .cse39 (< 0 .cse38))) (.cse13 (<= (+ ~a29~0 (* 5 ~a0~0)) 599264)) (.cse8 (<= 0 (+ ~a4~0 85))) (.cse0 (<= .cse38 0)) (.cse27 (<= (+ (* 10 ~a29~0) .cse37) 14)) (.cse2 (or (< 0 (+ ~a29~0 16)) (< 0 .cse36))) (.cse18 (exists ((v_~a0~0_833 Int)) (let ((.cse35 (div v_~a0~0_833 5))) (let ((.cse34 (* 123 .cse35))) (let ((.cse32 (* 3 .cse35)) (.cse33 (+ .cse34 123))) (and (not (= (mod (+ .cse32 3) 10) 0)) (<= (+ v_~a0~0_833 61) 0) (< .cse33 0) (< .cse34 0) (not (= (mod .cse32 10) 0)) (< v_~a0~0_833 0) (not (= (mod v_~a0~0_833 5) 0)) (<= ~a0~0 (+ (* 5 (div .cse33 10)) 5)))))))) (.cse3 (<= (+ ~a4~0 42) 0)) (.cse24 (<= ~a2~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse8 .cse9 .cse3 .cse10) (and (and .cse8 .cse3 .cse9) (<= ~a29~0 43) .cse11) (and .cse2 .cse12) (and .cse8 .cse13 .cse14 .cse3 .cse7) (and .cse1 .cse13 .cse14 .cse2 .cse3 .cse7) (and .cse11 (and .cse8 .cse3 .cse15 .cse16 .cse17 .cse7 .cse5)) (and (<= ~a2~0 |old(~a2~0)|) (= ~a29~0 |old(~a29~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|)) (and .cse8 .cse3 .cse18 .cse7) (and .cse3 .cse18 .cse19) (and .cse20 .cse21 .cse7) (and (and .cse8 .cse3 .cse10) .cse11) (and .cse22 .cse21 .cse11) (and .cse8 .cse0 .cse1 .cse3 (<= 134559 (+ ~a4~0 ~a29~0))) (not (<= (+ (* 2 |old(~a29~0)|) (* 9 |old(~a0~0)|) 650) 0)) (and .cse22 .cse15 .cse17 .cse11 .cse9 .cse5) (and .cse11 (and .cse23 .cse6 .cse24)) (and (and (and .cse25 .cse23 .cse16 .cse19 .cse9) .cse15) .cse11) (and .cse23 .cse14) (and .cse23 .cse26 .cse21 .cse9) (and .cse0 .cse20 .cse17) (not (<= |old(~a2~0)| 1)) (and .cse11 (and .cse23 .cse10)) (and .cse27 (and (exists ((v_~a29~0_905 Int)) (let ((.cse28 (mod v_~a29~0_905 299928))) (and (= .cse28 0) (<= (+ ~a29~0 134555) .cse28) (<= (+ v_~a29~0_905 16) 0)))) .cse29)) (and .cse30 .cse14 .cse19 .cse9) (and (and .cse8 .cse3 .cse16 .cse21 .cse7) .cse11) (and .cse11 (<= (+ ~a29~0 ~a0~0 617317) 0) (= 1 ~a2~0) .cse30) (and .cse15 .cse21 .cse11 .cse25 .cse3 .cse7) (and .cse3 .cse8 .cse0 .cse19) (and .cse8 .cse0 .cse9 .cse3 (<= ~a2~0 2)) (and .cse15 .cse20 (and .cse12 .cse24)) (and .cse26 .cse20 .cse29) (not (= 0 (+ |old(~a29~0)| 127))) (and (and .cse23 .cse1 .cse17 .cse24) .cse31) (and (and .cse20 .cse19) .cse31) (and .cse2 .cse23 .cse16) (not (< 0 (+ |old(~a0~0)| 98))) (and .cse23 .cse13 .cse2) (and .cse8 .cse0 .cse27 .cse9 .cse3) (and (and .cse21 .cse2 .cse3 .cse6) .cse18) (and .cse3 (and .cse1 .cse14 .cse17 .cse24)) (not (<= (+ |old(~a4~0)| 89) 0)))))) [2019-10-02 01:31:57,305 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-10-02 01:31:57,305 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-10-02 01:31:57,305 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse40 (+ ~a29~0 127)) (.cse39 (<= (+ ~a29~0 144) 0)) (.cse4 (<= (+ ~a29~0 107095) (* 4 ~a0~0)))) (let ((.cse38 (+ ~a0~0 98)) (.cse14 (<= (+ ~a0~0 147) 0)) (.cse6 (or .cse39 .cse4)) (.cse21 (= 4 ~a2~0)) (.cse23 (<= (+ ~a4~0 89) 0)) (.cse1 (not (= ~a2~0 4))) (.cse17 (not (= ~a2~0 3))) (.cse9 (<= 0 .cse40)) (.cse37 (* 9 ~a0~0)) (.cse36 (+ ~a4~0 86))) (let ((.cse22 (<= (+ ~a4~0 172330) 0)) (.cse5 (<= 3 ~a2~0)) (.cse10 (<= ~a2~0 1)) (.cse30 (<= .cse36 0)) (.cse11 (<= (+ ~a0~0 61) 0)) (.cse25 (<= (+ (* 2 ~a29~0) .cse37 650) 0)) (.cse7 (<= 0 (+ ~a29~0 192415))) (.cse15 (<= (+ ~a29~0 18) 0)) (.cse12 (and .cse23 .cse1 .cse17 .cse9)) (.cse26 (<= 96030 (+ ~a29~0 ~a0~0))) (.cse29 (and .cse23 .cse6 (<= .cse40 0) .cse21)) (.cse20 (<= (+ ~a4~0 172335) 0)) (.cse19 (= 3 ~a2~0)) (.cse31 (or .cse14 .cse39)) (.cse16 (or .cse39 (< 0 .cse38))) (.cse13 (<= (+ ~a29~0 (* 5 ~a0~0)) 599264)) (.cse8 (<= 0 (+ ~a4~0 85))) (.cse0 (<= .cse38 0)) (.cse27 (<= (+ (* 10 ~a29~0) .cse37) 14)) (.cse2 (or (< 0 (+ ~a29~0 16)) (< 0 .cse36))) (.cse18 (exists ((v_~a0~0_833 Int)) (let ((.cse35 (div v_~a0~0_833 5))) (let ((.cse34 (* 123 .cse35))) (let ((.cse32 (* 3 .cse35)) (.cse33 (+ .cse34 123))) (and (not (= (mod (+ .cse32 3) 10) 0)) (<= (+ v_~a0~0_833 61) 0) (< .cse33 0) (< .cse34 0) (not (= (mod .cse32 10) 0)) (< v_~a0~0_833 0) (not (= (mod v_~a0~0_833 5) 0)) (<= ~a0~0 (+ (* 5 (div .cse33 10)) 5)))))))) (.cse3 (<= (+ ~a4~0 42) 0)) (.cse24 (<= ~a2~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse8 .cse9 .cse3 .cse10) (and (and .cse8 .cse3 .cse9) (<= ~a29~0 43) .cse11) (and .cse2 .cse12) (and .cse8 .cse13 .cse14 .cse3 .cse7) (and .cse1 .cse13 .cse14 .cse2 .cse3 .cse7) (and .cse11 (and .cse8 .cse3 .cse15 .cse16 .cse17 .cse7 .cse5)) (and (<= ~a2~0 |old(~a2~0)|) (= ~a29~0 |old(~a29~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|)) (and .cse8 .cse3 .cse18 .cse7) (and .cse3 .cse18 .cse19) (and .cse20 .cse21 .cse7) (and (and .cse8 .cse3 .cse10) .cse11) (and .cse22 .cse21 .cse11) (and .cse8 .cse0 .cse1 .cse3 (<= 134559 (+ ~a4~0 ~a29~0))) (not (<= (+ (* 2 |old(~a29~0)|) (* 9 |old(~a0~0)|) 650) 0)) (and .cse22 .cse15 .cse17 .cse11 .cse9 .cse5) (and .cse11 (and .cse23 .cse6 .cse24)) (and (and (and .cse25 .cse23 .cse16 .cse19 .cse9) .cse15) .cse11) (and .cse23 .cse14) (and .cse23 .cse26 .cse21 .cse9) (and .cse0 .cse20 .cse17) (not (<= |old(~a2~0)| 1)) (and .cse11 (and .cse23 .cse10)) (and .cse27 (and (exists ((v_~a29~0_905 Int)) (let ((.cse28 (mod v_~a29~0_905 299928))) (and (= .cse28 0) (<= (+ ~a29~0 134555) .cse28) (<= (+ v_~a29~0_905 16) 0)))) .cse29)) (and .cse30 .cse14 .cse19 .cse9) (and (and .cse8 .cse3 .cse16 .cse21 .cse7) .cse11) (and .cse11 (<= (+ ~a29~0 ~a0~0 617317) 0) (= 1 ~a2~0) .cse30) (and .cse15 .cse21 .cse11 .cse25 .cse3 .cse7) (and .cse3 .cse8 .cse0 .cse19) (and .cse8 .cse0 .cse9 .cse3 (<= ~a2~0 2)) (and .cse15 .cse20 (and .cse12 .cse24)) (and .cse26 .cse20 .cse29) (not (= 0 (+ |old(~a29~0)| 127))) (and (and .cse23 .cse1 .cse17 .cse24) .cse31) (and (and .cse20 .cse19) .cse31) (and .cse2 .cse23 .cse16) (not (< 0 (+ |old(~a0~0)| 98))) (and .cse23 .cse13 .cse2) (and .cse8 .cse0 .cse27 .cse9 .cse3) (and (and .cse21 .cse2 .cse3 .cse6) .cse18) (and .cse3 (and .cse1 .cse14 .cse17 .cse24)) (not (<= (+ |old(~a4~0)| 89) 0)))))) [2019-10-02 01:31:57,306 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-10-02 01:31:57,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:31:57 BoogieIcfgContainer [2019-10-02 01:31:57,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:31:57,368 INFO L168 Benchmark]: Toolchain (without parser) took 399529.25 ms. Allocated memory was 132.6 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 82.8 MB in the beginning and 263.1 MB in the end (delta: -180.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-10-02 01:31:57,368 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:31:57,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1394.67 ms. Allocated memory was 132.6 MB in the beginning and 221.8 MB in the end (delta: 89.1 MB). Free memory was 82.6 MB in the beginning and 149.5 MB in the end (delta: -66.8 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2019-10-02 01:31:57,370 INFO L168 Benchmark]: Boogie Preprocessor took 211.36 ms. Allocated memory is still 221.8 MB. Free memory was 149.5 MB in the beginning and 137.1 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-10-02 01:31:57,374 INFO L168 Benchmark]: RCFGBuilder took 3134.94 ms. Allocated memory was 221.8 MB in the beginning and 276.8 MB in the end (delta: 55.1 MB). Free memory was 137.1 MB in the beginning and 179.8 MB in the end (delta: -42.7 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. [2019-10-02 01:31:57,375 INFO L168 Benchmark]: TraceAbstraction took 394783.19 ms. Allocated memory was 276.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 179.8 MB in the beginning and 263.1 MB in the end (delta: -83.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-10-02 01:31:57,384 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.43 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1394.67 ms. Allocated memory was 132.6 MB in the beginning and 221.8 MB in the end (delta: 89.1 MB). Free memory was 82.6 MB in the beginning and 149.5 MB in the end (delta: -66.8 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 211.36 ms. Allocated memory is still 221.8 MB. Free memory was 149.5 MB in the beginning and 137.1 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3134.94 ms. Allocated memory was 221.8 MB in the beginning and 276.8 MB in the end (delta: 55.1 MB). Free memory was 137.1 MB in the beginning and 179.8 MB in the end (delta: -42.7 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 394783.19 ms. Allocated memory was 276.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 179.8 MB in the beginning and 263.1 MB in the end (delta: -83.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,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_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,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_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: 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-10-02 01:31:57,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_905,QUANTIFIED] [2019-10-02 01:31:57,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-10-02 01:31:57,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((a0 + 98 <= 0 && !(a2 == 4)) && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && a29 + 107095 <= 4 * a0) && 3 <= a2) || ((((a0 + 98 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && (a29 + 144 <= 0 || a29 + 107095 <= 4 * a0)) && 0 <= a29 + 192415)) || (((0 <= a4 + 85 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 <= 1)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && 0 <= a29 + 127) && a29 <= 43) && a0 + 61 <= 0)) || ((0 < a29 + 16 || 0 < a4 + 86) && ((a4 + 89 <= 0 && !(a2 == 4)) && !(a2 == 3)) && 0 <= a29 + 127)) || ((((0 <= a4 + 85 && a29 + 5 * a0 <= 599264) && a0 + 147 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 192415)) || (((((!(a2 == 4) && a29 + 5 * a0 <= 599264) && a0 + 147 <= 0) && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && 0 <= a29 + 192415)) || (a0 + 61 <= 0 && (((((0 <= a4 + 85 && a4 + 42 <= 0) && a29 + 18 <= 0) && (a29 + 144 <= 0 || 0 < a0 + 98)) && !(a2 == 3)) && 0 <= a29 + 192415) && 3 <= a2)) || (((a2 <= \old(a2) && a29 == \old(a29)) && a0 == \old(a0)) && a4 == \old(a4))) || (((0 <= a4 + 85 && a4 + 42 <= 0) && (\exists v_~a0~0_833 : int :: ((((((!((3 * (v_~a0~0_833 / 5) + 3) % 10 == 0) && v_~a0~0_833 + 61 <= 0) && 123 * (v_~a0~0_833 / 5) + 123 < 0) && 123 * (v_~a0~0_833 / 5) < 0) && !(3 * (v_~a0~0_833 / 5) % 10 == 0)) && v_~a0~0_833 < 0) && !(v_~a0~0_833 % 5 == 0)) && a0 <= 5 * ((123 * (v_~a0~0_833 / 5) + 123) / 10) + 5)) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && (\exists v_~a0~0_833 : int :: ((((((!((3 * (v_~a0~0_833 / 5) + 3) % 10 == 0) && v_~a0~0_833 + 61 <= 0) && 123 * (v_~a0~0_833 / 5) + 123 < 0) && 123 * (v_~a0~0_833 / 5) < 0) && !(3 * (v_~a0~0_833 / 5) % 10 == 0)) && v_~a0~0_833 < 0) && !(v_~a0~0_833 % 5 == 0)) && a0 <= 5 * ((123 * (v_~a0~0_833 / 5) + 123) / 10) + 5)) && 3 == a2)) || ((a4 + 172335 <= 0 && 4 == a2) && 0 <= a29 + 192415)) || (((0 <= a4 + 85 && a4 + 42 <= 0) && a2 <= 1) && a0 + 61 <= 0)) || ((a4 + 172330 <= 0 && 4 == a2) && a0 + 61 <= 0)) || ((((0 <= a4 + 85 && a0 + 98 <= 0) && !(a2 == 4)) && a4 + 42 <= 0) && 134559 <= a4 + a29)) || !(2 * \old(a29) + 9 * \old(a0) + 650 <= 0)) || (((((a4 + 172330 <= 0 && a29 + 18 <= 0) && !(a2 == 3)) && a0 + 61 <= 0) && 0 <= a29 + 127) && 3 <= a2)) || (a0 + 61 <= 0 && (a4 + 89 <= 0 && (a29 + 144 <= 0 || a29 + 107095 <= 4 * a0)) && a2 <= 4)) || ((((((2 * a29 + 9 * a0 + 650 <= 0 && a4 + 89 <= 0) && (a29 + 144 <= 0 || 0 < a0 + 98)) && 3 == a2) && 0 <= a29 + 127) && a29 + 18 <= 0) && a0 + 61 <= 0)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || (((a4 + 89 <= 0 && 96030 <= a29 + a0) && 4 == a2) && 0 <= a29 + 127)) || ((a0 + 98 <= 0 && a4 + 172335 <= 0) && !(a2 == 3))) || !(\old(a2) <= 1)) || (a0 + 61 <= 0 && a4 + 89 <= 0 && a2 <= 1)) || (10 * a29 + 9 * a0 <= 14 && (\exists v_~a29~0_905 : int :: (v_~a29~0_905 % 299928 == 0 && a29 + 134555 <= v_~a29~0_905 % 299928) && v_~a29~0_905 + 16 <= 0) && ((a4 + 89 <= 0 && (a29 + 144 <= 0 || a29 + 107095 <= 4 * a0)) && a29 + 127 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && a0 + 147 <= 0) && 3 == a2) && 0 <= a29 + 127)) || (((((0 <= a4 + 85 && a4 + 42 <= 0) && (a29 + 144 <= 0 || 0 < a0 + 98)) && 4 == a2) && 0 <= a29 + 192415) && a0 + 61 <= 0)) || (((a0 + 61 <= 0 && a29 + a0 + 617317 <= 0) && 1 == a2) && a4 + 86 <= 0)) || (((((a29 + 18 <= 0 && 4 == a2) && a0 + 61 <= 0) && 2 * a29 + 9 * a0 + 650 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && 0 <= a4 + 85) && a0 + 98 <= 0) && 3 == a2)) || ((((0 <= a4 + 85 && a0 + 98 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 <= 2)) || ((a29 + 18 <= 0 && a4 + 172335 <= 0) && (((a4 + 89 <= 0 && !(a2 == 4)) && !(a2 == 3)) && 0 <= a29 + 127) && a2 <= 4)) || ((96030 <= a29 + a0 && a4 + 172335 <= 0) && ((a4 + 89 <= 0 && (a29 + 144 <= 0 || a29 + 107095 <= 4 * a0)) && a29 + 127 <= 0) && 4 == a2)) || !(0 == \old(a29) + 127)) || ((((a4 + 89 <= 0 && !(a2 == 4)) && !(a2 == 3)) && a2 <= 4) && (a0 + 147 <= 0 || a29 + 144 <= 0))) || ((a4 + 172335 <= 0 && 3 == a2) && (a0 + 147 <= 0 || a29 + 144 <= 0))) || (((0 < a29 + 16 || 0 < a4 + 86) && a4 + 89 <= 0) && (a29 + 144 <= 0 || 0 < a0 + 98))) || !(0 < \old(a0) + 98)) || ((a4 + 89 <= 0 && a29 + 5 * a0 <= 599264) && (0 < a29 + 16 || 0 < a4 + 86))) || ((((0 <= a4 + 85 && a0 + 98 <= 0) && 10 * a29 + 9 * a0 <= 14) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((((4 == a2 && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && (a29 + 144 <= 0 || a29 + 107095 <= 4 * a0)) && (\exists v_~a0~0_833 : int :: ((((((!((3 * (v_~a0~0_833 / 5) + 3) % 10 == 0) && v_~a0~0_833 + 61 <= 0) && 123 * (v_~a0~0_833 / 5) + 123 < 0) && 123 * (v_~a0~0_833 / 5) < 0) && !(3 * (v_~a0~0_833 / 5) % 10 == 0)) && v_~a0~0_833 < 0) && !(v_~a0~0_833 % 5 == 0)) && a0 <= 5 * ((123 * (v_~a0~0_833 / 5) + 123) / 10) + 5))) || (a4 + 42 <= 0 && ((!(a2 == 4) && a0 + 147 <= 0) && !(a2 == 3)) && a2 <= 4)) || !(\old(a4) + 89 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 394.6s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 220.3s AutomataDifference, 0.0s DeadEndRemovalTime, 141.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2626 SDtfs, 50903 SDslu, 8049 SDs, 0 SdLazy, 145469 SolverSat, 17051 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 163.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7486 GetRequests, 6765 SyntacticMatches, 6 SemanticMatches, 715 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43177 ImplicationChecksByTransitivity, 24.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68169occurred in iteration=15, 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.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 33639 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 5332 PreInvPairs, 6691 NumberOfFragments, 8081 HoareAnnotationTreeSize, 5332 FomulaSimplifications, 16554495 FormulaSimplificationTreeSizeReduction, 26.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 12022894 FormulaSimplificationTreeSizeReductionInter, 114.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 13652 NumberOfCodeBlocks, 13652 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 13626 ConstructedInterpolants, 73 QuantifiedInterpolants, 30842512 SizeOfPredicates, 11 NumberOfNonLiveVariables, 8985 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 16070/18872 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...