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/Problem16_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:35:55,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:35:55,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:35:55,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:35:55,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:35:55,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:35:55,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:35:55,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:35:55,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:35:55,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:35:55,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:35:55,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:35:55,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:35:55,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:35:55,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:35:55,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:35:55,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:35:55,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:35:55,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:35:55,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:35:55,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:35:55,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:35:55,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:35:55,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:35:55,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:35:55,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:35:55,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:35:55,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:35:55,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:35:55,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:35:55,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:35:55,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:35:55,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:35:55,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:35:55,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:35:55,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:35:55,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:35:55,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:35:55,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:35:55,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:35:55,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:35:55,834 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:35:55,857 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:35:55,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:35:55,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:35:55,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:35:55,859 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:35:55,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:35:55,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:35:55,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:35:55,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:35:55,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:35:55,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:35:55,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:35:55,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:35:55,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:35:55,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:35:55,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:35:55,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:35:55,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:35:55,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:35:55,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:35:55,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:35:55,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:35:55,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:35:55,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:35:55,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:35:55,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:35:55,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:35:55,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:35:55,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:35:55,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:35:55,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:35:55,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:35:55,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:35:55,930 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:35:55,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label53.c [2019-10-02 01:35:56,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7434328b9/b800d27e70934a41bc527ee08e54dbe8/FLAG71b932b64 [2019-10-02 01:35:56,643 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:35:56,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label53.c [2019-10-02 01:35:56,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7434328b9/b800d27e70934a41bc527ee08e54dbe8/FLAG71b932b64 [2019-10-02 01:35:56,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7434328b9/b800d27e70934a41bc527ee08e54dbe8 [2019-10-02 01:35:56,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:35:56,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:35:56,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:35:56,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:35:56,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:35:56,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:35:56" (1/1) ... [2019-10-02 01:35:56,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3127bf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:56, skipping insertion in model container [2019-10-02 01:35:56,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:35:56" (1/1) ... [2019-10-02 01:35:56,885 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:35:56,968 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:35:57,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:35:57,814 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:35:58,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:35:58,145 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:35:58,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58 WrapperNode [2019-10-02 01:35:58,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:35:58,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:35:58,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:35:58,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:35:58,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (1/1) ... [2019-10-02 01:35:58,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (1/1) ... [2019-10-02 01:35:58,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (1/1) ... [2019-10-02 01:35:58,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (1/1) ... [2019-10-02 01:35:58,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (1/1) ... [2019-10-02 01:35:58,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (1/1) ... [2019-10-02 01:35:58,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (1/1) ... [2019-10-02 01:35:58,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:35:58,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:35:58,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:35:58,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:35:58,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:35:58,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:35:58,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:35:58,365 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:35:58,365 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:35:58,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:35:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:35:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:35:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:35:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:35:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:35:58,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:35:58,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:35:58,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:36:00,581 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:36:00,581 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:36:00,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:36:00 BoogieIcfgContainer [2019-10-02 01:36:00,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:36:00,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:36:00,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:36:00,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:36:00,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:35:56" (1/3) ... [2019-10-02 01:36:00,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6310e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:36:00, skipping insertion in model container [2019-10-02 01:36:00,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:35:58" (2/3) ... [2019-10-02 01:36:00,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6310e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:36:00, skipping insertion in model container [2019-10-02 01:36:00,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:36:00" (3/3) ... [2019-10-02 01:36:00,592 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label53.c [2019-10-02 01:36:00,604 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:36:00,613 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:36:00,636 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:36:00,677 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:36:00,678 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:36:00,678 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:36:00,679 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:36:00,679 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:36:00,679 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:36:00,679 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:36:00,680 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:36:00,680 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:36:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 01:36:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 01:36:00,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:00,723 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, 1, 1, 1, 1, 1] [2019-10-02 01:36:00,725 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -302324190, now seen corresponding path program 1 times [2019-10-02 01:36:00,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:00,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:00,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:00,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:00,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:01,088 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:36:01,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:36:01,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:36:01,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:36:01,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:36:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:36:01,113 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-10-02 01:36:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:03,422 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-10-02 01:36:03,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:36:03,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 01:36:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:03,447 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 01:36:03,447 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 01:36:03,458 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:36:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 01:36:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-10-02 01:36:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 01:36:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1184 transitions. [2019-10-02 01:36:03,574 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1184 transitions. Word has length 43 [2019-10-02 01:36:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:03,575 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1184 transitions. [2019-10-02 01:36:03,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:36:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1184 transitions. [2019-10-02 01:36:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 01:36:03,582 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:03,582 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, 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] [2019-10-02 01:36:03,583 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 204114703, now seen corresponding path program 1 times [2019-10-02 01:36:03,583 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:03,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:36:03,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:36:03,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:36:03,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:36:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:36:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:36:03,716 INFO L87 Difference]: Start difference. First operand 682 states and 1184 transitions. Second operand 5 states. [2019-10-02 01:36:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:06,560 INFO L93 Difference]: Finished difference Result 2066 states and 3624 transitions. [2019-10-02 01:36:06,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:36:06,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-02 01:36:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:06,572 INFO L225 Difference]: With dead ends: 2066 [2019-10-02 01:36:06,572 INFO L226 Difference]: Without dead ends: 1390 [2019-10-02 01:36:06,575 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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:36:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-10-02 01:36:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1372. [2019-10-02 01:36:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-10-02 01:36:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2268 transitions. [2019-10-02 01:36:06,638 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2268 transitions. Word has length 112 [2019-10-02 01:36:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:06,639 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 2268 transitions. [2019-10-02 01:36:06,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:36:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2268 transitions. [2019-10-02 01:36:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 01:36:06,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:06,643 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, 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] [2019-10-02 01:36:06,643 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:06,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1530346758, now seen corresponding path program 1 times [2019-10-02 01:36:06,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:06,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:06,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:06,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:06,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:36:06,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:36:06,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:36:06,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:36:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:36:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:36:06,882 INFO L87 Difference]: Start difference. First operand 1372 states and 2268 transitions. Second operand 6 states. [2019-10-02 01:36:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:09,543 INFO L93 Difference]: Finished difference Result 3472 states and 5791 transitions. [2019-10-02 01:36:09,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:36:09,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 01:36:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:09,557 INFO L225 Difference]: With dead ends: 3472 [2019-10-02 01:36:09,558 INFO L226 Difference]: Without dead ends: 2106 [2019-10-02 01:36:09,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:36:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-10-02 01:36:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2081. [2019-10-02 01:36:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-10-02 01:36:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3263 transitions. [2019-10-02 01:36:09,625 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3263 transitions. Word has length 141 [2019-10-02 01:36:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:09,626 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3263 transitions. [2019-10-02 01:36:09,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:36:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3263 transitions. [2019-10-02 01:36:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 01:36:09,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:09,630 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, 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:36:09,630 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash 225402430, now seen corresponding path program 1 times [2019-10-02 01:36:09,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:09,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:09,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:09,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:09,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:36:09,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:36:09,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:36:09,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:36:09,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:36:09,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:36:09,816 INFO L87 Difference]: Start difference. First operand 2081 states and 3263 transitions. Second operand 6 states. [2019-10-02 01:36:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:12,140 INFO L93 Difference]: Finished difference Result 5241 states and 8253 transitions. [2019-10-02 01:36:12,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:36:12,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-02 01:36:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:12,161 INFO L225 Difference]: With dead ends: 5241 [2019-10-02 01:36:12,161 INFO L226 Difference]: Without dead ends: 3166 [2019-10-02 01:36:12,168 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:36:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2019-10-02 01:36:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3140. [2019-10-02 01:36:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-10-02 01:36:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4128 transitions. [2019-10-02 01:36:12,304 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4128 transitions. Word has length 159 [2019-10-02 01:36:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:12,304 INFO L475 AbstractCegarLoop]: Abstraction has 3140 states and 4128 transitions. [2019-10-02 01:36:12,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:36:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4128 transitions. [2019-10-02 01:36:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 01:36:12,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:12,308 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,309 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:12,309 INFO L82 PathProgramCache]: Analyzing trace with hash -786182774, now seen corresponding path program 1 times [2019-10-02 01:36:12,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:12,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:12,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 102 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:36:12,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:12,500 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:36:12,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:12,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:36:12,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 01:36:12,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:36:12,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 01:36:12,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:36:12,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:36:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:36:12,751 INFO L87 Difference]: Start difference. First operand 3140 states and 4128 transitions. Second operand 6 states. [2019-10-02 01:36:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:15,882 INFO L93 Difference]: Finished difference Result 8017 states and 10600 transitions. [2019-10-02 01:36:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:36:15,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2019-10-02 01:36:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:15,914 INFO L225 Difference]: With dead ends: 8017 [2019-10-02 01:36:15,914 INFO L226 Difference]: Without dead ends: 4883 [2019-10-02 01:36:15,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:36:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-10-02 01:36:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4518. [2019-10-02 01:36:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2019-10-02 01:36:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5824 transitions. [2019-10-02 01:36:16,055 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5824 transitions. Word has length 241 [2019-10-02 01:36:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:16,056 INFO L475 AbstractCegarLoop]: Abstraction has 4518 states and 5824 transitions. [2019-10-02 01:36:16,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:36:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5824 transitions. [2019-10-02 01:36:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-10-02 01:36:16,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:16,065 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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:36:16,065 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -555703454, now seen corresponding path program 1 times [2019-10-02 01:36:16,066 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:16,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:16,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 225 proven. 115 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 01:36:16,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:16,530 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:36:16,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:16,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:36:16,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 415 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 01:36:16,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:36:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:36:16,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:36:16,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:36:16,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:36:16,905 INFO L87 Difference]: Start difference. First operand 4518 states and 5824 transitions. Second operand 9 states. [2019-10-02 01:36:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:22,183 INFO L93 Difference]: Finished difference Result 11940 states and 15954 transitions. [2019-10-02 01:36:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:36:22,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 403 [2019-10-02 01:36:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:22,225 INFO L225 Difference]: With dead ends: 11940 [2019-10-02 01:36:22,226 INFO L226 Difference]: Without dead ends: 7428 [2019-10-02 01:36:22,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:36:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2019-10-02 01:36:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 7386. [2019-10-02 01:36:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-10-02 01:36:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 9380 transitions. [2019-10-02 01:36:22,461 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 9380 transitions. Word has length 403 [2019-10-02 01:36:22,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:22,463 INFO L475 AbstractCegarLoop]: Abstraction has 7386 states and 9380 transitions. [2019-10-02 01:36:22,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:36:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 9380 transitions. [2019-10-02 01:36:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2019-10-02 01:36:22,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:22,513 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-02 01:36:22,522 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2066888342, now seen corresponding path program 1 times [2019-10-02 01:36:22,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:22,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:22,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 180 proven. 455 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-10-02 01:36:23,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:23,376 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:36:23,398 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:36:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:23,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:36:23,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-10-02 01:36:23,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:36:23,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:36:23,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:36:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:36:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:36:23,904 INFO L87 Difference]: Start difference. First operand 7386 states and 9380 transitions. Second operand 9 states. [2019-10-02 01:36:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:27,884 INFO L93 Difference]: Finished difference Result 14829 states and 18979 transitions. [2019-10-02 01:36:27,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:36:27,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 733 [2019-10-02 01:36:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:27,928 INFO L225 Difference]: With dead ends: 14829 [2019-10-02 01:36:27,929 INFO L226 Difference]: Without dead ends: 7449 [2019-10-02 01:36:27,955 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 741 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:36:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7449 states. [2019-10-02 01:36:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7449 to 7426. [2019-10-02 01:36:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7426 states. [2019-10-02 01:36:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9114 transitions. [2019-10-02 01:36:28,153 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9114 transitions. Word has length 733 [2019-10-02 01:36:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:28,154 INFO L475 AbstractCegarLoop]: Abstraction has 7426 states and 9114 transitions. [2019-10-02 01:36:28,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:36:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9114 transitions. [2019-10-02 01:36:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2019-10-02 01:36:28,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:28,213 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-02 01:36:28,213 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:28,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:28,214 INFO L82 PathProgramCache]: Analyzing trace with hash 946828090, now seen corresponding path program 1 times [2019-10-02 01:36:28,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:28,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:28,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:28,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 604 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-10-02 01:36:28,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:28,894 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:36:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:29,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:36:29,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 604 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-10-02 01:36:29,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:36:29,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:36:29,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:36:29,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:36:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:36:29,827 INFO L87 Difference]: Start difference. First operand 7426 states and 9114 transitions. Second operand 9 states. [2019-10-02 01:36:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:33,770 INFO L93 Difference]: Finished difference Result 14095 states and 17128 transitions. [2019-10-02 01:36:33,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 01:36:33,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 763 [2019-10-02 01:36:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:33,840 INFO L225 Difference]: With dead ends: 14095 [2019-10-02 01:36:33,840 INFO L226 Difference]: Without dead ends: 6675 [2019-10-02 01:36:33,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:36:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6675 states. [2019-10-02 01:36:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6675 to 6650. [2019-10-02 01:36:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6650 states. [2019-10-02 01:36:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6650 states to 6650 states and 7694 transitions. [2019-10-02 01:36:33,965 INFO L78 Accepts]: Start accepts. Automaton has 6650 states and 7694 transitions. Word has length 763 [2019-10-02 01:36:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:33,967 INFO L475 AbstractCegarLoop]: Abstraction has 6650 states and 7694 transitions. [2019-10-02 01:36:33,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:36:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 6650 states and 7694 transitions. [2019-10-02 01:36:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2019-10-02 01:36:33,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:33,995 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-02 01:36:33,995 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash -804913646, now seen corresponding path program 1 times [2019-10-02 01:36:33,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:33,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:33,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 860 proven. 124 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-02 01:36:34,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:34,938 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:36:34,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:35,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:36:35,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 640 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-10-02 01:36:35,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:36:35,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:36:35,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:36:35,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:36:35,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:36:35,751 INFO L87 Difference]: Start difference. First operand 6650 states and 7694 transitions. Second operand 9 states. [2019-10-02 01:36:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:40,516 INFO L93 Difference]: Finished difference Result 18481 states and 21604 transitions. [2019-10-02 01:36:40,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 01:36:40,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 775 [2019-10-02 01:36:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:40,546 INFO L225 Difference]: With dead ends: 18481 [2019-10-02 01:36:40,546 INFO L226 Difference]: Without dead ends: 10037 [2019-10-02 01:36:40,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:36:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10037 states. [2019-10-02 01:36:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10037 to 9630. [2019-10-02 01:36:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9630 states. [2019-10-02 01:36:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9630 states to 9630 states and 10195 transitions. [2019-10-02 01:36:40,738 INFO L78 Accepts]: Start accepts. Automaton has 9630 states and 10195 transitions. Word has length 775 [2019-10-02 01:36:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:40,739 INFO L475 AbstractCegarLoop]: Abstraction has 9630 states and 10195 transitions. [2019-10-02 01:36:40,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:36:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 9630 states and 10195 transitions. [2019-10-02 01:36:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2019-10-02 01:36:40,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:40,782 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:36:40,782 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1985540487, now seen corresponding path program 1 times [2019-10-02 01:36:40,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:40,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:40,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:40,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:40,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 1091 proven. 318 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-10-02 01:36:43,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:43,097 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:36:43,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:43,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:36:43,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2019-10-02 01:36:43,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:36:43,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2019-10-02 01:36:43,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 01:36:43,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 01:36:43,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:36:43,975 INFO L87 Difference]: Start difference. First operand 9630 states and 10195 transitions. Second operand 13 states. [2019-10-02 01:36:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:51,549 INFO L93 Difference]: Finished difference Result 34899 states and 37214 transitions. [2019-10-02 01:36:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 01:36:51,549 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1052 [2019-10-02 01:36:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:51,606 INFO L225 Difference]: With dead ends: 34899 [2019-10-02 01:36:51,606 INFO L226 Difference]: Without dead ends: 25279 [2019-10-02 01:36:51,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1073 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-10-02 01:36:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25279 states. [2019-10-02 01:36:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25279 to 19205. [2019-10-02 01:36:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19205 states. [2019-10-02 01:36:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 20418 transitions. [2019-10-02 01:36:51,956 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 20418 transitions. Word has length 1052 [2019-10-02 01:36:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:51,957 INFO L475 AbstractCegarLoop]: Abstraction has 19205 states and 20418 transitions. [2019-10-02 01:36:51,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 01:36:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 20418 transitions. [2019-10-02 01:36:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1415 [2019-10-02 01:36:52,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:52,014 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:52,014 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:52,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1464972673, now seen corresponding path program 1 times [2019-10-02 01:36:52,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:52,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:52,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3068 backedges. 935 proven. 383 refuted. 0 times theorem prover too weak. 1750 trivial. 0 not checked. [2019-10-02 01:36:57,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:57,585 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:36:57,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:58,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 01:36:58,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:58,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:36:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3068 backedges. 1916 proven. 5 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-10-02 01:36:59,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:36:59,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-10-02 01:36:59,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:36:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:36:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:36:59,440 INFO L87 Difference]: Start difference. First operand 19205 states and 20418 transitions. Second operand 17 states. [2019-10-02 01:37:02,705 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-02 01:37:03,304 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-02 01:37:03,537 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-02 01:37:06,179 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-10-02 01:37:07,048 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-02 01:37:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:37:08,598 INFO L93 Difference]: Finished difference Result 38448 states and 40943 transitions. [2019-10-02 01:37:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 01:37:08,598 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1414 [2019-10-02 01:37:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:37:08,634 INFO L225 Difference]: With dead ends: 38448 [2019-10-02 01:37:08,634 INFO L226 Difference]: Without dead ends: 19925 [2019-10-02 01:37:08,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1486 GetRequests, 1434 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=575, Invalid=2181, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 01:37:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19925 states. [2019-10-02 01:37:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19925 to 19544. [2019-10-02 01:37:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19544 states. [2019-10-02 01:37:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19544 states to 19544 states and 20744 transitions. [2019-10-02 01:37:08,924 INFO L78 Accepts]: Start accepts. Automaton has 19544 states and 20744 transitions. Word has length 1414 [2019-10-02 01:37:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:37:08,926 INFO L475 AbstractCegarLoop]: Abstraction has 19544 states and 20744 transitions. [2019-10-02 01:37:08,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:37:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19544 states and 20744 transitions. [2019-10-02 01:37:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2019-10-02 01:37:09,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:37:09,003 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:09,003 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:37:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:37:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -479530373, now seen corresponding path program 1 times [2019-10-02 01:37:09,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:37:09,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:37:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:37:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:37:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:37:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:37:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 1321 proven. 2341 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-02 01:37:19,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:37:19,251 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:37:19,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:37:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:37:19,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 2017 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 01:37:19,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:37:19,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:37:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 2049 proven. 2 refuted. 0 times theorem prover too weak. 2199 trivial. 0 not checked. [2019-10-02 01:37:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:37:21,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8] total 29 [2019-10-02 01:37:21,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 01:37:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 01:37:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2019-10-02 01:37:21,126 INFO L87 Difference]: Start difference. First operand 19544 states and 20744 transitions. Second operand 29 states. [2019-10-02 01:37:27,152 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2019-10-02 01:37:27,756 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 35 [2019-10-02 01:37:28,160 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2019-10-02 01:37:28,692 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-10-02 01:37:29,188 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2019-10-02 01:37:29,535 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-10-02 01:37:31,483 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 39 [2019-10-02 01:37:32,648 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-10-02 01:37:32,984 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2019-10-02 01:37:37,940 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-10-02 01:37:38,126 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-10-02 01:37:38,880 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-10-02 01:37:39,784 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2019-10-02 01:37:40,094 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-10-02 01:37:42,066 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-10-02 01:37:42,378 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-10-02 01:37:42,872 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-10-02 01:37:44,357 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-02 01:37:44,571 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-10-02 01:37:44,856 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-10-02 01:37:45,104 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-10-02 01:37:45,427 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-10-02 01:37:45,603 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-10-02 01:37:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:37:47,236 INFO L93 Difference]: Finished difference Result 41063 states and 44351 transitions. [2019-10-02 01:37:47,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-02 01:37:47,236 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1584 [2019-10-02 01:37:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:37:47,286 INFO L225 Difference]: With dead ends: 41063 [2019-10-02 01:37:47,286 INFO L226 Difference]: Without dead ends: 22540 [2019-10-02 01:37:47,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1788 GetRequests, 1666 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5213 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2116, Invalid=12646, Unknown=0, NotChecked=0, Total=14762 [2019-10-02 01:37:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22540 states. [2019-10-02 01:37:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22540 to 21568. [2019-10-02 01:37:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21568 states. [2019-10-02 01:37:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21568 states to 21568 states and 22807 transitions. [2019-10-02 01:37:47,641 INFO L78 Accepts]: Start accepts. Automaton has 21568 states and 22807 transitions. Word has length 1584 [2019-10-02 01:37:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:37:47,644 INFO L475 AbstractCegarLoop]: Abstraction has 21568 states and 22807 transitions. [2019-10-02 01:37:47,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 01:37:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 21568 states and 22807 transitions. [2019-10-02 01:37:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1690 [2019-10-02 01:37:47,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:37:47,688 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:47,688 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:37:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:37:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash -177938146, now seen corresponding path program 1 times [2019-10-02 01:37:47,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:37:47,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:37:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:37:47,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:37:47,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:37:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:37:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5246 backedges. 1424 proven. 244 refuted. 0 times theorem prover too weak. 3578 trivial. 0 not checked. [2019-10-02 01:37:51,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:37:51,029 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:37:51,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:37:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:37:51,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 2168 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:37:51,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:37:51,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:37:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5246 backedges. 2723 proven. 2 refuted. 0 times theorem prover too weak. 2521 trivial. 0 not checked. [2019-10-02 01:37:52,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:37:52,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-10-02 01:37:52,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:37:52,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:37:52,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:37:52,969 INFO L87 Difference]: Start difference. First operand 21568 states and 22807 transitions. Second operand 16 states. [2019-10-02 01:38:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:38:12,271 INFO L93 Difference]: Finished difference Result 43267 states and 45780 transitions. [2019-10-02 01:38:12,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-02 01:38:12,272 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1689 [2019-10-02 01:38:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:38:12,310 INFO L225 Difference]: With dead ends: 43267 [2019-10-02 01:38:12,310 INFO L226 Difference]: Without dead ends: 21649 [2019-10-02 01:38:12,331 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1820 GetRequests, 1743 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=886, Invalid=5120, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 01:38:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21649 states. [2019-10-02 01:38:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21649 to 20570. [2019-10-02 01:38:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20570 states. [2019-10-02 01:38:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20570 states to 20570 states and 21354 transitions. [2019-10-02 01:38:12,590 INFO L78 Accepts]: Start accepts. Automaton has 20570 states and 21354 transitions. Word has length 1689 [2019-10-02 01:38:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:38:12,591 INFO L475 AbstractCegarLoop]: Abstraction has 20570 states and 21354 transitions. [2019-10-02 01:38:12,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:38:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20570 states and 21354 transitions. [2019-10-02 01:38:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1878 [2019-10-02 01:38:12,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:38:12,627 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:12,627 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:38:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:38:12,628 INFO L82 PathProgramCache]: Analyzing trace with hash -953580414, now seen corresponding path program 1 times [2019-10-02 01:38:12,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:38:12,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:38:12,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:38:12,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:38:12,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:38:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:38:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6684 backedges. 2764 proven. 1321 refuted. 0 times theorem prover too weak. 2599 trivial. 0 not checked. [2019-10-02 01:38:18,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:38:18,287 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:38:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:38:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:38:18,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 2375 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:38:18,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:38:18,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:38:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6684 backedges. 3602 proven. 2 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2019-10-02 01:38:20,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:38:20,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-10-02 01:38:20,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:38:20,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:38:20,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:38:20,198 INFO L87 Difference]: Start difference. First operand 20570 states and 21354 transitions. Second operand 18 states. [2019-10-02 01:38:31,093 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-02 01:38:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:38:31,614 INFO L93 Difference]: Finished difference Result 38503 states and 40090 transitions. [2019-10-02 01:38:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-02 01:38:31,615 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1877 [2019-10-02 01:38:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:38:31,653 INFO L225 Difference]: With dead ends: 38503 [2019-10-02 01:38:31,653 INFO L226 Difference]: Without dead ends: 20980 [2019-10-02 01:38:31,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1992 GetRequests, 1917 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1746 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=974, Invalid=4576, Unknown=0, NotChecked=0, Total=5550 [2019-10-02 01:38:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20980 states. [2019-10-02 01:38:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20980 to 20226. [2019-10-02 01:38:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20226 states. [2019-10-02 01:38:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 20885 transitions. [2019-10-02 01:38:31,935 INFO L78 Accepts]: Start accepts. Automaton has 20226 states and 20885 transitions. Word has length 1877 [2019-10-02 01:38:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:38:31,937 INFO L475 AbstractCegarLoop]: Abstraction has 20226 states and 20885 transitions. [2019-10-02 01:38:31,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:38:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 20226 states and 20885 transitions. [2019-10-02 01:38:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1949 [2019-10-02 01:38:31,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:38:31,976 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:31,977 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:38:31,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:38:31,977 INFO L82 PathProgramCache]: Analyzing trace with hash 716142179, now seen corresponding path program 1 times [2019-10-02 01:38:31,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:38:31,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:38:31,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:38:31,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:38:31,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:38:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:38:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 1310 proven. 5113 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2019-10-02 01:38:44,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:38:44,324 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:38:44,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:38:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:38:44,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:38:44,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:38:44,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:44,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:38:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 4455 proven. 2 refuted. 0 times theorem prover too weak. 2972 trivial. 0 not checked. [2019-10-02 01:38:46,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:38:46,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 5] total 37 [2019-10-02 01:38:46,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 01:38:46,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 01:38:46,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 01:38:46,689 INFO L87 Difference]: Start difference. First operand 20226 states and 20885 transitions. Second operand 37 states. [2019-10-02 01:38:48,882 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-10-02 01:38:49,950 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-10-02 01:38:50,403 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 35 [2019-10-02 01:38:52,738 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-10-02 01:38:54,907 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2019-10-02 01:38:55,218 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-10-02 01:38:57,148 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-10-02 01:38:58,914 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-10-02 01:38:59,124 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2019-10-02 01:39:00,202 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-10-02 01:39:05,958 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-10-02 01:39:06,974 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-10-02 01:39:08,312 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2019-10-02 01:39:08,515 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-02 01:39:09,080 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2019-10-02 01:39:13,638 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 38 [2019-10-02 01:39:17,436 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-10-02 01:39:23,835 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-10-02 01:39:27,553 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-10-02 01:39:28,602 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2019-10-02 01:39:29,753 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-10-02 01:39:30,326 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 34 [2019-10-02 01:39:30,905 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2019-10-02 01:39:31,478 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-02 01:39:32,165 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-10-02 01:39:32,437 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 31 [2019-10-02 01:39:34,266 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-10-02 01:39:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:39:37,195 INFO L93 Difference]: Finished difference Result 49740 states and 51704 transitions. [2019-10-02 01:39:37,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-10-02 01:39:37,195 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1948 [2019-10-02 01:39:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:39:37,236 INFO L225 Difference]: With dead ends: 49740 [2019-10-02 01:39:37,237 INFO L226 Difference]: Without dead ends: 30535 [2019-10-02 01:39:37,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2225 GetRequests, 2050 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11395 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=3603, Invalid=27197, Unknown=0, NotChecked=0, Total=30800 [2019-10-02 01:39:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30535 states. [2019-10-02 01:39:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30535 to 28760. [2019-10-02 01:39:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28760 states. [2019-10-02 01:39:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28760 states to 28760 states and 29573 transitions. [2019-10-02 01:39:37,561 INFO L78 Accepts]: Start accepts. Automaton has 28760 states and 29573 transitions. Word has length 1948 [2019-10-02 01:39:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:39:37,562 INFO L475 AbstractCegarLoop]: Abstraction has 28760 states and 29573 transitions. [2019-10-02 01:39:37,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 01:39:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28760 states and 29573 transitions. [2019-10-02 01:39:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2182 [2019-10-02 01:39:37,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:39:37,619 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:39:37,619 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:39:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:39:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1613220366, now seen corresponding path program 1 times [2019-10-02 01:39:37,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:39:37,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:39:37,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:39:37,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:39:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:39:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:39:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8936 backedges. 3139 proven. 1705 refuted. 0 times theorem prover too weak. 4092 trivial. 0 not checked. [2019-10-02 01:39:46,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:39:46,395 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:39:46,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:39:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:39:47,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 2715 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:39:47,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:39:47,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:39:47,868 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 299922))) (and (<= .cse0 (+ c_~a18~0 300079)) (= 0 .cse0)))) (exists ((v_~a18~0_912 Int)) (let ((.cse1 (mod v_~a18~0_912 299922))) (and (< v_~a18~0_912 0) (<= .cse1 (+ c_~a18~0 600001)) (not (= 0 .cse1))))) (exists ((v_prenex_1 Int)) (and (<= (mod v_prenex_1 299922) (+ c_~a18~0 300079)) (<= 0 v_prenex_1)))) is different from true [2019-10-02 01:39:48,680 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 299922))) (and (<= .cse0 (+ c_~a18~0 300079)) (= 0 .cse0)))) (exists ((v_~a18~0_912 Int)) (let ((.cse1 (mod v_~a18~0_912 299922))) (and (< v_~a18~0_912 0) (<= .cse1 (+ c_~a18~0 600001)) (not (= 0 .cse1))))) (exists ((v_prenex_2 Int)) (and (<= (mod v_prenex_2 299922) (+ c_~a18~0 300079)) (<= 0 v_prenex_2)))) is different from true [2019-10-02 01:39:48,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:39:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8936 backedges. 1498 proven. 33 refuted. 0 times theorem prover too weak. 7399 trivial. 6 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:39:51,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:39:51,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 23 [2019-10-02 01:39:51,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 01:39:51,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 01:39:51,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=353, Unknown=2, NotChecked=78, Total=506 [2019-10-02 01:39:51,259 INFO L87 Difference]: Start difference. First operand 28760 states and 29573 transitions. Second operand 23 states. [2019-10-02 01:40:10,517 WARN L191 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-10-02 01:40:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:40:14,117 INFO L93 Difference]: Finished difference Result 56542 states and 58199 transitions. [2019-10-02 01:40:14,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 01:40:14,118 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 2181 [2019-10-02 01:40:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:40:14,157 INFO L225 Difference]: With dead ends: 56542 [2019-10-02 01:40:14,157 INFO L226 Difference]: Without dead ends: 30461 [2019-10-02 01:40:14,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2281 GetRequests, 2215 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=808, Invalid=3103, Unknown=3, NotChecked=246, Total=4160 [2019-10-02 01:40:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30461 states. [2019-10-02 01:40:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30461 to 28762. [2019-10-02 01:40:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28762 states. [2019-10-02 01:40:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28762 states to 28762 states and 29559 transitions. [2019-10-02 01:40:14,441 INFO L78 Accepts]: Start accepts. Automaton has 28762 states and 29559 transitions. Word has length 2181 [2019-10-02 01:40:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:40:14,442 INFO L475 AbstractCegarLoop]: Abstraction has 28762 states and 29559 transitions. [2019-10-02 01:40:14,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 01:40:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 28762 states and 29559 transitions. [2019-10-02 01:40:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2645 [2019-10-02 01:40:14,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:40:14,526 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 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] [2019-10-02 01:40:14,526 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:40:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:40:14,527 INFO L82 PathProgramCache]: Analyzing trace with hash 370430616, now seen corresponding path program 1 times [2019-10-02 01:40:14,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:40:14,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:40:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:40:14,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:40:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:40:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:40:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11755 backedges. 4633 proven. 83 refuted. 0 times theorem prover too weak. 7039 trivial. 0 not checked. [2019-10-02 01:40:19,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:40:19,705 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:40:19,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:40:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:40:20,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 3287 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 01:40:20,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:40:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:40:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11755 backedges. 6613 proven. 2 refuted. 0 times theorem prover too weak. 5140 trivial. 0 not checked. [2019-10-02 01:40:23,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:40:23,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-10-02 01:40:23,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 01:40:23,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 01:40:23,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:40:23,517 INFO L87 Difference]: Start difference. First operand 28762 states and 29559 transitions. Second operand 13 states. [2019-10-02 01:40:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:40:32,089 INFO L93 Difference]: Finished difference Result 55154 states and 56725 transitions. [2019-10-02 01:40:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 01:40:32,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 2644 [2019-10-02 01:40:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:40:32,140 INFO L225 Difference]: With dead ends: 55154 [2019-10-02 01:40:32,140 INFO L226 Difference]: Without dead ends: 29110 [2019-10-02 01:40:32,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2714 GetRequests, 2674 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=1368, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 01:40:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29110 states. [2019-10-02 01:40:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29110 to 28761. [2019-10-02 01:40:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28761 states. [2019-10-02 01:40:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28761 states to 28761 states and 29516 transitions. [2019-10-02 01:40:32,441 INFO L78 Accepts]: Start accepts. Automaton has 28761 states and 29516 transitions. Word has length 2644 [2019-10-02 01:40:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:40:32,442 INFO L475 AbstractCegarLoop]: Abstraction has 28761 states and 29516 transitions. [2019-10-02 01:40:32,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 01:40:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 28761 states and 29516 transitions. [2019-10-02 01:40:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2885 [2019-10-02 01:40:32,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:40:32,508 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 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] [2019-10-02 01:40:32,509 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:40:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:40:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1984537433, now seen corresponding path program 1 times [2019-10-02 01:40:32,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:40:32,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:40:32,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:40:32,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:40:32,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:40:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:40:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14804 backedges. 4665 proven. 3210 refuted. 0 times theorem prover too weak. 6929 trivial. 0 not checked. [2019-10-02 01:40:43,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:40:43,035 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:40:43,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:40:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:40:43,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 3576 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:40:43,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:40:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14804 backedges. 3052 proven. 2 refuted. 0 times theorem prover too weak. 11750 trivial. 0 not checked. [2019-10-02 01:40:46,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:40:46,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 15 [2019-10-02 01:40:46,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:40:46,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:40:46,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:40:46,578 INFO L87 Difference]: Start difference. First operand 28761 states and 29516 transitions. Second operand 15 states. [2019-10-02 01:40:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:40:56,785 INFO L93 Difference]: Finished difference Result 56793 states and 58279 transitions. [2019-10-02 01:40:56,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 01:40:56,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 2884 [2019-10-02 01:40:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:40:56,788 INFO L225 Difference]: With dead ends: 56793 [2019-10-02 01:40:56,788 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:40:56,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2981 GetRequests, 2923 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=481, Invalid=2171, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 01:40:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:40:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:40:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:40:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:40:56,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2884 [2019-10-02 01:40:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:40:56,834 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:40:56,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:40:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:40:56,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:40:56,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:40:59,151 WARN L191 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 862 DAG size of output: 773 [2019-10-02 01:41:01,796 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 862 DAG size of output: 773 [2019-10-02 01:41:10,738 WARN L191 SmtUtils]: Spent 8.91 s on a formula simplification. DAG size of input: 760 DAG size of output: 159 [2019-10-02 01:41:16,846 WARN L191 SmtUtils]: Spent 6.00 s on a formula simplification. DAG size of input: 601 DAG size of output: 148 [2019-10-02 01:41:23,187 WARN L191 SmtUtils]: Spent 6.32 s on a formula simplification. DAG size of input: 590 DAG size of output: 148 [2019-10-02 01:41:30,486 WARN L191 SmtUtils]: Spent 7.28 s on a formula simplification. DAG size of input: 659 DAG size of output: 179 [2019-10-02 01:41:39,333 WARN L191 SmtUtils]: Spent 8.83 s on a formula simplification. DAG size of input: 760 DAG size of output: 159 [2019-10-02 01:41:39,336 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:41:39,336 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:41:39,336 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:41:39,336 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,337 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:41:39,337 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,337 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,337 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,337 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,337 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,337 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,338 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,339 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,340 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,340 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,340 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse23 (= 8 |old(~a12~0)|)) (.cse35 (= ~a12~0 7)) (.cse25 (= 7 |old(~a12~0)|)) (.cse30 (= 6 |old(~a12~0)|)) (.cse32 (= ~a16~0 12)) (.cse38 (= ~a12~0 6)) (.cse12 (= 12 |old(~a16~0)|)) (.cse37 (= 4 |old(~a15~0)|)) (.cse26 (= ~a12~0 |old(~a12~0)|)) (.cse29 (= ~a15~0 |old(~a15~0)|)) (.cse27 (= ~a16~0 |old(~a16~0)|)) (.cse33 (= ~a12~0 8)) (.cse28 (= ~a18~0 |old(~a18~0)|))) (let ((.cse6 (and .cse29 .cse27 .cse33 .cse28)) (.cse1 (and .cse26 .cse29 .cse27 .cse28)) (.cse2 (not (<= |old(~a12~0)| 5))) (.cse17 (or .cse12 .cse37)) (.cse9 (not (<= |old(~a18~0)| 134))) (.cse7 (not (= 9 |old(~a16~0)|))) (.cse3 (not (<= 0 (+ |old(~a18~0)| 155)))) (.cse34 (and .cse29 .cse28 .cse32 .cse38)) (.cse31 (not .cse12)) (.cse21 (not (= 5 |old(~a12~0)|))) (.cse22 (and (= ~a12~0 5) .cse29 .cse27 .cse28)) (.cse24 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse15 (not .cse30)) (.cse16 (and .cse29 .cse27 .cse28 .cse38)) (.cse14 (not (<= 0 (+ |old(~a18~0)| 600000)))) (.cse19 (not .cse25)) (.cse18 (and .cse29 .cse35 .cse27 .cse28)) (.cse0 (not (= 3 |old(~a15~0)|))) (.cse20 (not (<= (+ |old(~a18~0)| 79) 0))) (.cse5 (not .cse23)) (.cse13 (= 10 |old(~a16~0)|)) (.cse4 (not .cse37)) (.cse8 (not (= 8 |old(~a16~0)|))) (.cse36 (not (<= 57098 |old(~a18~0)|))) (.cse11 (and .cse29 .cse27 .cse28 (= ~a12~0 9))) (.cse10 (not (= 9 |old(~a12~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 .cse6 .cse7) (or .cse4 .cse8 .cse3 .cse9 .cse10 .cse11) (or .cse0 (or .cse12 .cse13) .cse3 .cse1) (or .cse14 .cse0 .cse15 .cse16 .cse17) (or .cse4 .cse8 .cse18 .cse19 .cse3) (or .cse4 .cse1 .cse12 .cse2 (not (<= 598710 |old(~a18~0)|))) (or (or .cse4 .cse12 .cse2) .cse1 .cse3 .cse20) (or .cse4 .cse8 .cse5 .cse9 .cse6 .cse3) (or .cse0 .cse21 .cse22 .cse7) (or .cse4 (not (<= (+ |old(~a18~0)| 80) 0)) .cse3 .cse1 .cse7) (or .cse14 .cse4 .cse1 .cse23 .cse7 .cse24) (or .cse14 .cse25 .cse0 (and .cse26 .cse27 .cse28 .cse29) (not (= 11 |old(~a16~0)|))) (or .cse30 .cse0 .cse31 .cse3 (and .cse26 .cse28 .cse32 .cse29)) (or .cse14 .cse4 .cse1 .cse12 .cse2 .cse24) (or (and .cse26 .cse27 .cse29) .cse8 .cse17) (or .cse14 .cse0 (or .cse30 .cse25 .cse31) (and (and .cse26 .cse28 .cse32) .cse29)) (or .cse0 .cse18 .cse19 .cse7) (or .cse0 .cse5 .cse7 (and (and .cse27 .cse33) .cse28 .cse29)) (or .cse0 .cse31 .cse34 .cse9 .cse15 .cse3) (or (or .cse4 (or .cse19 .cse7)) .cse3 (and (and (= ~a15~0 4) (= ~a16~0 9) .cse35) .cse28)) (or .cse34 .cse0 .cse31 .cse36 .cse15) (or .cse14 .cse4 .cse8 .cse21 .cse22) (or .cse14 .cse4 (and .cse33 .cse27 .cse28 .cse29) (or .cse8 .cse5 .cse24)) (or .cse14 .cse4 .cse12 .cse15 .cse16) (or .cse14 .cse4 .cse8 .cse19 (not (<= (+ |old(~a18~0)| 470) 0)) .cse18) (or (and .cse29 .cse33 .cse28 (= ~a16~0 10)) .cse0 (and (not (< 134 |old(~a18~0)|)) .cse20) .cse5 (not .cse13)) (or .cse4 .cse8 .cse36 .cse11 .cse10)))) [2019-10-02 01:41:39,340 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,341 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,342 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,343 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,344 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,344 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,344 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:41:39,344 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,344 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:41:39,344 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:41:39,345 INFO L439 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse10 (= 7 |old(~a12~0)|)) (.cse9 (= 6 |old(~a12~0)|)) (.cse12 (= ~a16~0 12)) (.cse33 (= ~a12~0 6)) (.cse31 (= 8 |old(~a12~0)|)) (.cse24 (= 12 |old(~a16~0)|)) (.cse42 (= 4 |old(~a15~0)|)) (.cse41 (= ~a12~0 7)) (.cse0 (= ~a12~0 |old(~a12~0)|)) (.cse3 (= ~a15~0 |old(~a15~0)|)) (.cse1 (= ~a16~0 |old(~a16~0)|)) (.cse37 (= ~a12~0 8)) (.cse2 (= ~a18~0 |old(~a18~0)|))) (let ((.cse18 (and .cse3 .cse1 .cse37 .cse2)) (.cse4 (< 134 ~a18~0)) (.cse20 (and .cse0 .cse3 .cse1 .cse2)) (.cse15 (not (= 11 |old(~a16~0)|))) (.cse14 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse29 (not (= 5 |old(~a12~0)|))) (.cse13 (not (= 3 calculate_output_~input))) (.cse30 (= ~a12~0 5)) (.cse22 (and .cse3 .cse41 .cse1 .cse2)) (.cse27 (not (<= |old(~a18~0)| 134))) (.cse8 (not (<= 0 (+ |old(~a18~0)| 600000)))) (.cse34 (or .cse24 .cse42)) (.cse25 (not (< 134 |old(~a18~0)|))) (.cse6 (not .cse31)) (.cse28 (= 10 |old(~a16~0)|)) (.cse5 (not (= 3 |old(~a15~0)|))) (.cse11 (not .cse24)) (.cse38 (and .cse3 .cse2 .cse12 .cse33)) (.cse26 (not .cse9)) (.cse21 (not (= 8 |old(~a16~0)|))) (.cse40 (not (<= 57098 |old(~a18~0)|))) (.cse35 (= ~a12~0 9)) (.cse36 (not (= 9 |old(~a12~0)|))) (.cse19 (not (<= |old(~a12~0)| 5))) (.cse39 (not (<= (+ |old(~a18~0)| 79) 0))) (.cse32 (= ~a16~0 9)) (.cse17 (not .cse42)) (.cse23 (not .cse10)) (.cse7 (not (= 9 |old(~a16~0)|))) (.cse16 (not (<= 0 (+ |old(~a18~0)| 155))))) (and (or (and (and (and .cse0 .cse1) .cse2 .cse3) (or (<= (+ ~a18~0 79) 0) .cse4)) .cse5 .cse6 .cse7) (or .cse8 .cse5 (or .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse12 .cse3)) (or .cse8 .cse13 (or .cse5 (or .cse6 .cse14)) .cse15) (or .cse9 .cse5 .cse11 .cse16 (and .cse0 .cse3 .cse2 .cse12)) (or .cse17 .cse6 .cse16 .cse18 .cse7) (or .cse5 .cse19 .cse16 .cse20) (or .cse17 .cse21 .cse22 .cse23 .cse16) (or .cse17 .cse24 .cse25 .cse26 (or (not (= ~a16~0 8)) .cse13)) (or .cse17 .cse20 .cse24 .cse19 (not (<= 598710 |old(~a18~0)|))) (or .cse17 .cse20 (not (<= (+ |old(~a18~0)| 80) 0)) .cse16 .cse7) (or .cse17 .cse21 .cse6 .cse27 .cse18 .cse16) (or .cse5 .cse20 (or .cse24 .cse28) .cse16) (or .cse5 .cse29 (and .cse30 .cse3 .cse1 .cse2) .cse7) (or .cse8 .cse17 .cse20 .cse31 .cse7 .cse14) (or .cse8 .cse17 .cse24 .cse26 (and (or (not .cse32) (not (= 1 calculate_output_~input)) .cse4) .cse3 .cse1 .cse2 .cse33)) (or (and .cse0 .cse1 .cse3) .cse21 .cse34) (or .cse8 .cse17 .cse24 .cse19 .cse20 .cse14) (or .cse17 .cse21 (and .cse3 .cse1 .cse13 .cse2 .cse35) .cse16 .cse27 .cse36) (or .cse8 .cse10 .cse5 .cse15 (and .cse0 .cse1 .cse2 .cse3)) (or .cse23 .cse5 .cse22 .cse7) (or .cse8 .cse17 (and .cse37 .cse1 .cse2 .cse3) (or .cse21 .cse6 .cse14)) (or .cse8 .cse17 .cse21 .cse29 (and (or (<= ~a18~0 134) .cse13) .cse30 .cse3 .cse1 .cse2)) (or .cse8 .cse17 .cse21 .cse23 (not (<= (+ |old(~a18~0)| 470) 0)) .cse22) (or .cse38 .cse5 .cse11 .cse27 .cse26 .cse16) (or .cse9 .cse5 .cse11 .cse25 (or (not (= calculate_output_~input 6)) (not .cse35))) (or .cse8 .cse5 (and .cse3 .cse1 .cse2 .cse33) .cse26 .cse34) (or .cse5 (and .cse25 .cse39) (and .cse3 .cse37 .cse2 (= ~a16~0 10)) .cse6 (not .cse28)) (or .cse5 .cse11 .cse40 .cse38 .cse26) (or .cse17 .cse21 .cse40 (and .cse3 .cse1 .cse2 .cse35) .cse36) (or (or .cse17 .cse24 .cse19) .cse16 .cse39 (and .cse2 (and (= ~a15~0 4) .cse0 .cse1))) (or (and (and .cse32 .cse41) .cse2 .cse3) (or .cse17 (or .cse23 .cse7)) .cse16)))) [2019-10-02 01:41:39,345 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,345 INFO L443 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2019-10-02 01:41:39,345 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,345 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,346 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,347 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,348 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,349 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,350 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,351 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,352 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,353 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,354 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,355 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,356 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:41:39,357 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:41:39,357 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,357 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,357 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,357 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,357 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,357 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,358 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse23 (= 8 |old(~a12~0)|)) (.cse34 (= ~a12~0 7)) (.cse25 (= 7 |old(~a12~0)|)) (.cse30 (= 6 |old(~a12~0)|)) (.cse32 (= ~a16~0 12)) (.cse38 (= ~a12~0 6)) (.cse12 (= 12 |old(~a16~0)|)) (.cse37 (= 4 |old(~a15~0)|)) (.cse26 (= ~a12~0 |old(~a12~0)|)) (.cse29 (= ~a15~0 |old(~a15~0)|)) (.cse27 (= ~a16~0 |old(~a16~0)|)) (.cse33 (= ~a12~0 8)) (.cse28 (= ~a18~0 |old(~a18~0)|))) (let ((.cse6 (and .cse29 .cse27 .cse33 .cse28)) (.cse1 (and .cse26 .cse29 .cse27 .cse28)) (.cse2 (not (<= |old(~a12~0)| 5))) (.cse17 (or .cse12 .cse37)) (.cse9 (not (<= |old(~a18~0)| 134))) (.cse3 (not (<= 0 (+ |old(~a18~0)| 155)))) (.cse7 (not (= 9 |old(~a16~0)|))) (.cse35 (and .cse29 .cse28 .cse32 .cse38)) (.cse31 (not .cse12)) (.cse21 (not (= 5 |old(~a12~0)|))) (.cse22 (and (= ~a12~0 5) .cse29 .cse27 .cse28)) (.cse24 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse15 (not .cse30)) (.cse16 (and .cse29 .cse27 .cse28 .cse38)) (.cse14 (not (<= 0 (+ |old(~a18~0)| 600000)))) (.cse19 (not .cse25)) (.cse18 (and .cse29 .cse34 .cse27 .cse28)) (.cse0 (not (= 3 |old(~a15~0)|))) (.cse20 (not (<= (+ |old(~a18~0)| 79) 0))) (.cse5 (not .cse23)) (.cse13 (= 10 |old(~a16~0)|)) (.cse4 (not .cse37)) (.cse8 (not (= 8 |old(~a16~0)|))) (.cse36 (not (<= 57098 |old(~a18~0)|))) (.cse11 (and .cse29 .cse27 .cse28 (= ~a12~0 9))) (.cse10 (not (= 9 |old(~a12~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 .cse6 .cse7) (or .cse4 .cse8 .cse3 .cse9 .cse10 .cse11) (or .cse0 (or .cse12 .cse13) .cse3 .cse1) (or .cse14 .cse0 .cse15 .cse16 .cse17) (or .cse4 .cse8 .cse18 .cse19 .cse3) (or .cse4 .cse1 .cse12 .cse2 (not (<= 598710 |old(~a18~0)|))) (or (or .cse4 .cse12 .cse2) .cse1 .cse3 .cse20) (or .cse4 .cse8 .cse5 .cse9 .cse6 .cse3) (or .cse0 .cse21 .cse22 .cse7) (or .cse4 (not (<= (+ |old(~a18~0)| 80) 0)) .cse3 .cse1 .cse7) (or .cse14 .cse4 .cse1 .cse23 .cse7 .cse24) (or .cse14 .cse25 .cse0 (and .cse26 .cse27 .cse28 .cse29) (not (= 11 |old(~a16~0)|))) (or .cse30 .cse0 .cse31 .cse3 (and .cse26 .cse28 .cse32 .cse29)) (or .cse14 .cse4 .cse1 .cse12 .cse2 .cse24) (or (and .cse26 .cse27 .cse29) .cse8 .cse17) (or .cse14 .cse0 (or .cse30 .cse25 .cse31) (and (and .cse26 .cse28 .cse32) .cse29)) (or .cse0 .cse5 .cse7 (and (and .cse27 .cse33) .cse28 .cse29)) (or (or .cse4 (or .cse19 .cse7)) .cse3 (and (and (= ~a15~0 4) (= ~a16~0 9) .cse34) .cse28)) (or .cse0 .cse31 .cse35 .cse9 .cse15 .cse3) (or .cse19 .cse0 .cse18 .cse7) (or .cse35 .cse0 .cse31 .cse36 .cse15) (or .cse14 .cse4 .cse8 .cse21 .cse22) (or .cse14 .cse4 (and .cse33 .cse27 .cse28 .cse29) (or .cse8 .cse5 .cse24)) (or .cse14 .cse4 .cse12 .cse15 .cse16) (or .cse14 .cse4 .cse8 .cse19 (not (<= (+ |old(~a18~0)| 470) 0)) .cse18) (or (and .cse29 .cse33 .cse28 (= ~a16~0 10)) .cse0 (and (not (< 134 |old(~a18~0)|)) .cse20) .cse5 (not .cse13)) (or .cse4 .cse8 .cse36 .cse11 .cse10)))) [2019-10-02 01:41:39,358 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2019-10-02 01:41:39,358 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,358 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,358 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,358 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,358 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,359 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,360 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,361 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,362 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:41:39,363 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,364 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:41:39,365 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,366 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,366 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,366 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,366 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,366 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,366 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,366 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,366 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,367 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:41:39,368 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,369 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,370 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,370 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,370 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,370 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,370 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,370 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:41:39,370 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:41:39,370 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,371 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,372 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,373 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,374 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,375 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:41:39,376 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,377 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,378 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:41:39,379 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,380 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,380 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-10-02 01:41:39,380 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:41:39,380 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a16~0 11) (= ~a15~0 3) (<= ~a12~0 5) (= (+ ~a18~0 87) 0)) [2019-10-02 01:41:39,380 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:41:39,380 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:41:39,380 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (not (= 3 |old(~a15~0)|)) (not (= 11 |old(~a16~0)|)) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|)) (not (= (+ |old(~a18~0)| 87) 0)) (not (<= |old(~a12~0)| 5))) [2019-10-02 01:41:39,380 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:41:39,381 INFO L439 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse13 (= ~a12~0 6))) (let ((.cse28 (not .cse13)) (.cse12 (not (= 12 ~a16~0))) (.cse9 (= ~a12~0 8))) (let ((.cse31 (= ~a16~0 10)) (.cse5 (and .cse28 .cse12 (not .cse9))) (.cse32 (not (= 4 ~a15~0)))) (let ((.cse35 (and .cse5 .cse32)) (.cse36 (not .cse31)) (.cse33 (<= 9 |old(~a16~0)|))) (let ((.cse18 (= ~a16~0 12)) (.cse6 (or (and (<= 5 |old(~a12~0)|) (<= 10 |old(~a16~0)|)) (and (<= 9 |old(~a12~0)|) .cse33))) (.cse20 (and (and .cse36 .cse12 .cse32) .cse9)) (.cse1 (= ~a16~0 8)) (.cse29 (not (= 7 ~a12~0))) (.cse23 (<= ~a12~0 5)) (.cse11 (= ~a15~0 3)) (.cse15 (= ~a12~0 7)) (.cse34 (and .cse36 .cse35))) (let ((.cse17 (and .cse11 (and .cse15 .cse34))) (.cse16 (and (and .cse23 .cse35) .cse11)) (.cse19 (= ~a16~0 11)) (.cse10 (and .cse29 .cse34)) (.cse21 (<= 57098 ~a18~0)) (.cse25 (= ~a12~0 9)) (.cse26 (and .cse1 .cse5 .cse29 .cse33)) (.cse8 (and .cse20 .cse11)) (.cse4 (= ~a16~0 9)) (.cse27 (= ~a12~0 5)) (.cse3 (= ~a15~0 4)) (.cse14 (and .cse12 .cse32)) (.cse24 (<= ~a18~0 134)) (.cse7 (<= 0 (+ ~a18~0 155))) (.cse22 (and (and .cse11 .cse18) .cse6)) (.cse30 (<= (+ ~a18~0 79) 0)) (.cse0 (<= 0 (+ ~a18~0 600000))) (.cse2 (or (= 5 |old(~a12~0)|) (= 9 |old(~a12~0)|)))) (or (not (= 11 |old(~a16~0)|)) (not (= (+ |old(~a18~0)| 87) 0)) (and .cse0 (and .cse1 (<= ~a12~0 8) (<= (+ ~a18~0 470) 0)) .cse2) (not (= 3 |old(~a15~0)|)) (and .cse3 .cse4 .cse0 (and .cse5 (<= (+ ~a18~0 80) 0)) .cse6) (and .cse7 (and .cse8 .cse6)) (and .cse3 .cse4 .cse7 .cse9 .cse2) (and (and .cse10 .cse11) .cse7 .cse6) (and .cse3 .cse12 .cse0 .cse6 .cse13) (and .cse1 .cse14) (and (and .cse3 (and .cse15 .cse4 .cse6)) .cse0) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|)) (and .cse16 .cse7 .cse6) (and .cse7 (and (and .cse1 .cse15) .cse6)) (and .cse17 .cse4 .cse6) (not (<= |old(~a12~0)| 5)) (and .cse7 (and (and .cse11 .cse15 .cse18) .cse6)) (and .cse19 .cse0 (and (and .cse11 .cse20) .cse6)) (and .cse7 .cse17 .cse6) (and .cse21 .cse22) (and .cse3 (<= 598710 ~a18~0) (and .cse5 .cse23) .cse2) (and .cse24 .cse7 .cse6 .cse25 .cse26) (and .cse16 .cse4 .cse27 .cse6) (and .cse19 (and .cse11 .cse10) .cse0 .cse6) (and .cse21 .cse6 .cse25 .cse26) (and .cse1 .cse24 .cse7 .cse9 .cse2) (and .cse8 .cse4 .cse6) (and (and (and .cse28 .cse11 .cse18 .cse29) .cse6) .cse0) (and (and .cse1 .cse27) .cse0 .cse6) (and .cse0 .cse30 (and .cse3 .cse5 (<= ~a12~0 6) .cse6)) (and .cse0 (and .cse11 .cse14) .cse6 .cse13) (and .cse24 .cse7 .cse22) (and .cse11 .cse9 .cse31 .cse6 (or .cse30 (< 134 ~a18~0))) (and .cse0 (and .cse1 (<= (+ ~a18~0 156) 0) .cse9) .cse2)))))))) [2019-10-02 01:41:39,381 INFO L443 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2019-10-02 01:41:39,381 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-10-02 01:41:39,382 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse13 (= ~a12~0 6))) (let ((.cse28 (not .cse13)) (.cse12 (not (= 12 ~a16~0))) (.cse9 (= ~a12~0 8))) (let ((.cse31 (= ~a16~0 10)) (.cse5 (and .cse28 .cse12 (not .cse9))) (.cse32 (not (= 4 ~a15~0)))) (let ((.cse35 (and .cse5 .cse32)) (.cse36 (not .cse31)) (.cse33 (<= 9 |old(~a16~0)|))) (let ((.cse18 (= ~a16~0 12)) (.cse6 (or (and (<= 5 |old(~a12~0)|) (<= 10 |old(~a16~0)|)) (and (<= 9 |old(~a12~0)|) .cse33))) (.cse20 (and (and .cse36 .cse12 .cse32) .cse9)) (.cse1 (= ~a16~0 8)) (.cse29 (not (= 7 ~a12~0))) (.cse23 (<= ~a12~0 5)) (.cse11 (= ~a15~0 3)) (.cse15 (= ~a12~0 7)) (.cse34 (and .cse36 .cse35))) (let ((.cse17 (and .cse11 (and .cse15 .cse34))) (.cse16 (and (and .cse23 .cse35) .cse11)) (.cse19 (= ~a16~0 11)) (.cse10 (and .cse29 .cse34)) (.cse21 (<= 57098 ~a18~0)) (.cse25 (= ~a12~0 9)) (.cse26 (and .cse1 .cse5 .cse29 .cse33)) (.cse8 (and .cse20 .cse11)) (.cse4 (= ~a16~0 9)) (.cse27 (= ~a12~0 5)) (.cse3 (= ~a15~0 4)) (.cse14 (and .cse12 .cse32)) (.cse24 (<= ~a18~0 134)) (.cse7 (<= 0 (+ ~a18~0 155))) (.cse22 (and (and .cse11 .cse18) .cse6)) (.cse30 (<= (+ ~a18~0 79) 0)) (.cse0 (<= 0 (+ ~a18~0 600000))) (.cse2 (or (= 5 |old(~a12~0)|) (= 9 |old(~a12~0)|)))) (or (not (= 11 |old(~a16~0)|)) (not (= (+ |old(~a18~0)| 87) 0)) (and .cse0 (and .cse1 (<= ~a12~0 8) (<= (+ ~a18~0 470) 0)) .cse2) (not (= 3 |old(~a15~0)|)) (and .cse3 .cse4 .cse0 (and .cse5 (<= (+ ~a18~0 80) 0)) .cse6) (and .cse7 (and .cse8 .cse6)) (and .cse3 .cse4 .cse7 .cse9 .cse2) (and (and .cse10 .cse11) .cse7 .cse6) (and .cse3 .cse12 .cse0 .cse6 .cse13) (and .cse1 .cse14) (and (and .cse3 (and .cse15 .cse4 .cse6)) .cse0) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|)) (and .cse16 .cse7 .cse6) (and .cse7 (and (and .cse1 .cse15) .cse6)) (and .cse17 .cse4 .cse6) (not (<= |old(~a12~0)| 5)) (and .cse7 (and (and .cse11 .cse15 .cse18) .cse6)) (and .cse19 .cse0 (and (and .cse11 .cse20) .cse6)) (and .cse7 .cse17 .cse6) (and .cse21 .cse22) (and .cse3 (<= 598710 ~a18~0) (and .cse5 .cse23) .cse2) (and .cse24 .cse7 .cse6 .cse25 .cse26) (and .cse16 .cse4 .cse27 .cse6) (and .cse19 (and .cse11 .cse10) .cse0 .cse6) (and .cse21 .cse6 .cse25 .cse26) (and .cse1 .cse24 .cse7 .cse9 .cse2) (and .cse8 .cse4 .cse6) (and (and (and .cse28 .cse11 .cse18 .cse29) .cse6) .cse0) (and (and .cse1 .cse27) .cse0 .cse6) (and .cse0 .cse30 (and .cse3 .cse5 (<= ~a12~0 6) .cse6)) (and .cse0 (and .cse11 .cse14) .cse6 .cse13) (and .cse24 .cse7 .cse22) (and .cse11 .cse9 .cse31 .cse6 (or .cse30 (< 134 ~a18~0))) (and .cse0 (and .cse1 (<= (+ ~a18~0 156) 0) .cse9) .cse2)))))))) [2019-10-02 01:41:39,382 INFO L443 ceAbstractionStarter]: For program point L1773-3(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:41:39,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:41:39 BoogieIcfgContainer [2019-10-02 01:41:39,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:41:39,425 INFO L168 Benchmark]: Toolchain (without parser) took 342555.19 ms. Allocated memory was 133.2 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 83.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:41:39,425 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 133.2 MB. Free memory was 106.7 MB in the beginning and 106.5 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:41:39,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1276.79 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 83.0 MB in the beginning and 120.0 MB in the end (delta: -37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2019-10-02 01:41:39,427 INFO L168 Benchmark]: Boogie Preprocessor took 155.43 ms. Allocated memory is still 201.9 MB. Free memory was 120.0 MB in the beginning and 109.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-10-02 01:41:39,427 INFO L168 Benchmark]: RCFGBuilder took 2279.64 ms. Allocated memory was 201.9 MB in the beginning and 271.6 MB in the end (delta: 69.7 MB). Free memory was 109.8 MB in the beginning and 140.1 MB in the end (delta: -30.3 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. [2019-10-02 01:41:39,428 INFO L168 Benchmark]: TraceAbstraction took 338839.00 ms. Allocated memory was 271.6 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 140.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-02 01:41:39,431 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.45 ms. Allocated memory is still 133.2 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1276.79 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 83.0 MB in the beginning and 120.0 MB in the end (delta: -37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.43 ms. Allocated memory is still 201.9 MB. Free memory was 120.0 MB in the beginning and 109.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2279.64 ms. Allocated memory was 201.9 MB in the beginning and 271.6 MB in the end (delta: 69.7 MB). Free memory was 109.8 MB in the beginning and 140.1 MB in the end (delta: -30.3 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 338839.00 ms. Allocated memory was 271.6 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 140.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: 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: 1773]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((!(11 == \old(a16)) || !(\old(a18) + 87 == 0)) || ((0 <= a18 + 600000 && (a16 == 8 && a12 <= 8) && a18 + 470 <= 0) && (5 == \old(a12) || 9 == \old(a12)))) || !(3 == \old(a15))) || ((((a15 == 4 && a16 == 9) && 0 <= a18 + 600000) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && a18 + 80 <= 0) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (0 <= a18 + 155 && ((((!(a16 == 10) && !(12 == a16)) && !(4 == a15)) && a12 == 8) && a15 == 3) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((((a15 == 4 && a16 == 9) && 0 <= a18 + 155) && a12 == 8) && (5 == \old(a12) || 9 == \old(a12)))) || ((((!(7 == a12) && !(a16 == 10) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a15 == 3) && 0 <= a18 + 155) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((((a15 == 4 && !(12 == a16)) && 0 <= a18 + 600000) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 6)) || (a16 == 8 && !(12 == a16) && !(4 == a15))) || ((a15 == 4 && (a12 == 7 && a16 == 9) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && 0 <= a18 + 600000)) || (((a12 == \old(a12) && a15 == \old(a15)) && a16 == \old(a16)) && a18 == \old(a18))) || ((((a12 <= 5 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a15 == 3) && 0 <= a18 + 155) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (0 <= a18 + 155 && (a16 == 8 && a12 == 7) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (((a15 == 3 && a12 == 7 && !(a16 == 10) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a16 == 9) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || !(\old(a12) <= 5)) || (0 <= a18 + 155 && ((a15 == 3 && a12 == 7) && a16 == 12) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((a16 == 11 && 0 <= a18 + 600000) && (a15 == 3 && ((!(a16 == 10) && !(12 == a16)) && !(4 == a15)) && a12 == 8) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((0 <= a18 + 155 && a15 == 3 && a12 == 7 && !(a16 == 10) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (57098 <= a18 && (a15 == 3 && a16 == 12) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (((a15 == 4 && 598710 <= a18) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && a12 <= 5) && (5 == \old(a12) || 9 == \old(a12)))) || ((((a18 <= 134 && 0 <= a18 + 155) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 9) && ((a16 == 8 && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(7 == a12)) && 9 <= \old(a16))) || (((((a12 <= 5 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a15 == 3) && a16 == 9) && a12 == 5) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (((a16 == 11 && a15 == 3 && !(7 == a12) && !(a16 == 10) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 0 <= a18 + 600000) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (((57098 <= a18 && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 9) && ((a16 == 8 && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(7 == a12)) && 9 <= \old(a16))) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && a12 == 8) && (5 == \old(a12) || 9 == \old(a12)))) || ((((((!(a16 == 10) && !(12 == a16)) && !(4 == a15)) && a12 == 8) && a15 == 3) && a16 == 9) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (((((!(a12 == 6) && a15 == 3) && a16 == 12) && !(7 == a12)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && 0 <= a18 + 600000)) || (((a16 == 8 && a12 == 5) && 0 <= a18 + 600000) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((0 <= a18 + 600000 && a18 + 79 <= 0) && ((a15 == 4 && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && a12 <= 6) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || (((0 <= a18 + 600000 && a15 == 3 && !(12 == a16) && !(4 == a15)) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && a12 == 6)) || ((a18 <= 134 && 0 <= a18 + 155) && (a15 == 3 && a16 == 12) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16))))) || ((((a15 == 3 && a12 == 8) && a16 == 10) && ((5 <= \old(a12) && 10 <= \old(a16)) || (9 <= \old(a12) && 9 <= \old(a16)))) && (a18 + 79 <= 0 || 134 < a18))) || ((0 <= a18 + 600000 && (a16 == 8 && a18 + 156 <= 0) && a12 == 8) && (5 == \old(a12) || 9 == \old(a12))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 409 locations, 1 error locations. SAFE Result, 338.7s OverallTime, 18 OverallIterations, 15 TraceHistogramMax, 197.9s AutomataDifference, 0.0s DeadEndRemovalTime, 42.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1290 SDtfs, 91374 SDslu, 6145 SDs, 0 SdLazy, 164508 SolverSat, 16496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21435 GetRequests, 20651 SyntacticMatches, 22 SemanticMatches, 762 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 23476 ImplicationChecksByTransitivity, 47.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28762occurred in iteration=16, 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: 3.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 14014 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 2305 PreInvPairs, 2619 NumberOfFragments, 5141 HoareAnnotationTreeSize, 2305 FomulaSimplifications, 1116306 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 9 FomulaSimplificationsInter, 559811 FormulaSimplificationTreeSizeReductionInter, 37.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 40831 NumberOfCodeBlocks, 40831 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 40799 ConstructedInterpolants, 12 QuantifiedInterpolants, 295372984 SizeOfPredicates, 8 NumberOfNonLiveVariables, 26050 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 121523/137034 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...