./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/aviad_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/aviad_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1c10aefceff4fe6e12a2ebf53b3727fe6584e20c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:41:51,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:41:51,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:41:51,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:41:51,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:41:51,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:41:51,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:41:51,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:41:51,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:41:51,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:41:51,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:41:51,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:41:51,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:41:51,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:41:51,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:41:51,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:41:51,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:41:51,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:41:51,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:41:51,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:41:51,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:41:51,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:41:51,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:41:51,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:41:51,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:41:51,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:41:51,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:41:51,780 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:41:51,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:41:51,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:41:51,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:41:51,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:41:51,783 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:41:51,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:41:51,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:41:51,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:41:51,786 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:41:51,814 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:41:51,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:41:51,817 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:41:51,817 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:41:51,817 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:41:51,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:41:51,817 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:41:51,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:41:51,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:41:51,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:41:51,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:41:51,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:41:51,820 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:41:51,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:41:51,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:41:51,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:41:51,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:41:51,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:41:51,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:41:51,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:41:51,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:41:51,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:41:51,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:41:51,824 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:41:51,824 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:41:51,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:41:51,824 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c10aefceff4fe6e12a2ebf53b3727fe6584e20c [2019-01-14 21:41:51,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:41:51,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:41:51,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:41:51,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:41:51,909 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:41:51,910 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/aviad_true-termination_true-no-overflow.c [2019-01-14 21:41:51,960 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86ad91ba/c366f89937ab4f3c80caaf138751c411/FLAG76d4e2a84 [2019-01-14 21:41:52,378 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:41:52,378 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/aviad_true-termination_true-no-overflow.c [2019-01-14 21:41:52,385 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86ad91ba/c366f89937ab4f3c80caaf138751c411/FLAG76d4e2a84 [2019-01-14 21:41:52,738 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86ad91ba/c366f89937ab4f3c80caaf138751c411 [2019-01-14 21:41:52,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:41:52,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:41:52,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:41:52,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:41:52,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:41:52,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:41:52" (1/1) ... [2019-01-14 21:41:52,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:52, skipping insertion in model container [2019-01-14 21:41:52,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:41:52" (1/1) ... [2019-01-14 21:41:52,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:41:52,778 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:41:52,972 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:41:52,981 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:41:53,003 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:41:53,028 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:41:53,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53 WrapperNode [2019-01-14 21:41:53,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:41:53,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:41:53,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:41:53,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:41:53,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:41:53,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:41:53,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:41:53,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:41:53,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (1/1) ... [2019-01-14 21:41:53,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:41:53,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:41:53,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:41:53,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:41:53,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (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-01-14 21:41:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:41:53,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:41:53,570 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:41:53,570 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 21:41:53,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:41:53 BoogieIcfgContainer [2019-01-14 21:41:53,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:41:53,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:41:53,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:41:53,575 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:41:53,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:41:52" (1/3) ... [2019-01-14 21:41:53,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503b154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:41:53, skipping insertion in model container [2019-01-14 21:41:53,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:53" (2/3) ... [2019-01-14 21:41:53,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503b154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:41:53, skipping insertion in model container [2019-01-14 21:41:53,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:41:53" (3/3) ... [2019-01-14 21:41:53,579 INFO L112 eAbstractionObserver]: Analyzing ICFG aviad_true-termination_true-no-overflow.c [2019-01-14 21:41:53,589 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:41:53,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 21:41:53,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 21:41:53,645 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:41:53,646 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:41:53,646 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:41:53,646 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:41:53,646 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:41:53,647 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:41:53,647 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:41:53,647 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:41:53,647 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:41:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-14 21:41:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 21:41:53,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:53,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 21:41:53,671 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:53,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash 963531, now seen corresponding path program 1 times [2019-01-14 21:41:53,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:53,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:53,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:53,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:53,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:53,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:53,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:41:53,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:41:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:41:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:53,849 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-01-14 21:41:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:53,939 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-14 21:41:53,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:41:53,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 21:41:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:53,949 INFO L225 Difference]: With dead ends: 26 [2019-01-14 21:41:53,949 INFO L226 Difference]: Without dead ends: 14 [2019-01-14 21:41:53,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-14 21:41:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-14 21:41:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-14 21:41:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 21:41:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-14 21:41:53,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2019-01-14 21:41:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:53,980 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-14 21:41:53,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:41:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-14 21:41:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:41:53,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:53,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:41:53,982 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash 29869514, now seen corresponding path program 1 times [2019-01-14 21:41:53,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:53,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:53,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:53,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:53,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:54,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:54,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:41:54,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:41:54,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:41:54,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:54,024 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-01-14 21:41:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:54,089 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-01-14 21:41:54,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:41:54,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 21:41:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:54,091 INFO L225 Difference]: With dead ends: 14 [2019-01-14 21:41:54,091 INFO L226 Difference]: Without dead ends: 12 [2019-01-14 21:41:54,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 21:41:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-14 21:41:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 21:41:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 21:41:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-14 21:41:54,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 5 [2019-01-14 21:41:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:54,096 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 21:41:54,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:41:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-14 21:41:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 21:41:54,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:54,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:41:54,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:54,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1360166356, now seen corresponding path program 1 times [2019-01-14 21:41:54,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:54,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:54,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:54,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:54,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:54,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:54,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:41:54,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:41:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:41:54,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:41:54,187 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 4 states. [2019-01-14 21:41:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:54,259 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-01-14 21:41:54,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:41:54,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-14 21:41:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:54,260 INFO L225 Difference]: With dead ends: 23 [2019-01-14 21:41:54,260 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 21:41:54,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:41:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 21:41:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-01-14 21:41:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 21:41:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-14 21:41:54,267 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2019-01-14 21:41:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:54,267 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-14 21:41:54,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:41:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-01-14 21:41:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 21:41:54,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:54,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:41:54,269 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:54,269 INFO L82 PathProgramCache]: Analyzing trace with hash 784515983, now seen corresponding path program 1 times [2019-01-14 21:41:54,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:54,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:54,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:54,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:54,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:41:54,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:41:54,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:41:54,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:41:54,334 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2019-01-14 21:41:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:54,376 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-01-14 21:41:54,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:41:54,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-14 21:41:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:54,378 INFO L225 Difference]: With dead ends: 20 [2019-01-14 21:41:54,378 INFO L226 Difference]: Without dead ends: 19 [2019-01-14 21:41:54,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:41:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-14 21:41:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-14 21:41:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 21:41:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-01-14 21:41:54,384 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 8 [2019-01-14 21:41:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:54,384 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-14 21:41:54,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:41:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-01-14 21:41:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 21:41:54,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:54,386 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 21:41:54,387 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:54,387 INFO L82 PathProgramCache]: Analyzing trace with hash -938741348, now seen corresponding path program 1 times [2019-01-14 21:41:54,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:54,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:54,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:54,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:54,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:54,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:41:54,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:41:54,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:54,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:41:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:54,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:41:54,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 21:41:54,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:41:54,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:41:54,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:41:54,741 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2019-01-14 21:41:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:54,870 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-14 21:41:54,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:41:54,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 21:41:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:54,872 INFO L225 Difference]: With dead ends: 30 [2019-01-14 21:41:54,872 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 21:41:54,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:41:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 21:41:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-14 21:41:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 21:41:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-01-14 21:41:54,879 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 14 [2019-01-14 21:41:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:54,880 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-14 21:41:54,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:41:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-01-14 21:41:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 21:41:54,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:54,881 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 21:41:54,881 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash -433699796, now seen corresponding path program 2 times [2019-01-14 21:41:54,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:54,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:54,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:54,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:55,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:41:55,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:41:55,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:41:55,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:41:55,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:41:55,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:41:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:55,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:41:55,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:41:55,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:41:55,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:41:55,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:41:55,102 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2019-01-14 21:41:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:55,350 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-14 21:41:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:41:55,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-01-14 21:41:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:55,353 INFO L225 Difference]: With dead ends: 39 [2019-01-14 21:41:55,353 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 21:41:55,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:41:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 21:41:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-14 21:41:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 21:41:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-01-14 21:41:55,360 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-01-14 21:41:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:55,360 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 21:41:55,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:41:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-01-14 21:41:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 21:41:55,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:55,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-14 21:41:55,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:55,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash 634711964, now seen corresponding path program 3 times [2019-01-14 21:41:55,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:55,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:55,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:55,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:41:55,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:55,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:41:55,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:41:55,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:41:55,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 21:41:55,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:41:55,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:41:55,786 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2019-01-14 21:41:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 21:41:56,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:41:56,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2019-01-14 21:41:56,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 21:41:56,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 21:41:56,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:41:56,243 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 14 states. [2019-01-14 21:41:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:57,800 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2019-01-14 21:41:57,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 21:41:57,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-01-14 21:41:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:57,803 INFO L225 Difference]: With dead ends: 94 [2019-01-14 21:41:57,803 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 21:41:57,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:41:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 21:41:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-14 21:41:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 21:41:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-01-14 21:41:57,830 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 28 [2019-01-14 21:41:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:57,832 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-01-14 21:41:57,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 21:41:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-01-14 21:41:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 21:41:57,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:57,834 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1] [2019-01-14 21:41:57,835 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash -262032200, now seen corresponding path program 1 times [2019-01-14 21:41:57,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:57,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:57,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:57,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:41:57,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:58,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:41:58,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:41:58,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:58,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:41:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:58,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:41:58,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 21:41:58,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:41:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:41:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:41:58,336 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 12 states. [2019-01-14 21:41:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:58,737 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-01-14 21:41:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:41:58,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-01-14 21:41:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:58,739 INFO L225 Difference]: With dead ends: 85 [2019-01-14 21:41:58,739 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 21:41:58,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-14 21:41:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 21:41:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-01-14 21:41:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-14 21:41:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2019-01-14 21:41:58,750 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 35 [2019-01-14 21:41:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:58,752 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2019-01-14 21:41:58,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:41:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2019-01-14 21:41:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 21:41:58,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:58,754 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1] [2019-01-14 21:41:58,754 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2052543542, now seen corresponding path program 2 times [2019-01-14 21:41:58,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:58,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:58,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:58,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:58,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:58,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:41:58,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:41:58,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:41:58,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:41:58,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:41:58,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:41:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:59,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:41:59,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 21:41:59,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 21:41:59,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 21:41:59,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:41:59,012 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 14 states. [2019-01-14 21:41:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:59,175 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2019-01-14 21:41:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 21:41:59,177 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-01-14 21:41:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:59,178 INFO L225 Difference]: With dead ends: 99 [2019-01-14 21:41:59,178 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 21:41:59,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:41:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 21:41:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-01-14 21:41:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 21:41:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-01-14 21:41:59,192 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 42 [2019-01-14 21:41:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:59,192 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-01-14 21:41:59,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 21:41:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-01-14 21:41:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 21:41:59,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:59,195 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1] [2019-01-14 21:41:59,211 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 639261246, now seen corresponding path program 3 times [2019-01-14 21:41:59,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:59,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:41:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:59,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:41:59,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:41:59,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:41:59,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 21:41:59,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:41:59,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:41:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:59,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:41:59,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-14 21:41:59,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 21:41:59,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 21:41:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 21:41:59,574 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 16 states. [2019-01-14 21:41:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:59,714 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2019-01-14 21:41:59,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 21:41:59,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-01-14 21:41:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:59,717 INFO L225 Difference]: With dead ends: 113 [2019-01-14 21:41:59,717 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 21:41:59,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-01-14 21:41:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 21:41:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-01-14 21:41:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 21:41:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-01-14 21:41:59,728 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 49 [2019-01-14 21:41:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:59,729 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-01-14 21:41:59,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 21:41:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-01-14 21:41:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 21:41:59,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:59,730 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1] [2019-01-14 21:41:59,731 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1924785028, now seen corresponding path program 4 times [2019-01-14 21:41:59,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:59,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:59,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:41:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:00,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:00,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:00,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:42:00,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:42:00,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:00,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:00,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:00,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-14 21:42:00,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 21:42:00,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 21:42:00,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 21:42:00,392 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 18 states. [2019-01-14 21:42:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:00,638 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-01-14 21:42:00,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 21:42:00,639 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-01-14 21:42:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:00,641 INFO L225 Difference]: With dead ends: 127 [2019-01-14 21:42:00,642 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 21:42:00,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-01-14 21:42:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 21:42:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-01-14 21:42:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-14 21:42:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-01-14 21:42:00,653 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 56 [2019-01-14 21:42:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:00,653 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-01-14 21:42:00,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 21:42:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-01-14 21:42:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 21:42:00,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:00,655 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1] [2019-01-14 21:42:00,655 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:00,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1848106308, now seen corresponding path program 5 times [2019-01-14 21:42:00,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:00,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:00,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:00,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:00,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:00,989 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:42:01,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-14 21:42:01,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:01,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:01,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:01,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-14 21:42:01,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 21:42:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 21:42:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 21:42:01,121 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 20 states. [2019-01-14 21:42:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:01,409 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2019-01-14 21:42:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 21:42:01,410 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2019-01-14 21:42:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:01,412 INFO L225 Difference]: With dead ends: 141 [2019-01-14 21:42:01,412 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 21:42:01,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2019-01-14 21:42:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 21:42:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-01-14 21:42:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-14 21:42:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2019-01-14 21:42:01,422 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 63 [2019-01-14 21:42:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:01,423 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2019-01-14 21:42:01,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 21:42:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2019-01-14 21:42:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 21:42:01,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:01,424 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1] [2019-01-14 21:42:01,425 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:01,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:01,425 INFO L82 PathProgramCache]: Analyzing trace with hash 457838014, now seen corresponding path program 6 times [2019-01-14 21:42:01,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:01,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:01,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:01,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:01,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:01,713 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:42:01,756 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 21:42:01,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:01,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:01,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:01,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-14 21:42:01,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 21:42:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 21:42:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 21:42:01,806 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 22 states. [2019-01-14 21:42:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:02,065 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2019-01-14 21:42:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 21:42:02,066 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2019-01-14 21:42:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:02,068 INFO L225 Difference]: With dead ends: 155 [2019-01-14 21:42:02,068 INFO L226 Difference]: Without dead ends: 154 [2019-01-14 21:42:02,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=686, Unknown=0, NotChecked=0, Total=992 [2019-01-14 21:42:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-14 21:42:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-01-14 21:42:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-14 21:42:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2019-01-14 21:42:02,079 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 70 [2019-01-14 21:42:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:02,080 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2019-01-14 21:42:02,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 21:42:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2019-01-14 21:42:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 21:42:02,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:02,081 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 6, 6, 6, 5, 5, 5, 1, 1] [2019-01-14 21:42:02,082 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:02,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2113445322, now seen corresponding path program 7 times [2019-01-14 21:42:02,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:02,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:02,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:02,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:02,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:03,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:03,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:03,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:03,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:03,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:03,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-14 21:42:03,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 21:42:03,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 21:42:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 21:42:03,407 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 24 states. [2019-01-14 21:42:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:03,723 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2019-01-14 21:42:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 21:42:03,724 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2019-01-14 21:42:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:03,725 INFO L225 Difference]: With dead ends: 169 [2019-01-14 21:42:03,726 INFO L226 Difference]: Without dead ends: 168 [2019-01-14 21:42:03,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=364, Invalid=826, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 21:42:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-14 21:42:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-01-14 21:42:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-14 21:42:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2019-01-14 21:42:03,734 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 77 [2019-01-14 21:42:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:03,734 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2019-01-14 21:42:03,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 21:42:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2019-01-14 21:42:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 21:42:03,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:03,736 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 6, 6, 6, 6, 6, 6, 1, 1] [2019-01-14 21:42:03,737 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash -486618504, now seen corresponding path program 8 times [2019-01-14 21:42:03,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:03,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:03,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:03,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:03,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:04,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:04,274 INFO L223 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-01-14 21:42:04,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:42:04,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:42:04,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:04,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:04,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:04,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-14 21:42:04,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 21:42:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 21:42:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 21:42:04,371 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 26 states. [2019-01-14 21:42:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:04,864 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2019-01-14 21:42:04,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 21:42:04,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2019-01-14 21:42:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:04,869 INFO L225 Difference]: With dead ends: 183 [2019-01-14 21:42:04,869 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 21:42:04,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=427, Invalid=979, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 21:42:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 21:42:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-01-14 21:42:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 21:42:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2019-01-14 21:42:04,879 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 84 [2019-01-14 21:42:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:04,881 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2019-01-14 21:42:04,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 21:42:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2019-01-14 21:42:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 21:42:04,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:04,884 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 7, 7, 7, 6, 6, 6, 1, 1] [2019-01-14 21:42:04,884 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:04,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:04,885 INFO L82 PathProgramCache]: Analyzing trace with hash 978516944, now seen corresponding path program 9 times [2019-01-14 21:42:04,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:04,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:04,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:04,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:05,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:05,384 INFO L223 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-01-14 21:42:05,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:42:05,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-14 21:42:05,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:05,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:05,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:05,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-14 21:42:05,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 21:42:05,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 21:42:05,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 21:42:05,489 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 28 states. [2019-01-14 21:42:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:05,840 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2019-01-14 21:42:05,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 21:42:05,841 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-01-14 21:42:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:05,844 INFO L225 Difference]: With dead ends: 197 [2019-01-14 21:42:05,844 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 21:42:05,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=495, Invalid=1145, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 21:42:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 21:42:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-01-14 21:42:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-14 21:42:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2019-01-14 21:42:05,852 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 91 [2019-01-14 21:42:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:05,852 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2019-01-14 21:42:05,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 21:42:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2019-01-14 21:42:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 21:42:05,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:05,854 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 7, 7, 7, 7, 7, 7, 1, 1] [2019-01-14 21:42:05,854 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:05,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1960461902, now seen corresponding path program 10 times [2019-01-14 21:42:05,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:05,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:05,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:05,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:05,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:06,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:06,264 INFO L223 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-01-14 21:42:06,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:42:06,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:42:06,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:06,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:06,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:06,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-14 21:42:06,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 21:42:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 21:42:06,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 21:42:06,386 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand 30 states. [2019-01-14 21:42:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:06,748 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2019-01-14 21:42:06,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 21:42:06,749 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 98 [2019-01-14 21:42:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:06,751 INFO L225 Difference]: With dead ends: 211 [2019-01-14 21:42:06,751 INFO L226 Difference]: Without dead ends: 210 [2019-01-14 21:42:06,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=568, Invalid=1324, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:42:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-14 21:42:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-01-14 21:42:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-01-14 21:42:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2019-01-14 21:42:06,760 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 98 [2019-01-14 21:42:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:06,760 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2019-01-14 21:42:06,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 21:42:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2019-01-14 21:42:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 21:42:06,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:06,762 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 8, 8, 8, 7, 7, 7, 1, 1] [2019-01-14 21:42:06,762 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash -44738730, now seen corresponding path program 11 times [2019-01-14 21:42:06,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:06,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:06,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:07,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:07,580 INFO L223 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-01-14 21:42:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:42:07,660 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-01-14 21:42:07,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:07,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:07,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:07,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-01-14 21:42:07,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 21:42:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 21:42:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 21:42:07,733 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 32 states. [2019-01-14 21:42:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:08,435 INFO L93 Difference]: Finished difference Result 225 states and 243 transitions. [2019-01-14 21:42:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 21:42:08,436 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 105 [2019-01-14 21:42:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:08,438 INFO L225 Difference]: With dead ends: 225 [2019-01-14 21:42:08,438 INFO L226 Difference]: Without dead ends: 224 [2019-01-14 21:42:08,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=646, Invalid=1516, Unknown=0, NotChecked=0, Total=2162 [2019-01-14 21:42:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-14 21:42:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-01-14 21:42:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-14 21:42:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 239 transitions. [2019-01-14 21:42:08,449 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 239 transitions. Word has length 105 [2019-01-14 21:42:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:08,449 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 239 transitions. [2019-01-14 21:42:08,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 21:42:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 239 transitions. [2019-01-14 21:42:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 21:42:08,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:08,451 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 8, 8, 8, 8, 8, 8, 1, 1] [2019-01-14 21:42:08,451 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash 750025580, now seen corresponding path program 12 times [2019-01-14 21:42:08,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:08,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:08,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:09,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:09,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:09,841 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:42:09,897 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-14 21:42:09,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:09,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:09,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:09,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-01-14 21:42:09,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 21:42:09,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 21:42:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 21:42:09,953 INFO L87 Difference]: Start difference. First operand 222 states and 239 transitions. Second operand 34 states. [2019-01-14 21:42:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:10,380 INFO L93 Difference]: Finished difference Result 239 states and 258 transitions. [2019-01-14 21:42:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 21:42:10,381 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 112 [2019-01-14 21:42:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:10,383 INFO L225 Difference]: With dead ends: 239 [2019-01-14 21:42:10,383 INFO L226 Difference]: Without dead ends: 238 [2019-01-14 21:42:10,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=729, Invalid=1721, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 21:42:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-14 21:42:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-01-14 21:42:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-14 21:42:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 254 transitions. [2019-01-14 21:42:10,392 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 254 transitions. Word has length 112 [2019-01-14 21:42:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:10,393 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 254 transitions. [2019-01-14 21:42:10,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 21:42:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 254 transitions. [2019-01-14 21:42:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-14 21:42:10,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:10,394 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 9, 9, 9, 8, 8, 8, 1, 1] [2019-01-14 21:42:10,395 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1551241308, now seen corresponding path program 13 times [2019-01-14 21:42:10,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:10,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:10,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:10,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:10,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:10,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:10,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:10,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:10,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-01-14 21:42:10,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 21:42:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 21:42:10,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 21:42:10,976 INFO L87 Difference]: Start difference. First operand 236 states and 254 transitions. Second operand 36 states. [2019-01-14 21:42:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:11,439 INFO L93 Difference]: Finished difference Result 253 states and 273 transitions. [2019-01-14 21:42:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 21:42:11,440 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 119 [2019-01-14 21:42:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:11,442 INFO L225 Difference]: With dead ends: 253 [2019-01-14 21:42:11,442 INFO L226 Difference]: Without dead ends: 252 [2019-01-14 21:42:11,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=817, Invalid=1939, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 21:42:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-14 21:42:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2019-01-14 21:42:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-14 21:42:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 269 transitions. [2019-01-14 21:42:11,453 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 269 transitions. Word has length 119 [2019-01-14 21:42:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:11,453 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 269 transitions. [2019-01-14 21:42:11,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 21:42:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 269 transitions. [2019-01-14 21:42:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-14 21:42:11,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:11,457 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 9, 9, 9, 9, 9, 9, 1, 1] [2019-01-14 21:42:11,458 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1303859290, now seen corresponding path program 14 times [2019-01-14 21:42:11,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:12,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:12,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:12,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:42:12,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:42:12,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:12,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:12,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-01-14 21:42:12,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 21:42:12,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 21:42:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 21:42:12,137 INFO L87 Difference]: Start difference. First operand 250 states and 269 transitions. Second operand 38 states. [2019-01-14 21:42:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:12,912 INFO L93 Difference]: Finished difference Result 267 states and 288 transitions. [2019-01-14 21:42:12,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 21:42:12,913 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 126 [2019-01-14 21:42:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:12,915 INFO L225 Difference]: With dead ends: 267 [2019-01-14 21:42:12,915 INFO L226 Difference]: Without dead ends: 266 [2019-01-14 21:42:12,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=910, Invalid=2170, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 21:42:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-14 21:42:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-01-14 21:42:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-14 21:42:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 284 transitions. [2019-01-14 21:42:12,924 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 284 transitions. Word has length 126 [2019-01-14 21:42:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:12,925 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 284 transitions. [2019-01-14 21:42:12,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 21:42:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 284 transitions. [2019-01-14 21:42:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-14 21:42:12,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:12,929 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 10, 10, 10, 9, 9, 9, 1, 1] [2019-01-14 21:42:12,929 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:12,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1854113506, now seen corresponding path program 15 times [2019-01-14 21:42:12,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:12,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:12,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 0 proven. 999 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:13,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:13,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:42:14,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-14 21:42:14,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:14,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 0 proven. 999 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:14,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:14,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-01-14 21:42:14,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 21:42:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 21:42:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 21:42:14,081 INFO L87 Difference]: Start difference. First operand 264 states and 284 transitions. Second operand 40 states. [2019-01-14 21:42:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:14,589 INFO L93 Difference]: Finished difference Result 281 states and 303 transitions. [2019-01-14 21:42:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 21:42:14,592 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 133 [2019-01-14 21:42:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:14,594 INFO L225 Difference]: With dead ends: 281 [2019-01-14 21:42:14,594 INFO L226 Difference]: Without dead ends: 280 [2019-01-14 21:42:14,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1008, Invalid=2414, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 21:42:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-14 21:42:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2019-01-14 21:42:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-01-14 21:42:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 299 transitions. [2019-01-14 21:42:14,604 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 299 transitions. Word has length 133 [2019-01-14 21:42:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:14,604 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 299 transitions. [2019-01-14 21:42:14,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 21:42:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 299 transitions. [2019-01-14 21:42:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-14 21:42:14,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:14,608 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 10, 10, 10, 10, 10, 10, 1, 1] [2019-01-14 21:42:14,609 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -769132960, now seen corresponding path program 16 times [2019-01-14 21:42:14,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:14,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:14,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 0 proven. 1111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:15,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:15,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:15,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:42:15,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:42:15,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:15,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 0 proven. 1111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:15,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:15,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-14 21:42:15,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 21:42:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 21:42:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 21:42:15,525 INFO L87 Difference]: Start difference. First operand 278 states and 299 transitions. Second operand 42 states. [2019-01-14 21:42:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:17,262 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2019-01-14 21:42:17,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-14 21:42:17,263 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 140 [2019-01-14 21:42:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:17,266 INFO L225 Difference]: With dead ends: 295 [2019-01-14 21:42:17,266 INFO L226 Difference]: Without dead ends: 294 [2019-01-14 21:42:17,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1111, Invalid=2671, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 21:42:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-14 21:42:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-01-14 21:42:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-14 21:42:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 314 transitions. [2019-01-14 21:42:17,276 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 314 transitions. Word has length 140 [2019-01-14 21:42:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:17,277 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 314 transitions. [2019-01-14 21:42:17,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 21:42:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 314 transitions. [2019-01-14 21:42:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-14 21:42:17,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:17,280 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 11, 11, 11, 10, 10, 10, 1, 1] [2019-01-14 21:42:17,282 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:17,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1851516184, now seen corresponding path program 17 times [2019-01-14 21:42:17,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:17,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:17,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 0 proven. 1230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:18,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:18,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:18,953 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:42:19,034 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-01-14 21:42:19,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:19,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 0 proven. 1230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:19,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:19,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-01-14 21:42:19,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 21:42:19,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 21:42:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 21:42:19,086 INFO L87 Difference]: Start difference. First operand 292 states and 314 transitions. Second operand 44 states. [2019-01-14 21:42:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:19,627 INFO L93 Difference]: Finished difference Result 309 states and 333 transitions. [2019-01-14 21:42:19,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 21:42:19,628 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 147 [2019-01-14 21:42:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:19,631 INFO L225 Difference]: With dead ends: 309 [2019-01-14 21:42:19,631 INFO L226 Difference]: Without dead ends: 308 [2019-01-14 21:42:19,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1219, Invalid=2941, Unknown=0, NotChecked=0, Total=4160 [2019-01-14 21:42:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-01-14 21:42:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2019-01-14 21:42:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-14 21:42:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 329 transitions. [2019-01-14 21:42:19,643 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 329 transitions. Word has length 147 [2019-01-14 21:42:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:19,643 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 329 transitions. [2019-01-14 21:42:19,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 21:42:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 329 transitions. [2019-01-14 21:42:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-14 21:42:19,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:19,647 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 11, 11, 11, 11, 11, 11, 1, 1] [2019-01-14 21:42:19,647 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:19,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:19,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2009075814, now seen corresponding path program 18 times [2019-01-14 21:42:19,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:19,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:19,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:19,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 0 proven. 1354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:20,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:20,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:20,481 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:42:20,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-14 21:42:20,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:20,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 0 proven. 1354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:20,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:20,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-01-14 21:42:20,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 21:42:20,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 21:42:20,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 21:42:20,632 INFO L87 Difference]: Start difference. First operand 306 states and 329 transitions. Second operand 46 states. [2019-01-14 21:42:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:21,225 INFO L93 Difference]: Finished difference Result 323 states and 348 transitions. [2019-01-14 21:42:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-14 21:42:21,227 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 154 [2019-01-14 21:42:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:21,229 INFO L225 Difference]: With dead ends: 323 [2019-01-14 21:42:21,229 INFO L226 Difference]: Without dead ends: 322 [2019-01-14 21:42:21,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1332, Invalid=3224, Unknown=0, NotChecked=0, Total=4556 [2019-01-14 21:42:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-14 21:42:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2019-01-14 21:42:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-14 21:42:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 344 transitions. [2019-01-14 21:42:21,239 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 344 transitions. Word has length 154 [2019-01-14 21:42:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:21,239 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 344 transitions. [2019-01-14 21:42:21,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 21:42:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 344 transitions. [2019-01-14 21:42:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-14 21:42:21,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:21,243 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 12, 12, 12, 11, 11, 11, 1, 1] [2019-01-14 21:42:21,244 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1319752594, now seen corresponding path program 19 times [2019-01-14 21:42:21,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:21,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:21,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:21,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:21,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:22,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:22,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:22,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:22,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:22,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-14 21:42:22,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 21:42:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 21:42:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 21:42:22,365 INFO L87 Difference]: Start difference. First operand 320 states and 344 transitions. Second operand 48 states. [2019-01-14 21:42:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:22,964 INFO L93 Difference]: Finished difference Result 337 states and 363 transitions. [2019-01-14 21:42:22,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-14 21:42:22,965 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 161 [2019-01-14 21:42:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:22,968 INFO L225 Difference]: With dead ends: 337 [2019-01-14 21:42:22,968 INFO L226 Difference]: Without dead ends: 336 [2019-01-14 21:42:22,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1450, Invalid=3520, Unknown=0, NotChecked=0, Total=4970 [2019-01-14 21:42:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-14 21:42:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-14 21:42:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-14 21:42:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 359 transitions. [2019-01-14 21:42:22,980 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 359 transitions. Word has length 161 [2019-01-14 21:42:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:22,981 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 359 transitions. [2019-01-14 21:42:22,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 21:42:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 359 transitions. [2019-01-14 21:42:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-14 21:42:22,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:22,985 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 12, 12, 12, 12, 12, 12, 1, 1] [2019-01-14 21:42:22,985 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash 270941012, now seen corresponding path program 20 times [2019-01-14 21:42:22,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:22,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:22,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:22,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 0 proven. 1621 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:24,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:24,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:24,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:42:24,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:42:24,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:24,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 0 proven. 1621 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:24,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:24,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-01-14 21:42:24,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 21:42:24,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 21:42:24,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 21:42:24,556 INFO L87 Difference]: Start difference. First operand 334 states and 359 transitions. Second operand 50 states. [2019-01-14 21:42:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:25,165 INFO L93 Difference]: Finished difference Result 351 states and 378 transitions. [2019-01-14 21:42:25,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-14 21:42:25,167 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 168 [2019-01-14 21:42:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:25,169 INFO L225 Difference]: With dead ends: 351 [2019-01-14 21:42:25,170 INFO L226 Difference]: Without dead ends: 350 [2019-01-14 21:42:25,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1573, Invalid=3829, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 21:42:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-14 21:42:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-01-14 21:42:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-14 21:42:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 374 transitions. [2019-01-14 21:42:25,178 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 374 transitions. Word has length 168 [2019-01-14 21:42:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:25,178 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 374 transitions. [2019-01-14 21:42:25,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 21:42:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 374 transitions. [2019-01-14 21:42:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-14 21:42:25,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:25,180 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 13, 13, 13, 12, 12, 12, 1, 1] [2019-01-14 21:42:25,180 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:25,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash 208673652, now seen corresponding path program 21 times [2019-01-14 21:42:25,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:25,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:25,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:25,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:25,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:26,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:26,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:26,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:42:26,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-14 21:42:26,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:26,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:26,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:26,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-01-14 21:42:26,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 21:42:26,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 21:42:26,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 21:42:26,375 INFO L87 Difference]: Start difference. First operand 348 states and 374 transitions. Second operand 52 states. [2019-01-14 21:42:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:27,097 INFO L93 Difference]: Finished difference Result 365 states and 393 transitions. [2019-01-14 21:42:27,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-14 21:42:27,099 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 175 [2019-01-14 21:42:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:27,101 INFO L225 Difference]: With dead ends: 365 [2019-01-14 21:42:27,101 INFO L226 Difference]: Without dead ends: 364 [2019-01-14 21:42:27,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1701, Invalid=4151, Unknown=0, NotChecked=0, Total=5852 [2019-01-14 21:42:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-14 21:42:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2019-01-14 21:42:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-01-14 21:42:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 389 transitions. [2019-01-14 21:42:27,109 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 389 transitions. Word has length 175 [2019-01-14 21:42:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:27,110 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 389 transitions. [2019-01-14 21:42:27,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 21:42:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 389 transitions. [2019-01-14 21:42:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-14 21:42:27,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:27,114 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 13, 13, 13, 13, 13, 13, 1, 1] [2019-01-14 21:42:27,114 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:27,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1595439502, now seen corresponding path program 22 times [2019-01-14 21:42:27,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:27,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:27,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:27,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 0 proven. 1912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:28,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:28,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:28,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:42:28,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:42:28,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:28,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 0 proven. 1912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:28,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:28,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-14 21:42:28,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 21:42:28,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 21:42:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 21:42:28,240 INFO L87 Difference]: Start difference. First operand 362 states and 389 transitions. Second operand 54 states. [2019-01-14 21:42:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:29,204 INFO L93 Difference]: Finished difference Result 379 states and 408 transitions. [2019-01-14 21:42:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-14 21:42:29,206 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 182 [2019-01-14 21:42:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:29,209 INFO L225 Difference]: With dead ends: 379 [2019-01-14 21:42:29,209 INFO L226 Difference]: Without dead ends: 378 [2019-01-14 21:42:29,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1834, Invalid=4486, Unknown=0, NotChecked=0, Total=6320 [2019-01-14 21:42:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-01-14 21:42:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2019-01-14 21:42:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-14 21:42:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 404 transitions. [2019-01-14 21:42:29,222 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 404 transitions. Word has length 182 [2019-01-14 21:42:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:29,223 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 404 transitions. [2019-01-14 21:42:29,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 21:42:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 404 transitions. [2019-01-14 21:42:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-14 21:42:29,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:29,227 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 14, 14, 14, 13, 13, 13, 1, 1] [2019-01-14 21:42:29,227 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2065713146, now seen corresponding path program 23 times [2019-01-14 21:42:29,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:29,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:29,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:29,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:29,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2067 backedges. 0 proven. 2067 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:30,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:30,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:30,417 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:42:30,538 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-14 21:42:30,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:30,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2067 backedges. 0 proven. 2067 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:30,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:30,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-01-14 21:42:30,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-14 21:42:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-14 21:42:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 21:42:30,621 INFO L87 Difference]: Start difference. First operand 376 states and 404 transitions. Second operand 56 states. [2019-01-14 21:42:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:31,618 INFO L93 Difference]: Finished difference Result 393 states and 423 transitions. [2019-01-14 21:42:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-14 21:42:31,619 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 189 [2019-01-14 21:42:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:31,623 INFO L225 Difference]: With dead ends: 393 [2019-01-14 21:42:31,623 INFO L226 Difference]: Without dead ends: 392 [2019-01-14 21:42:31,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1972, Invalid=4834, Unknown=0, NotChecked=0, Total=6806 [2019-01-14 21:42:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-01-14 21:42:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2019-01-14 21:42:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-01-14 21:42:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 419 transitions. [2019-01-14 21:42:31,635 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 419 transitions. Word has length 189 [2019-01-14 21:42:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:31,636 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 419 transitions. [2019-01-14 21:42:31,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-14 21:42:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 419 transitions. [2019-01-14 21:42:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-14 21:42:31,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:31,639 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 14, 14, 14, 14, 14, 14, 1, 1] [2019-01-14 21:42:31,640 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash 503073352, now seen corresponding path program 24 times [2019-01-14 21:42:31,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:31,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:31,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:31,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 0 proven. 2227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:32,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:32,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:32,798 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:42:32,991 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-01-14 21:42:32,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:32,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 0 proven. 2227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:33,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:33,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-01-14 21:42:33,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 21:42:33,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 21:42:33,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 21:42:33,051 INFO L87 Difference]: Start difference. First operand 390 states and 419 transitions. Second operand 58 states. [2019-01-14 21:42:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:34,342 INFO L93 Difference]: Finished difference Result 407 states and 438 transitions. [2019-01-14 21:42:34,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-14 21:42:34,343 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 196 [2019-01-14 21:42:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:34,346 INFO L225 Difference]: With dead ends: 407 [2019-01-14 21:42:34,346 INFO L226 Difference]: Without dead ends: 406 [2019-01-14 21:42:34,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2115, Invalid=5195, Unknown=0, NotChecked=0, Total=7310 [2019-01-14 21:42:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-14 21:42:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2019-01-14 21:42:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-01-14 21:42:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 434 transitions. [2019-01-14 21:42:34,361 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 434 transitions. Word has length 196 [2019-01-14 21:42:34,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:34,361 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 434 transitions. [2019-01-14 21:42:34,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 21:42:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 434 transitions. [2019-01-14 21:42:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-01-14 21:42:34,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:34,366 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 15, 15, 15, 14, 14, 14, 1, 1] [2019-01-14 21:42:34,367 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash 887951872, now seen corresponding path program 25 times [2019-01-14 21:42:34,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:34,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:34,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:34,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 0 proven. 2394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:36,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:36,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:36,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:36,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 0 proven. 2394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:36,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-01-14 21:42:36,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 21:42:36,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 21:42:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 21:42:36,557 INFO L87 Difference]: Start difference. First operand 404 states and 434 transitions. Second operand 60 states. [2019-01-14 21:42:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:37,475 INFO L93 Difference]: Finished difference Result 421 states and 453 transitions. [2019-01-14 21:42:37,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-14 21:42:37,477 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 203 [2019-01-14 21:42:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:37,482 INFO L225 Difference]: With dead ends: 421 [2019-01-14 21:42:37,482 INFO L226 Difference]: Without dead ends: 420 [2019-01-14 21:42:37,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2263, Invalid=5569, Unknown=0, NotChecked=0, Total=7832 [2019-01-14 21:42:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-01-14 21:42:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2019-01-14 21:42:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-01-14 21:42:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 449 transitions. [2019-01-14 21:42:37,491 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 449 transitions. Word has length 203 [2019-01-14 21:42:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:37,492 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 449 transitions. [2019-01-14 21:42:37,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 21:42:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 449 transitions. [2019-01-14 21:42:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-14 21:42:37,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:37,497 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 15, 15, 15, 15, 15, 15, 1, 1] [2019-01-14 21:42:37,497 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash 593448322, now seen corresponding path program 26 times [2019-01-14 21:42:37,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:37,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:37,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:37,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:37,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2566 backedges. 0 proven. 2566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:39,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:39,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:39,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:42:39,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:42:39,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:39,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2566 backedges. 0 proven. 2566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:39,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:39,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-01-14 21:42:39,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-14 21:42:39,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-14 21:42:39,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 21:42:39,619 INFO L87 Difference]: Start difference. First operand 418 states and 449 transitions. Second operand 62 states. [2019-01-14 21:42:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:40,831 INFO L93 Difference]: Finished difference Result 435 states and 468 transitions. [2019-01-14 21:42:40,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-14 21:42:40,832 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 210 [2019-01-14 21:42:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:40,835 INFO L225 Difference]: With dead ends: 435 [2019-01-14 21:42:40,835 INFO L226 Difference]: Without dead ends: 434 [2019-01-14 21:42:40,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2416, Invalid=5956, Unknown=0, NotChecked=0, Total=8372 [2019-01-14 21:42:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-14 21:42:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2019-01-14 21:42:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-01-14 21:42:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 464 transitions. [2019-01-14 21:42:40,848 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 464 transitions. Word has length 210 [2019-01-14 21:42:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:40,848 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 464 transitions. [2019-01-14 21:42:40,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 21:42:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 464 transitions. [2019-01-14 21:42:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-14 21:42:40,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:40,852 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 16, 16, 16, 15, 15, 15, 1, 1] [2019-01-14 21:42:40,853 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash 380950918, now seen corresponding path program 27 times [2019-01-14 21:42:40,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:40,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:40,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 0 proven. 2745 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:42,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:42,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:42,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:42:42,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-14 21:42:42,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:42,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 0 proven. 2745 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:42,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:42,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-01-14 21:42:42,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-14 21:42:42,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-14 21:42:42,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 21:42:42,482 INFO L87 Difference]: Start difference. First operand 432 states and 464 transitions. Second operand 64 states. [2019-01-14 21:42:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:44,615 INFO L93 Difference]: Finished difference Result 449 states and 483 transitions. [2019-01-14 21:42:44,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-14 21:42:44,617 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 217 [2019-01-14 21:42:44,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:44,619 INFO L225 Difference]: With dead ends: 449 [2019-01-14 21:42:44,619 INFO L226 Difference]: Without dead ends: 448 [2019-01-14 21:42:44,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2574, Invalid=6356, Unknown=0, NotChecked=0, Total=8930 [2019-01-14 21:42:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-01-14 21:42:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2019-01-14 21:42:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-14 21:42:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 479 transitions. [2019-01-14 21:42:44,628 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 479 transitions. Word has length 217 [2019-01-14 21:42:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:44,628 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 479 transitions. [2019-01-14 21:42:44,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-14 21:42:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 479 transitions. [2019-01-14 21:42:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-01-14 21:42:44,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:44,630 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 16, 16, 16, 16, 16, 16, 1, 1] [2019-01-14 21:42:44,631 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:44,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1836524348, now seen corresponding path program 28 times [2019-01-14 21:42:44,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:44,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:44,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:44,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:44,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 0 proven. 2929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:46,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:46,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:46,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:42:46,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:42:46,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:46,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 0 proven. 2929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:46,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:46,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-01-14 21:42:46,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-14 21:42:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-14 21:42:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2019-01-14 21:42:46,286 INFO L87 Difference]: Start difference. First operand 446 states and 479 transitions. Second operand 66 states. [2019-01-14 21:42:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:47,267 INFO L93 Difference]: Finished difference Result 463 states and 498 transitions. [2019-01-14 21:42:47,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-14 21:42:47,269 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 224 [2019-01-14 21:42:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:47,272 INFO L225 Difference]: With dead ends: 463 [2019-01-14 21:42:47,272 INFO L226 Difference]: Without dead ends: 462 [2019-01-14 21:42:47,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2737, Invalid=6769, Unknown=0, NotChecked=0, Total=9506 [2019-01-14 21:42:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-01-14 21:42:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2019-01-14 21:42:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-01-14 21:42:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 494 transitions. [2019-01-14 21:42:47,286 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 494 transitions. Word has length 224 [2019-01-14 21:42:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:47,286 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 494 transitions. [2019-01-14 21:42:47,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-14 21:42:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 494 transitions. [2019-01-14 21:42:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-14 21:42:47,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:47,291 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 17, 17, 17, 16, 16, 16, 1, 1] [2019-01-14 21:42:47,292 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1756233356, now seen corresponding path program 29 times [2019-01-14 21:42:47,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:47,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:47,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:48,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:48,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:48,850 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:42:49,092 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-01-14 21:42:49,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:49,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:49,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:49,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-01-14 21:42:49,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-14 21:42:49,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-14 21:42:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2019-01-14 21:42:49,187 INFO L87 Difference]: Start difference. First operand 460 states and 494 transitions. Second operand 68 states. [2019-01-14 21:42:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:50,610 INFO L93 Difference]: Finished difference Result 477 states and 513 transitions. [2019-01-14 21:42:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-14 21:42:50,612 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 231 [2019-01-14 21:42:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:50,615 INFO L225 Difference]: With dead ends: 477 [2019-01-14 21:42:50,615 INFO L226 Difference]: Without dead ends: 476 [2019-01-14 21:42:50,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2905, Invalid=7195, Unknown=0, NotChecked=0, Total=10100 [2019-01-14 21:42:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-01-14 21:42:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2019-01-14 21:42:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-01-14 21:42:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 509 transitions. [2019-01-14 21:42:50,629 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 509 transitions. Word has length 231 [2019-01-14 21:42:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:50,630 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 509 transitions. [2019-01-14 21:42:50,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-14 21:42:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 509 transitions. [2019-01-14 21:42:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-01-14 21:42:50,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:50,633 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 17, 17, 17, 17, 17, 17, 1, 1] [2019-01-14 21:42:50,633 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:50,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1675531402, now seen corresponding path program 30 times [2019-01-14 21:42:50,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:50,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:50,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:50,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3316 backedges. 0 proven. 3316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:52,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:52,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:52,651 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:42:52,810 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-01-14 21:42:52,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:52,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3316 backedges. 0 proven. 3316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:52,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:52,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-01-14 21:42:52,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-14 21:42:52,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-14 21:42:52,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-01-14 21:42:52,884 INFO L87 Difference]: Start difference. First operand 474 states and 509 transitions. Second operand 70 states. [2019-01-14 21:42:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:53,975 INFO L93 Difference]: Finished difference Result 491 states and 528 transitions. [2019-01-14 21:42:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-14 21:42:53,977 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 238 [2019-01-14 21:42:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:53,979 INFO L225 Difference]: With dead ends: 491 [2019-01-14 21:42:53,979 INFO L226 Difference]: Without dead ends: 490 [2019-01-14 21:42:53,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3078, Invalid=7634, Unknown=0, NotChecked=0, Total=10712 [2019-01-14 21:42:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-01-14 21:42:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2019-01-14 21:42:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-01-14 21:42:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 524 transitions. [2019-01-14 21:42:53,992 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 524 transitions. Word has length 238 [2019-01-14 21:42:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:53,992 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 524 transitions. [2019-01-14 21:42:53,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-14 21:42:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 524 transitions. [2019-01-14 21:42:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-14 21:42:53,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:53,998 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 18, 18, 18, 17, 17, 17, 1, 1] [2019-01-14 21:42:53,999 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:53,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash 610722066, now seen corresponding path program 31 times [2019-01-14 21:42:53,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:53,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:54,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:54,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:42:54,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3519 backedges. 0 proven. 3519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:56,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:56,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:56,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3519 backedges. 0 proven. 3519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:56,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:56,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-01-14 21:42:56,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-14 21:42:56,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-14 21:42:56,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-01-14 21:42:56,277 INFO L87 Difference]: Start difference. First operand 488 states and 524 transitions. Second operand 72 states. [2019-01-14 21:42:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:42:57,500 INFO L93 Difference]: Finished difference Result 505 states and 543 transitions. [2019-01-14 21:42:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-14 21:42:57,502 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 245 [2019-01-14 21:42:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:42:57,505 INFO L225 Difference]: With dead ends: 505 [2019-01-14 21:42:57,505 INFO L226 Difference]: Without dead ends: 504 [2019-01-14 21:42:57,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3256, Invalid=8086, Unknown=0, NotChecked=0, Total=11342 [2019-01-14 21:42:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-01-14 21:42:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2019-01-14 21:42:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-01-14 21:42:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 539 transitions. [2019-01-14 21:42:57,518 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 539 transitions. Word has length 245 [2019-01-14 21:42:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:42:57,518 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 539 transitions. [2019-01-14 21:42:57,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-14 21:42:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 539 transitions. [2019-01-14 21:42:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-14 21:42:57,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:42:57,523 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 18, 18, 18, 18, 18, 18, 1, 1] [2019-01-14 21:42:57,524 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:42:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:42:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -354171344, now seen corresponding path program 32 times [2019-01-14 21:42:57,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:42:57,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:42:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:57,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:42:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:42:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:42:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3727 backedges. 0 proven. 3727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:59,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:42:59,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:42:59,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:42:59,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:42:59,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:42:59,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:42:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3727 backedges. 0 proven. 3727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:42:59,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:42:59,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-01-14 21:42:59,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-14 21:42:59,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-14 21:42:59,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 21:42:59,585 INFO L87 Difference]: Start difference. First operand 502 states and 539 transitions. Second operand 74 states. [2019-01-14 21:43:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:00,961 INFO L93 Difference]: Finished difference Result 519 states and 558 transitions. [2019-01-14 21:43:00,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-14 21:43:00,963 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 252 [2019-01-14 21:43:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:00,966 INFO L225 Difference]: With dead ends: 519 [2019-01-14 21:43:00,966 INFO L226 Difference]: Without dead ends: 518 [2019-01-14 21:43:00,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3439, Invalid=8551, Unknown=0, NotChecked=0, Total=11990 [2019-01-14 21:43:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-01-14 21:43:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2019-01-14 21:43:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-14 21:43:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 554 transitions. [2019-01-14 21:43:00,979 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 554 transitions. Word has length 252 [2019-01-14 21:43:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:00,981 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 554 transitions. [2019-01-14 21:43:00,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-14 21:43:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 554 transitions. [2019-01-14 21:43:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-01-14 21:43:00,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:00,983 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 19, 19, 19, 18, 18, 18, 1, 1] [2019-01-14 21:43:00,987 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1161436904, now seen corresponding path program 33 times [2019-01-14 21:43:00,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:00,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:00,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:00,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:00,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3942 backedges. 0 proven. 3942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:02,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:02,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:02,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:43:02,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-14 21:43:02,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:02,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3942 backedges. 0 proven. 3942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:02,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:02,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-01-14 21:43:02,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-14 21:43:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-14 21:43:02,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-01-14 21:43:02,996 INFO L87 Difference]: Start difference. First operand 516 states and 554 transitions. Second operand 76 states. [2019-01-14 21:43:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:05,367 INFO L93 Difference]: Finished difference Result 533 states and 573 transitions. [2019-01-14 21:43:05,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-14 21:43:05,369 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 259 [2019-01-14 21:43:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:05,374 INFO L225 Difference]: With dead ends: 533 [2019-01-14 21:43:05,374 INFO L226 Difference]: Without dead ends: 532 [2019-01-14 21:43:05,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3627, Invalid=9029, Unknown=0, NotChecked=0, Total=12656 [2019-01-14 21:43:05,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-01-14 21:43:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 530. [2019-01-14 21:43:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-01-14 21:43:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 569 transitions. [2019-01-14 21:43:05,387 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 569 transitions. Word has length 259 [2019-01-14 21:43:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:05,388 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 569 transitions. [2019-01-14 21:43:05,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-14 21:43:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 569 transitions. [2019-01-14 21:43:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-14 21:43:05,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:05,395 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 19, 19, 19, 19, 19, 19, 1, 1] [2019-01-14 21:43:05,395 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1427385494, now seen corresponding path program 34 times [2019-01-14 21:43:05,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:05,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:05,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:05,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:05,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4162 backedges. 0 proven. 4162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:07,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:07,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:07,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:43:07,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:43:07,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:07,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4162 backedges. 0 proven. 4162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:07,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:07,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-01-14 21:43:07,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-14 21:43:07,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-14 21:43:07,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2019-01-14 21:43:07,587 INFO L87 Difference]: Start difference. First operand 530 states and 569 transitions. Second operand 78 states. [2019-01-14 21:43:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:08,998 INFO L93 Difference]: Finished difference Result 547 states and 588 transitions. [2019-01-14 21:43:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-14 21:43:09,000 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 266 [2019-01-14 21:43:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:09,003 INFO L225 Difference]: With dead ends: 547 [2019-01-14 21:43:09,003 INFO L226 Difference]: Without dead ends: 546 [2019-01-14 21:43:09,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3820, Invalid=9520, Unknown=0, NotChecked=0, Total=13340 [2019-01-14 21:43:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-01-14 21:43:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-01-14 21:43:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-01-14 21:43:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 584 transitions. [2019-01-14 21:43:09,015 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 584 transitions. Word has length 266 [2019-01-14 21:43:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:09,016 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 584 transitions. [2019-01-14 21:43:09,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-14 21:43:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 584 transitions. [2019-01-14 21:43:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-01-14 21:43:09,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:09,018 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 20, 20, 20, 19, 19, 19, 1, 1] [2019-01-14 21:43:09,018 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:09,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1510563486, now seen corresponding path program 35 times [2019-01-14 21:43:09,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:09,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:09,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:11,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:11,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:11,508 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:43:11,856 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-01-14 21:43:11,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:11,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:11,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:11,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-01-14 21:43:11,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-14 21:43:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-14 21:43:11,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-01-14 21:43:11,984 INFO L87 Difference]: Start difference. First operand 544 states and 584 transitions. Second operand 80 states. [2019-01-14 21:43:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:13,486 INFO L93 Difference]: Finished difference Result 561 states and 603 transitions. [2019-01-14 21:43:13,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-14 21:43:13,488 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 273 [2019-01-14 21:43:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:13,492 INFO L225 Difference]: With dead ends: 561 [2019-01-14 21:43:13,492 INFO L226 Difference]: Without dead ends: 560 [2019-01-14 21:43:13,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4018, Invalid=10024, Unknown=0, NotChecked=0, Total=14042 [2019-01-14 21:43:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-01-14 21:43:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2019-01-14 21:43:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-01-14 21:43:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 599 transitions. [2019-01-14 21:43:13,507 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 599 transitions. Word has length 273 [2019-01-14 21:43:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:13,507 INFO L480 AbstractCegarLoop]: Abstraction has 558 states and 599 transitions. [2019-01-14 21:43:13,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-14 21:43:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 599 transitions. [2019-01-14 21:43:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-14 21:43:13,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:13,514 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 20, 20, 20, 20, 20, 20, 1, 1] [2019-01-14 21:43:13,515 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1024406308, now seen corresponding path program 36 times [2019-01-14 21:43:13,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:13,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:13,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4621 backedges. 0 proven. 4621 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:16,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:16,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:16,294 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:43:16,492 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-01-14 21:43:16,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:16,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4621 backedges. 0 proven. 4621 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:16,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:16,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-01-14 21:43:16,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-14 21:43:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-14 21:43:16,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-01-14 21:43:16,652 INFO L87 Difference]: Start difference. First operand 558 states and 599 transitions. Second operand 82 states. [2019-01-14 21:43:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:18,466 INFO L93 Difference]: Finished difference Result 575 states and 618 transitions. [2019-01-14 21:43:18,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-14 21:43:18,468 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 280 [2019-01-14 21:43:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:18,471 INFO L225 Difference]: With dead ends: 575 [2019-01-14 21:43:18,471 INFO L226 Difference]: Without dead ends: 574 [2019-01-14 21:43:18,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4221, Invalid=10541, Unknown=0, NotChecked=0, Total=14762 [2019-01-14 21:43:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-01-14 21:43:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2019-01-14 21:43:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-01-14 21:43:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 614 transitions. [2019-01-14 21:43:18,487 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 614 transitions. Word has length 280 [2019-01-14 21:43:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:18,490 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 614 transitions. [2019-01-14 21:43:18,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-14 21:43:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 614 transitions. [2019-01-14 21:43:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-01-14 21:43:18,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:18,493 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 21, 21, 21, 20, 20, 20, 1, 1] [2019-01-14 21:43:18,496 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1278756444, now seen corresponding path program 37 times [2019-01-14 21:43:18,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:18,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:18,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 0 proven. 4860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:20,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:20,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:20,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:43:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:20,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 0 proven. 4860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:21,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:21,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-01-14 21:43:21,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-14 21:43:21,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-14 21:43:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2019-01-14 21:43:21,046 INFO L87 Difference]: Start difference. First operand 572 states and 614 transitions. Second operand 84 states. [2019-01-14 21:43:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:22,601 INFO L93 Difference]: Finished difference Result 589 states and 633 transitions. [2019-01-14 21:43:22,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-14 21:43:22,603 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 287 [2019-01-14 21:43:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:22,606 INFO L225 Difference]: With dead ends: 589 [2019-01-14 21:43:22,606 INFO L226 Difference]: Without dead ends: 588 [2019-01-14 21:43:22,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4429, Invalid=11071, Unknown=0, NotChecked=0, Total=15500 [2019-01-14 21:43:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-01-14 21:43:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 586. [2019-01-14 21:43:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-01-14 21:43:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 629 transitions. [2019-01-14 21:43:22,617 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 629 transitions. Word has length 287 [2019-01-14 21:43:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:22,617 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 629 transitions. [2019-01-14 21:43:22,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-14 21:43:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 629 transitions. [2019-01-14 21:43:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-01-14 21:43:22,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:22,619 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 21, 21, 21, 21, 21, 21, 1, 1] [2019-01-14 21:43:22,620 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1949596322, now seen corresponding path program 38 times [2019-01-14 21:43:22,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:22,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:43:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 0 proven. 5104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:25,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:25,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:25,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:43:25,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:43:25,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:25,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 0 proven. 5104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:25,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:25,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-01-14 21:43:25,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-14 21:43:25,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-14 21:43:25,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2019-01-14 21:43:25,573 INFO L87 Difference]: Start difference. First operand 586 states and 629 transitions. Second operand 86 states. [2019-01-14 21:43:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:27,155 INFO L93 Difference]: Finished difference Result 603 states and 648 transitions. [2019-01-14 21:43:27,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-14 21:43:27,156 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 294 [2019-01-14 21:43:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:27,160 INFO L225 Difference]: With dead ends: 603 [2019-01-14 21:43:27,160 INFO L226 Difference]: Without dead ends: 602 [2019-01-14 21:43:27,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4642, Invalid=11614, Unknown=0, NotChecked=0, Total=16256 [2019-01-14 21:43:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-01-14 21:43:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-01-14 21:43:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-01-14 21:43:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 644 transitions. [2019-01-14 21:43:27,172 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 644 transitions. Word has length 294 [2019-01-14 21:43:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:27,175 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 644 transitions. [2019-01-14 21:43:27,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-14 21:43:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 644 transitions. [2019-01-14 21:43:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-14 21:43:27,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:27,180 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 22, 22, 22, 21, 21, 21, 1, 1] [2019-01-14 21:43:27,180 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1122980394, now seen corresponding path program 39 times [2019-01-14 21:43:27,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:27,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:27,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5355 backedges. 0 proven. 5355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:29,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:29,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:29,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:43:29,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-14 21:43:29,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:29,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5355 backedges. 0 proven. 5355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:29,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:29,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-01-14 21:43:29,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-14 21:43:29,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-14 21:43:29,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2019-01-14 21:43:29,897 INFO L87 Difference]: Start difference. First operand 600 states and 644 transitions. Second operand 88 states. [2019-01-14 21:43:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:31,830 INFO L93 Difference]: Finished difference Result 617 states and 663 transitions. [2019-01-14 21:43:31,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-14 21:43:31,832 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 301 [2019-01-14 21:43:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:31,835 INFO L225 Difference]: With dead ends: 617 [2019-01-14 21:43:31,835 INFO L226 Difference]: Without dead ends: 616 [2019-01-14 21:43:31,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4860, Invalid=12170, Unknown=0, NotChecked=0, Total=17030 [2019-01-14 21:43:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-01-14 21:43:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-01-14 21:43:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-01-14 21:43:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 659 transitions. [2019-01-14 21:43:31,847 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 659 transitions. Word has length 301 [2019-01-14 21:43:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:31,850 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 659 transitions. [2019-01-14 21:43:31,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-14 21:43:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 659 transitions. [2019-01-14 21:43:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-14 21:43:31,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:31,854 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 22, 22, 22, 22, 22, 22, 1, 1] [2019-01-14 21:43:31,854 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:31,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:31,855 INFO L82 PathProgramCache]: Analyzing trace with hash 88500760, now seen corresponding path program 40 times [2019-01-14 21:43:31,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:31,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:31,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:31,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:31,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5611 backedges. 0 proven. 5611 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:34,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:34,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:43:34,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:43:34,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:34,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5611 backedges. 0 proven. 5611 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:34,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:34,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-01-14 21:43:34,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-14 21:43:34,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-14 21:43:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2019-01-14 21:43:34,460 INFO L87 Difference]: Start difference. First operand 614 states and 659 transitions. Second operand 90 states. [2019-01-14 21:43:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:36,969 INFO L93 Difference]: Finished difference Result 631 states and 678 transitions. [2019-01-14 21:43:36,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-14 21:43:36,971 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 308 [2019-01-14 21:43:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:36,975 INFO L225 Difference]: With dead ends: 631 [2019-01-14 21:43:36,975 INFO L226 Difference]: Without dead ends: 630 [2019-01-14 21:43:36,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5083, Invalid=12739, Unknown=0, NotChecked=0, Total=17822 [2019-01-14 21:43:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-01-14 21:43:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2019-01-14 21:43:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-01-14 21:43:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 674 transitions. [2019-01-14 21:43:36,986 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 674 transitions. Word has length 308 [2019-01-14 21:43:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:36,987 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 674 transitions. [2019-01-14 21:43:36,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-14 21:43:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 674 transitions. [2019-01-14 21:43:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-14 21:43:36,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:36,992 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 23, 23, 23, 22, 22, 22, 1, 1] [2019-01-14 21:43:36,992 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:36,993 INFO L82 PathProgramCache]: Analyzing trace with hash 298223664, now seen corresponding path program 41 times [2019-01-14 21:43:36,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:36,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:36,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:36,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:36,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5874 backedges. 0 proven. 5874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:39,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:39,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:39,481 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:43:39,746 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-01-14 21:43:39,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:39,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5874 backedges. 0 proven. 5874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:39,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:39,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-01-14 21:43:39,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-14 21:43:39,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-14 21:43:39,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2019-01-14 21:43:39,841 INFO L87 Difference]: Start difference. First operand 628 states and 674 transitions. Second operand 92 states. [2019-01-14 21:43:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:41,870 INFO L93 Difference]: Finished difference Result 645 states and 693 transitions. [2019-01-14 21:43:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-14 21:43:41,872 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 315 [2019-01-14 21:43:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:41,876 INFO L225 Difference]: With dead ends: 645 [2019-01-14 21:43:41,876 INFO L226 Difference]: Without dead ends: 644 [2019-01-14 21:43:41,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5311, Invalid=13321, Unknown=0, NotChecked=0, Total=18632 [2019-01-14 21:43:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-01-14 21:43:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2019-01-14 21:43:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-01-14 21:43:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 689 transitions. [2019-01-14 21:43:41,889 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 689 transitions. Word has length 315 [2019-01-14 21:43:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:41,890 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 689 transitions. [2019-01-14 21:43:41,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-14 21:43:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 689 transitions. [2019-01-14 21:43:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-01-14 21:43:41,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:41,893 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 23, 23, 23, 23, 23, 23, 1, 1] [2019-01-14 21:43:41,895 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash 357400914, now seen corresponding path program 42 times [2019-01-14 21:43:41,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:41,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:41,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6142 backedges. 0 proven. 6142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:44,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:44,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:44,453 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:43:44,708 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-01-14 21:43:44,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:44,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6142 backedges. 0 proven. 6142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:44,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:44,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-01-14 21:43:44,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-14 21:43:44,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-14 21:43:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2019-01-14 21:43:44,810 INFO L87 Difference]: Start difference. First operand 642 states and 689 transitions. Second operand 94 states. [2019-01-14 21:43:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:46,970 INFO L93 Difference]: Finished difference Result 659 states and 708 transitions. [2019-01-14 21:43:46,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-14 21:43:46,971 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 322 [2019-01-14 21:43:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:46,975 INFO L225 Difference]: With dead ends: 659 [2019-01-14 21:43:46,975 INFO L226 Difference]: Without dead ends: 658 [2019-01-14 21:43:46,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5544, Invalid=13916, Unknown=0, NotChecked=0, Total=19460 [2019-01-14 21:43:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-01-14 21:43:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 656. [2019-01-14 21:43:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-01-14 21:43:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 704 transitions. [2019-01-14 21:43:46,990 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 704 transitions. Word has length 322 [2019-01-14 21:43:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:46,991 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 704 transitions. [2019-01-14 21:43:46,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-14 21:43:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 704 transitions. [2019-01-14 21:43:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-01-14 21:43:46,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:46,994 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 24, 24, 24, 23, 23, 23, 1, 1] [2019-01-14 21:43:46,994 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1328202, now seen corresponding path program 43 times [2019-01-14 21:43:46,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:46,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:46,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:46,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6417 backedges. 0 proven. 6417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:49,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:49,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:49,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:43:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:49,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6417 backedges. 0 proven. 6417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:50,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:50,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-01-14 21:43:50,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-14 21:43:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-14 21:43:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2019-01-14 21:43:50,078 INFO L87 Difference]: Start difference. First operand 656 states and 704 transitions. Second operand 96 states. [2019-01-14 21:43:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:52,344 INFO L93 Difference]: Finished difference Result 673 states and 723 transitions. [2019-01-14 21:43:52,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-14 21:43:52,346 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 329 [2019-01-14 21:43:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:52,349 INFO L225 Difference]: With dead ends: 673 [2019-01-14 21:43:52,349 INFO L226 Difference]: Without dead ends: 672 [2019-01-14 21:43:52,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5782, Invalid=14524, Unknown=0, NotChecked=0, Total=20306 [2019-01-14 21:43:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-01-14 21:43:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2019-01-14 21:43:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-01-14 21:43:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 719 transitions. [2019-01-14 21:43:52,361 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 719 transitions. Word has length 329 [2019-01-14 21:43:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:52,361 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 719 transitions. [2019-01-14 21:43:52,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-14 21:43:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 719 transitions. [2019-01-14 21:43:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-14 21:43:52,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:52,364 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 24, 24, 24, 24, 24, 24, 1, 1] [2019-01-14 21:43:52,364 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:52,364 INFO L82 PathProgramCache]: Analyzing trace with hash 525757196, now seen corresponding path program 44 times [2019-01-14 21:43:52,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:52,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:43:52,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:43:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6697 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:55,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:43:55,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:43:55,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:43:55,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:43:55,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:43:55,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:43:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6697 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:43:55,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:43:55,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-01-14 21:43:55,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-14 21:43:55,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-14 21:43:55,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2019-01-14 21:43:55,348 INFO L87 Difference]: Start difference. First operand 670 states and 719 transitions. Second operand 98 states. [2019-01-14 21:43:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:43:57,648 INFO L93 Difference]: Finished difference Result 687 states and 738 transitions. [2019-01-14 21:43:57,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-14 21:43:57,651 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 336 [2019-01-14 21:43:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:43:57,655 INFO L225 Difference]: With dead ends: 687 [2019-01-14 21:43:57,655 INFO L226 Difference]: Without dead ends: 686 [2019-01-14 21:43:57,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6025, Invalid=15145, Unknown=0, NotChecked=0, Total=21170 [2019-01-14 21:43:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-01-14 21:43:57,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 684. [2019-01-14 21:43:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-01-14 21:43:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 734 transitions. [2019-01-14 21:43:57,668 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 734 transitions. Word has length 336 [2019-01-14 21:43:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:43:57,668 INFO L480 AbstractCegarLoop]: Abstraction has 684 states and 734 transitions. [2019-01-14 21:43:57,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-14 21:43:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 734 transitions. [2019-01-14 21:43:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-01-14 21:43:57,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:43:57,674 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 25, 25, 25, 24, 24, 24, 1, 1] [2019-01-14 21:43:57,674 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:43:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:43:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2007675716, now seen corresponding path program 45 times [2019-01-14 21:43:57,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:43:57,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:43:57,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:57,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:43:57,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:43:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6984 backedges. 0 proven. 6984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:00,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:00,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:00,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:44:00,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-14 21:44:00,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:44:00,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6984 backedges. 0 proven. 6984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:00,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:00,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-01-14 21:44:00,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-14 21:44:00,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-14 21:44:00,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2019-01-14 21:44:00,930 INFO L87 Difference]: Start difference. First operand 684 states and 734 transitions. Second operand 100 states. [2019-01-14 21:44:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:03,033 INFO L93 Difference]: Finished difference Result 701 states and 753 transitions. [2019-01-14 21:44:03,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-14 21:44:03,035 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 343 [2019-01-14 21:44:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:03,039 INFO L225 Difference]: With dead ends: 701 [2019-01-14 21:44:03,039 INFO L226 Difference]: Without dead ends: 700 [2019-01-14 21:44:03,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6273, Invalid=15779, Unknown=0, NotChecked=0, Total=22052 [2019-01-14 21:44:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-01-14 21:44:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2019-01-14 21:44:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-01-14 21:44:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 749 transitions. [2019-01-14 21:44:03,051 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 749 transitions. Word has length 343 [2019-01-14 21:44:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:03,051 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 749 transitions. [2019-01-14 21:44:03,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-14 21:44:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 749 transitions. [2019-01-14 21:44:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-14 21:44:03,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:03,054 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 25, 25, 25, 25, 25, 25, 1, 1] [2019-01-14 21:44:03,054 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash -125909178, now seen corresponding path program 46 times [2019-01-14 21:44:03,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:03,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:03,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:44:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7276 backedges. 0 proven. 7276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:06,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:06,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:06,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:44:06,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:44:06,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:44:06,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7276 backedges. 0 proven. 7276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:06,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:06,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-01-14 21:44:06,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-14 21:44:06,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-14 21:44:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2019-01-14 21:44:06,609 INFO L87 Difference]: Start difference. First operand 698 states and 749 transitions. Second operand 102 states. [2019-01-14 21:44:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:08,760 INFO L93 Difference]: Finished difference Result 715 states and 768 transitions. [2019-01-14 21:44:08,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-14 21:44:08,762 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 350 [2019-01-14 21:44:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:08,765 INFO L225 Difference]: With dead ends: 715 [2019-01-14 21:44:08,765 INFO L226 Difference]: Without dead ends: 714 [2019-01-14 21:44:08,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6526, Invalid=16426, Unknown=0, NotChecked=0, Total=22952 [2019-01-14 21:44:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-01-14 21:44:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 712. [2019-01-14 21:44:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-01-14 21:44:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 764 transitions. [2019-01-14 21:44:08,778 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 764 transitions. Word has length 350 [2019-01-14 21:44:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:08,778 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 764 transitions. [2019-01-14 21:44:08,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-14 21:44:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 764 transitions. [2019-01-14 21:44:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-01-14 21:44:08,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:08,781 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 26, 26, 26, 25, 25, 25, 1, 1] [2019-01-14 21:44:08,781 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash 122788674, now seen corresponding path program 47 times [2019-01-14 21:44:08,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:08,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:08,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:08,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:44:08,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7575 backedges. 0 proven. 7575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:12,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:12,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:12,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:44:12,397 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2019-01-14 21:44:12,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:44:12,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7575 backedges. 0 proven. 7575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:12,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:12,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-01-14 21:44:12,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-14 21:44:12,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-14 21:44:12,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2019-01-14 21:44:12,538 INFO L87 Difference]: Start difference. First operand 712 states and 764 transitions. Second operand 104 states. [2019-01-14 21:44:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:14,847 INFO L93 Difference]: Finished difference Result 729 states and 783 transitions. [2019-01-14 21:44:14,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-14 21:44:14,849 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 357 [2019-01-14 21:44:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:14,853 INFO L225 Difference]: With dead ends: 729 [2019-01-14 21:44:14,853 INFO L226 Difference]: Without dead ends: 728 [2019-01-14 21:44:14,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6784, Invalid=17086, Unknown=0, NotChecked=0, Total=23870 [2019-01-14 21:44:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-01-14 21:44:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-01-14 21:44:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-01-14 21:44:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 779 transitions. [2019-01-14 21:44:14,865 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 779 transitions. Word has length 357 [2019-01-14 21:44:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:14,866 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 779 transitions. [2019-01-14 21:44:14,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-14 21:44:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 779 transitions. [2019-01-14 21:44:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-14 21:44:14,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:14,870 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 26, 26, 26, 26, 26, 26, 1, 1] [2019-01-14 21:44:14,870 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:14,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash -510904832, now seen corresponding path program 48 times [2019-01-14 21:44:14,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:14,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:14,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:44:14,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7879 backedges. 0 proven. 7879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:18,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:18,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:18,444 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:44:18,809 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2019-01-14 21:44:18,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:44:18,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7879 backedges. 0 proven. 7879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:18,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:18,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-01-14 21:44:18,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-14 21:44:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-14 21:44:18,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2019-01-14 21:44:18,995 INFO L87 Difference]: Start difference. First operand 726 states and 779 transitions. Second operand 106 states. [2019-01-14 21:44:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:21,802 INFO L93 Difference]: Finished difference Result 743 states and 798 transitions. [2019-01-14 21:44:21,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-14 21:44:21,804 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 364 [2019-01-14 21:44:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:21,807 INFO L225 Difference]: With dead ends: 743 [2019-01-14 21:44:21,807 INFO L226 Difference]: Without dead ends: 742 [2019-01-14 21:44:21,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7047, Invalid=17759, Unknown=0, NotChecked=0, Total=24806 [2019-01-14 21:44:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-01-14 21:44:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2019-01-14 21:44:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-01-14 21:44:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 794 transitions. [2019-01-14 21:44:21,819 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 794 transitions. Word has length 364 [2019-01-14 21:44:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:21,820 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 794 transitions. [2019-01-14 21:44:21,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-14 21:44:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 794 transitions. [2019-01-14 21:44:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-14 21:44:21,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:21,823 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 27, 27, 27, 26, 26, 26, 1, 1] [2019-01-14 21:44:21,823 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:21,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2138634424, now seen corresponding path program 49 times [2019-01-14 21:44:21,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:21,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:21,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:44:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:24,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:24,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:24,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:44:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:25,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:25,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:25,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2019-01-14 21:44:25,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-14 21:44:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-14 21:44:25,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2019-01-14 21:44:25,224 INFO L87 Difference]: Start difference. First operand 740 states and 794 transitions. Second operand 108 states. [2019-01-14 21:44:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:28,054 INFO L93 Difference]: Finished difference Result 757 states and 813 transitions. [2019-01-14 21:44:28,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-14 21:44:28,057 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 371 [2019-01-14 21:44:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:28,060 INFO L225 Difference]: With dead ends: 757 [2019-01-14 21:44:28,060 INFO L226 Difference]: Without dead ends: 756 [2019-01-14 21:44:28,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7315, Invalid=18445, Unknown=0, NotChecked=0, Total=25760 [2019-01-14 21:44:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-01-14 21:44:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 754. [2019-01-14 21:44:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-14 21:44:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 809 transitions. [2019-01-14 21:44:28,075 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 809 transitions. Word has length 371 [2019-01-14 21:44:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:28,075 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 809 transitions. [2019-01-14 21:44:28,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-14 21:44:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 809 transitions. [2019-01-14 21:44:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-01-14 21:44:28,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:28,078 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 27, 27, 27, 27, 27, 27, 1, 1] [2019-01-14 21:44:28,079 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash 15488826, now seen corresponding path program 50 times [2019-01-14 21:44:28,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:28,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:28,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:28,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:44:28,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 0 proven. 8506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:32,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:32,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:32,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:44:32,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:44:32,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:44:32,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 0 proven. 8506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:32,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:32,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2019-01-14 21:44:32,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-14 21:44:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-14 21:44:32,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2019-01-14 21:44:32,365 INFO L87 Difference]: Start difference. First operand 754 states and 809 transitions. Second operand 110 states. [2019-01-14 21:44:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:35,014 INFO L93 Difference]: Finished difference Result 771 states and 828 transitions. [2019-01-14 21:44:35,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-14 21:44:35,017 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 378 [2019-01-14 21:44:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:35,020 INFO L225 Difference]: With dead ends: 771 [2019-01-14 21:44:35,020 INFO L226 Difference]: Without dead ends: 770 [2019-01-14 21:44:35,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7588, Invalid=19144, Unknown=0, NotChecked=0, Total=26732 [2019-01-14 21:44:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-01-14 21:44:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 768. [2019-01-14 21:44:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-01-14 21:44:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 824 transitions. [2019-01-14 21:44:35,031 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 824 transitions. Word has length 378 [2019-01-14 21:44:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:35,032 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 824 transitions. [2019-01-14 21:44:35,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-14 21:44:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 824 transitions. [2019-01-14 21:44:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-14 21:44:35,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:35,034 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 28, 28, 28, 27, 27, 27, 1, 1] [2019-01-14 21:44:35,035 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash -453775154, now seen corresponding path program 51 times [2019-01-14 21:44:35,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:35,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:35,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:44:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8829 backedges. 0 proven. 8829 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:38,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:38,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:44:39,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-14 21:44:39,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:44:39,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8829 backedges. 0 proven. 8829 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:39,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:39,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2019-01-14 21:44:39,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-14 21:44:39,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-14 21:44:39,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2019-01-14 21:44:39,220 INFO L87 Difference]: Start difference. First operand 768 states and 824 transitions. Second operand 112 states. [2019-01-14 21:44:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:42,244 INFO L93 Difference]: Finished difference Result 785 states and 843 transitions. [2019-01-14 21:44:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-14 21:44:42,246 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 385 [2019-01-14 21:44:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:42,250 INFO L225 Difference]: With dead ends: 785 [2019-01-14 21:44:42,250 INFO L226 Difference]: Without dead ends: 784 [2019-01-14 21:44:42,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7866, Invalid=19856, Unknown=0, NotChecked=0, Total=27722 [2019-01-14 21:44:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-01-14 21:44:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2019-01-14 21:44:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-01-14 21:44:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 839 transitions. [2019-01-14 21:44:42,263 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 839 transitions. Word has length 385 [2019-01-14 21:44:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:42,263 INFO L480 AbstractCegarLoop]: Abstraction has 782 states and 839 transitions. [2019-01-14 21:44:42,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-14 21:44:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 839 transitions. [2019-01-14 21:44:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-14 21:44:42,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:42,267 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 28, 28, 28, 28, 28, 28, 1, 1] [2019-01-14 21:44:42,267 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:42,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1555352308, now seen corresponding path program 52 times [2019-01-14 21:44:42,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:42,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:42,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:42,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:44:42,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9157 backedges. 0 proven. 9157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:45,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:45,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:45,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:44:46,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:44:46,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:44:46,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9157 backedges. 0 proven. 9157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:46,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:46,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2019-01-14 21:44:46,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-14 21:44:46,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-14 21:44:46,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2019-01-14 21:44:46,131 INFO L87 Difference]: Start difference. First operand 782 states and 839 transitions. Second operand 114 states. [2019-01-14 21:44:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:49,273 INFO L93 Difference]: Finished difference Result 799 states and 858 transitions. [2019-01-14 21:44:49,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-01-14 21:44:49,274 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 392 [2019-01-14 21:44:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:49,278 INFO L225 Difference]: With dead ends: 799 [2019-01-14 21:44:49,278 INFO L226 Difference]: Without dead ends: 798 [2019-01-14 21:44:49,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8149, Invalid=20581, Unknown=0, NotChecked=0, Total=28730 [2019-01-14 21:44:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-01-14 21:44:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2019-01-14 21:44:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-01-14 21:44:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 854 transitions. [2019-01-14 21:44:49,292 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 854 transitions. Word has length 392 [2019-01-14 21:44:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:49,292 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 854 transitions. [2019-01-14 21:44:49,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-14 21:44:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 854 transitions. [2019-01-14 21:44:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-01-14 21:44:49,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:49,295 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 29, 29, 29, 28, 28, 28, 1, 1] [2019-01-14 21:44:49,295 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash -655444012, now seen corresponding path program 53 times [2019-01-14 21:44:49,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:49,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:44:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:44:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9492 backedges. 0 proven. 9492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:53,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:44:53,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:44:53,115 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:44:53,579 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-01-14 21:44:53,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:44:53,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:44:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9492 backedges. 0 proven. 9492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:44:53,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:44:53,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2019-01-14 21:44:53,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-14 21:44:53,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-14 21:44:53,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2019-01-14 21:44:53,709 INFO L87 Difference]: Start difference. First operand 796 states and 854 transitions. Second operand 116 states. [2019-01-14 21:44:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:44:56,720 INFO L93 Difference]: Finished difference Result 813 states and 873 transitions. [2019-01-14 21:44:56,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-14 21:44:56,723 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 399 [2019-01-14 21:44:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:44:56,725 INFO L225 Difference]: With dead ends: 813 [2019-01-14 21:44:56,725 INFO L226 Difference]: Without dead ends: 812 [2019-01-14 21:44:56,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8437, Invalid=21319, Unknown=0, NotChecked=0, Total=29756 [2019-01-14 21:44:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-01-14 21:44:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 810. [2019-01-14 21:44:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-01-14 21:44:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 869 transitions. [2019-01-14 21:44:56,739 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 869 transitions. Word has length 399 [2019-01-14 21:44:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:44:56,739 INFO L480 AbstractCegarLoop]: Abstraction has 810 states and 869 transitions. [2019-01-14 21:44:56,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-14 21:44:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 869 transitions. [2019-01-14 21:44:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-01-14 21:44:56,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:44:56,742 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 29, 29, 29, 29, 29, 29, 1, 1] [2019-01-14 21:44:56,742 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:44:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:44:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1419981102, now seen corresponding path program 54 times [2019-01-14 21:44:56,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:44:56,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:44:56,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:56,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:44:56,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:44:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:45:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9832 backedges. 0 proven. 9832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:45:00,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:45:00,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:45:00,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:45:01,226 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2019-01-14 21:45:01,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:45:01,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:45:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9832 backedges. 0 proven. 9832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:45:01,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:45:01,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2019-01-14 21:45:01,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-14 21:45:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-14 21:45:01,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2019-01-14 21:45:01,358 INFO L87 Difference]: Start difference. First operand 810 states and 869 transitions. Second operand 118 states. [2019-01-14 21:45:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:45:04,675 INFO L93 Difference]: Finished difference Result 827 states and 888 transitions. [2019-01-14 21:45:04,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-01-14 21:45:04,677 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 406 [2019-01-14 21:45:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:45:04,681 INFO L225 Difference]: With dead ends: 827 [2019-01-14 21:45:04,681 INFO L226 Difference]: Without dead ends: 826 [2019-01-14 21:45:04,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8730, Invalid=22070, Unknown=0, NotChecked=0, Total=30800 [2019-01-14 21:45:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-01-14 21:45:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 824. [2019-01-14 21:45:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2019-01-14 21:45:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 884 transitions. [2019-01-14 21:45:04,695 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 884 transitions. Word has length 406 [2019-01-14 21:45:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:45:04,695 INFO L480 AbstractCegarLoop]: Abstraction has 824 states and 884 transitions. [2019-01-14 21:45:04,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-14 21:45:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 884 transitions. [2019-01-14 21:45:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-01-14 21:45:04,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:45:04,698 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 30, 30, 30, 29, 29, 29, 1, 1] [2019-01-14 21:45:04,699 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:45:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:45:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash -98190246, now seen corresponding path program 55 times [2019-01-14 21:45:04,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:45:04,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:45:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:45:04,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:45:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:45:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:45:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10179 backedges. 0 proven. 10179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:45:08,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:45:08,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:45:08,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:45:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:45:09,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:45:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10179 backedges. 0 proven. 10179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:45:09,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:45:09,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2019-01-14 21:45:09,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-14 21:45:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-14 21:45:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2019-01-14 21:45:09,214 INFO L87 Difference]: Start difference. First operand 824 states and 884 transitions. Second operand 120 states. [2019-01-14 21:45:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:45:12,269 INFO L93 Difference]: Finished difference Result 841 states and 903 transitions. [2019-01-14 21:45:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-01-14 21:45:12,271 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 413 [2019-01-14 21:45:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:45:12,276 INFO L225 Difference]: With dead ends: 841 [2019-01-14 21:45:12,276 INFO L226 Difference]: Without dead ends: 840 [2019-01-14 21:45:12,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5075 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9028, Invalid=22834, Unknown=0, NotChecked=0, Total=31862 [2019-01-14 21:45:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-01-14 21:45:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2019-01-14 21:45:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-01-14 21:45:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 899 transitions. [2019-01-14 21:45:12,291 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 899 transitions. Word has length 413 [2019-01-14 21:45:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:45:12,291 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 899 transitions. [2019-01-14 21:45:12,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-14 21:45:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 899 transitions. [2019-01-14 21:45:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-14 21:45:12,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:45:12,295 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 30, 30, 30, 30, 30, 30, 1, 1] [2019-01-14 21:45:12,295 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:45:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:45:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1675810328, now seen corresponding path program 56 times [2019-01-14 21:45:12,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:45:12,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:45:12,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:45:12,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:45:12,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:45:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:45:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10531 backedges. 0 proven. 10531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:45:16,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:45:16,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:45:16,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:45:16,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:45:16,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:45:16,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:45:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10531 backedges. 0 proven. 10531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:45:16,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:45:16,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2019-01-14 21:45:16,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-14 21:45:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-14 21:45:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2019-01-14 21:45:16,663 INFO L87 Difference]: Start difference. First operand 838 states and 899 transitions. Second operand 122 states. [2019-01-14 21:45:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:45:20,087 INFO L93 Difference]: Finished difference Result 855 states and 918 transitions. [2019-01-14 21:45:20,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-01-14 21:45:20,090 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 420 [2019-01-14 21:45:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:45:20,094 INFO L225 Difference]: With dead ends: 855 [2019-01-14 21:45:20,094 INFO L226 Difference]: Without dead ends: 854 [2019-01-14 21:45:20,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9331, Invalid=23611, Unknown=0, NotChecked=0, Total=32942 [2019-01-14 21:45:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-01-14 21:45:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 852. [2019-01-14 21:45:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-01-14 21:45:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 914 transitions. [2019-01-14 21:45:20,111 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 914 transitions. Word has length 420 [2019-01-14 21:45:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:45:20,112 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 914 transitions. [2019-01-14 21:45:20,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-14 21:45:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 914 transitions. [2019-01-14 21:45:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-01-14 21:45:20,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:45:20,115 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 31, 31, 31, 30, 30, 30, 1, 1] [2019-01-14 21:45:20,115 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:45:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:45:20,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1516282272, now seen corresponding path program 57 times [2019-01-14 21:45:20,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:45:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:45:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:45:20,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:45:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:45:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:45:21,638 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 21:45:22,637 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 21:45:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10890 backedges. 10455 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:45:25,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:45:25,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:45:25,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:45:25,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-14 21:45:25,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:45:25,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:45:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10890 backedges. 0 proven. 10890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:45:34,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:45:34,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 122] total 215 [2019-01-14 21:45:34,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2019-01-14 21:45:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2019-01-14 21:45:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7253, Invalid=38757, Unknown=0, NotChecked=0, Total=46010 [2019-01-14 21:45:34,818 INFO L87 Difference]: Start difference. First operand 852 states and 914 transitions. Second operand 215 states. [2019-01-14 21:48:04,571 WARN L181 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 21:49:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:49:11,021 INFO L93 Difference]: Finished difference Result 7999 states and 8498 transitions. [2019-01-14 21:49:11,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2454 states. [2019-01-14 21:49:11,021 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 427 [2019-01-14 21:49:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:49:11,022 INFO L225 Difference]: With dead ends: 7999 [2019-01-14 21:49:11,022 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:49:11,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3903 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 2665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353048 ImplicationChecksByTransitivity, 175.4s TimeCoverageRelationStatistics Valid=579180, Invalid=6531042, Unknown=0, NotChecked=0, Total=7110222 [2019-01-14 21:49:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:49:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:49:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:49:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:49:11,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2019-01-14 21:49:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:49:11,191 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:49:11,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2019-01-14 21:49:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:49:11,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:49:11,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:49:25,834 WARN L181 SmtUtils]: Spent 14.62 s on a formula simplification. DAG size of input: 1224 DAG size of output: 1194 [2019-01-14 21:49:56,949 WARN L181 SmtUtils]: Spent 31.04 s on a formula simplification. DAG size of input: 1194 DAG size of output: 320 [2019-01-14 21:49:56,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:49:56,953 INFO L444 ceAbstractionStarter]: At program point L23(lines 20 24) the Hoare annotation is: (<= ULTIMATE.start_f_~a 2147483647) [2019-01-14 21:49:56,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 21:49:56,954 INFO L444 ceAbstractionStarter]: At program point L17(lines 9 18) the Hoare annotation is: (<= ULTIMATE.start_f_~a 2147483647) [2019-01-14 21:49:56,954 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-14 21:49:56,954 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-01-14 21:49:56,954 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-01-14 21:49:56,954 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-01-14 21:49:56,954 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2019-01-14 21:49:56,954 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 14) no Hoare annotation was computed. [2019-01-14 21:49:56,955 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 16) the Hoare annotation is: (let ((.cse7 (+ ULTIMATE.start_f_~a 1))) (let ((.cse6 (<= ULTIMATE.start_f_~a 2147483647)) (.cse3 (< 0 .cse7)) (.cse5 (div ULTIMATE.start_f_~a 2)) (.cse4 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 2))) (and (< 1 v_prenex_2) (< 0 v_prenex_2) (= .cse8 0) (not (= 0 (mod (+ v_prenex_2 1) 2))) (= .cse8 ULTIMATE.start_f_~tmp~0))))) (.cse0 (<= 0 ULTIMATE.start_f_~count~0)) (.cse1 (< 0 ULTIMATE.start_f_~a)) (.cse2 (not (= 0 (mod .cse7 2))))) (or (and .cse0 (<= ULTIMATE.start_f_~a 16777214) .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 16)) (and (<= ULTIMATE.start_f_~a 1073741824) .cse0 (<= ULTIMATE.start_f_~count~0 2) .cse3 .cse4) (and .cse0 (<= .cse5 511) (<= ULTIMATE.start_f_~count~0 43) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~count~0 10) .cse1 .cse2 (<= ULTIMATE.start_f_~a 134217726)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 1) .cse6) (and .cse0 (<= .cse5 524287) (<= ULTIMATE.start_f_~count~0 23) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~count~0 0) .cse6) (and .cse0 (<= ULTIMATE.start_f_~count~0 40) .cse1 .cse2 (<= ULTIMATE.start_f_~a 4094)) (and .cse0 (<= ULTIMATE.start_f_~count~0 33) .cse3 (<= .cse5 16383) .cse4) (and .cse0 (<= ULTIMATE.start_f_~count~0 48) .cse1 (<= ULTIMATE.start_f_~a 254) .cse2) (and .cse0 (<= ULTIMATE.start_f_~count~0 39) .cse3 .cse4 (<= .cse5 2047)) (and .cse0 .cse3 (<= ULTIMATE.start_f_~a 1) .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 12) (<= ULTIMATE.start_f_~a 67108862)) (and .cse0 (<= .cse5 4194303) (<= ULTIMATE.start_f_~count~0 17) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~count~0 38) .cse1 .cse2 (<= ULTIMATE.start_f_~a 8190)) (and .cse0 (<= .cse5 31) .cse3 .cse4 (<= ULTIMATE.start_f_~count~0 51)) (and .cse0 (<= ULTIMATE.start_f_~count~0 7) .cse3 .cse4 (<= .cse5 134217727)) (and .cse0 (<= ULTIMATE.start_f_~count~0 11) (<= .cse5 33554431) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~a 8388606) .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 18)) (and .cse0 (<= ULTIMATE.start_f_~count~0 13) (<= .cse5 16777215) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~a 126) (<= ULTIMATE.start_f_~count~0 50) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_f_~a 6) .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 58)) (and .cse0 (<= ULTIMATE.start_f_~count~0 8) (<= ULTIMATE.start_f_~a 268435454) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_f_~a 32766) .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 34)) (and .cse0 (<= .cse5 255) (<= ULTIMATE.start_f_~count~0 45) .cse3 .cse4) (and .cse0 .cse3 .cse4 (<= .cse5 1048575) (<= ULTIMATE.start_f_~count~0 21)) (and .cse0 (<= .cse5 8388607) .cse3 .cse4 (<= ULTIMATE.start_f_~count~0 15)) (and .cse0 (<= ULTIMATE.start_f_~count~0 22) (<= ULTIMATE.start_f_~a 2097150) .cse1 .cse2) (and .cse0 .cse3 .cse4 (<= .cse5 1023) (<= ULTIMATE.start_f_~count~0 41)) (and .cse0 (<= ULTIMATE.start_f_~count~0 26) (<= ULTIMATE.start_f_~a 524286) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_f_~a 33554430) (<= ULTIMATE.start_f_~count~0 14) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_f_~count~0 44) .cse1 .cse2 (<= ULTIMATE.start_f_~a 1022)) (and .cse0 (<= ULTIMATE.start_f_~count~0 56) .cse1 .cse2 (<= ULTIMATE.start_f_~a 14)) (and .cse0 (<= .cse5 63) .cse3 .cse4 (<= ULTIMATE.start_f_~count~0 49)) (and .cse0 (<= ULTIMATE.start_f_~count~0 19) (<= .cse5 2097151) .cse3 .cse4) (and .cse0 (<= .cse5 131071) (<= ULTIMATE.start_f_~count~0 27) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~a 62) (<= ULTIMATE.start_f_~count~0 52) .cse1 .cse2) (and .cse0 (<= .cse5 32767) .cse3 .cse4 (<= ULTIMATE.start_f_~count~0 31)) (and .cse0 (<= .cse5 15) (<= ULTIMATE.start_f_~count~0 53) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~count~0 60) .cse1 (<= ULTIMATE.start_f_~a 2) .cse2) (and .cse0 (<= ULTIMATE.start_f_~count~0 28) .cse1 .cse2 (<= ULTIMATE.start_f_~a 262142)) (and .cse0 (<= ULTIMATE.start_f_~a 2046) .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 42)) (and .cse0 (<= ULTIMATE.start_f_~count~0 47) (<= .cse5 127) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~a 510) .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 46)) (and .cse0 (<= ULTIMATE.start_f_~count~0 4) (<= ULTIMATE.start_f_~a 1073741823) .cse1 .cse2) (and (<= .cse5 8191) .cse0 .cse3 (<= ULTIMATE.start_f_~count~0 35) .cse4) (and .cse0 (<= .cse5 4095) (<= ULTIMATE.start_f_~count~0 37) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~a 4194302) .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 20)) (and .cse0 (<= .cse5 3) (<= ULTIMATE.start_f_~count~0 57) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~a 1048574) (<= ULTIMATE.start_f_~count~0 24) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_f_~count~0 54) (<= ULTIMATE.start_f_~a 30) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_f_~count~0 32) .cse1 (<= ULTIMATE.start_f_~a 65534) .cse2) (and .cse0 (<= .cse5 1) .cse3 .cse4 (<= ULTIMATE.start_f_~count~0 59)) (and .cse0 (<= .cse5 268435455) .cse3 .cse4 (<= ULTIMATE.start_f_~count~0 5)) (and (<= ULTIMATE.start_f_~a 16382) .cse0 .cse1 .cse2 (<= ULTIMATE.start_f_~count~0 36)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_f_~a 536870910) (<= ULTIMATE.start_f_~count~0 6)) (and .cse0 (<= ULTIMATE.start_f_~count~0 9) (<= .cse5 67108863) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~count~0 3) .cse3 .cse4 (<= .cse5 536870911)) (and .cse0 (<= .cse5 7) (<= ULTIMATE.start_f_~count~0 55) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_f_~count~0 29) .cse3 .cse4 (<= .cse5 65535)) (and .cse0 .cse3 (<= .cse5 262143) .cse4 (<= ULTIMATE.start_f_~count~0 25)) (and (<= ULTIMATE.start_f_~count~0 30) .cse0 (<= ULTIMATE.start_f_~a 131070) .cse1 .cse2)))) [2019-01-14 21:49:56,955 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 16) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 21:49:56,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-14 21:49:56,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,992 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,992 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,996 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:56,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,013 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,013 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,013 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,064 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,064 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,064 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,064 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,068 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,068 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,068 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,068 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,069 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,069 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,069 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,069 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,069 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,109 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,109 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,115 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,115 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:49:57 BoogieIcfgContainer [2019-01-14 21:49:57,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:49:57,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:49:57,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:49:57,201 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:49:57,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:41:53" (3/4) ... [2019-01-14 21:49:57,210 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:49:57,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 21:49:57,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:49:57,306 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= count && a <= 16777214) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 16) || ((((a <= 1073741824 && 0 <= count) && count <= 2) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a / 2 <= 511) && count <= 43) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 10) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 134217726)) || ((((0 <= count && 0 < a) && !(0 == (a + 1) % 2)) && count <= 1) && a <= 2147483647)) || ((((0 <= count && a / 2 <= 524287) && count <= 23) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((0 <= count && count <= 0) && a <= 2147483647)) || ((((0 <= count && count <= 40) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 4094)) || ((((0 <= count && count <= 33) && 0 < a + 1) && a / 2 <= 16383) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 48) && 0 < a) && a <= 254) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 39) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 2047)) || (((0 <= count && 0 < a + 1) && a <= 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && 0 < a) && !(0 == (a + 1) % 2)) && count <= 12) && a <= 67108862)) || ((((0 <= count && a / 2 <= 4194303) && count <= 17) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 38) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 8190)) || ((((0 <= count && a / 2 <= 31) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 51)) || ((((0 <= count && count <= 7) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 134217727)) || ((((0 <= count && count <= 11) && a / 2 <= 33554431) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 8388606) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 18)) || ((((0 <= count && count <= 13) && a / 2 <= 16777215) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 126) && count <= 50) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && a <= 6) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 58)) || ((((0 <= count && count <= 8) && a <= 268435454) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && a <= 32766) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 34)) || ((((0 <= count && a / 2 <= 255) && count <= 45) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 1048575) && count <= 21)) || ((((0 <= count && a / 2 <= 8388607) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 15)) || ((((0 <= count && count <= 22) && a <= 2097150) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 1023) && count <= 41)) || ((((0 <= count && count <= 26) && a <= 524286) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && a <= 33554430) && count <= 14) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 44) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 1022)) || ((((0 <= count && count <= 56) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 14)) || ((((0 <= count && a / 2 <= 63) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 49)) || ((((0 <= count && count <= 19) && a / 2 <= 2097151) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a / 2 <= 131071) && count <= 27) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 62) && count <= 52) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && a / 2 <= 32767) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 31)) || ((((0 <= count && a / 2 <= 15) && count <= 53) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 60) && 0 < a) && a <= 2) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 28) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 262142)) || ((((0 <= count && a <= 2046) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 42)) || ((((0 <= count && count <= 47) && a / 2 <= 127) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 510) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 46)) || ((((0 <= count && count <= 4) && a <= 1073741823) && 0 < a) && !(0 == (a + 1) % 2))) || ((((a / 2 <= 8191 && 0 <= count) && 0 < a + 1) && count <= 35) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a / 2 <= 4095) && count <= 37) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 4194302) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 20)) || ((((0 <= count && a / 2 <= 3) && count <= 57) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 1048574) && count <= 24) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 54) && a <= 30) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 32) && 0 < a) && a <= 65534) && !(0 == (a + 1) % 2))) || ((((0 <= count && a / 2 <= 1) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 59)) || ((((0 <= count && a / 2 <= 268435455) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 5)) || ((((a <= 16382 && 0 <= count) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 36)) || ((((0 <= count && 0 < a) && !(0 == (a + 1) % 2)) && a <= 536870910) && count <= 6)) || ((((0 <= count && count <= 9) && a / 2 <= 67108863) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 3) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 536870911)) || ((((0 <= count && a / 2 <= 7) && count <= 55) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 29) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 65535)) || ((((0 <= count && 0 < a + 1) && a / 2 <= 262143) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 25)) || ((((count <= 30 && 0 <= count) && a <= 131070) && 0 < a) && !(0 == (a + 1) % 2)) [2019-01-14 21:49:57,337 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:49:57,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:49:57,338 INFO L168 Benchmark]: Toolchain (without parser) took 484595.94 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 946.0 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 919.8 MB. Max. memory is 11.5 GB. [2019-01-14 21:49:57,339 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:49:57,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.88 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:49:57,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.74 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:49:57,340 INFO L168 Benchmark]: Boogie Preprocessor took 33.73 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:49:57,343 INFO L168 Benchmark]: RCFGBuilder took 465.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 21:49:57,343 INFO L168 Benchmark]: TraceAbstraction took 483627.55 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-01-14 21:49:57,344 INFO L168 Benchmark]: Witness Printer took 136.81 ms. Allocated memory is still 5.3 GB. Free memory is still 4.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:49:57,348 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.88 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.74 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.73 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 465.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 483627.55 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 136.81 ms. Allocated memory is still 5.3 GB. Free memory is still 4.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: a <= 2147483647 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: a <= 2147483647 - InvariantResult [Line: 11]: Loop Invariant [2019-01-14 21:49:57,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,617 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,617 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,618 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,618 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,619 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,619 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,628 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,628 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,628 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 21:49:57,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= count && a <= 16777214) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 16) || ((((a <= 1073741824 && 0 <= count) && count <= 2) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a / 2 <= 511) && count <= 43) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 10) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 134217726)) || ((((0 <= count && 0 < a) && !(0 == (a + 1) % 2)) && count <= 1) && a <= 2147483647)) || ((((0 <= count && a / 2 <= 524287) && count <= 23) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((0 <= count && count <= 0) && a <= 2147483647)) || ((((0 <= count && count <= 40) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 4094)) || ((((0 <= count && count <= 33) && 0 < a + 1) && a / 2 <= 16383) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 48) && 0 < a) && a <= 254) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 39) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 2047)) || (((0 <= count && 0 < a + 1) && a <= 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && 0 < a) && !(0 == (a + 1) % 2)) && count <= 12) && a <= 67108862)) || ((((0 <= count && a / 2 <= 4194303) && count <= 17) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 38) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 8190)) || ((((0 <= count && a / 2 <= 31) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 51)) || ((((0 <= count && count <= 7) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 134217727)) || ((((0 <= count && count <= 11) && a / 2 <= 33554431) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 8388606) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 18)) || ((((0 <= count && count <= 13) && a / 2 <= 16777215) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 126) && count <= 50) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && a <= 6) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 58)) || ((((0 <= count && count <= 8) && a <= 268435454) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && a <= 32766) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 34)) || ((((0 <= count && a / 2 <= 255) && count <= 45) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 1048575) && count <= 21)) || ((((0 <= count && a / 2 <= 8388607) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 15)) || ((((0 <= count && count <= 22) && a <= 2097150) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 1023) && count <= 41)) || ((((0 <= count && count <= 26) && a <= 524286) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && a <= 33554430) && count <= 14) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 44) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 1022)) || ((((0 <= count && count <= 56) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 14)) || ((((0 <= count && a / 2 <= 63) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 49)) || ((((0 <= count && count <= 19) && a / 2 <= 2097151) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a / 2 <= 131071) && count <= 27) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 62) && count <= 52) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && a / 2 <= 32767) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 31)) || ((((0 <= count && a / 2 <= 15) && count <= 53) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 60) && 0 < a) && a <= 2) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 28) && 0 < a) && !(0 == (a + 1) % 2)) && a <= 262142)) || ((((0 <= count && a <= 2046) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 42)) || ((((0 <= count && count <= 47) && a / 2 <= 127) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 510) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 46)) || ((((0 <= count && count <= 4) && a <= 1073741823) && 0 < a) && !(0 == (a + 1) % 2))) || ((((a / 2 <= 8191 && 0 <= count) && 0 < a + 1) && count <= 35) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a / 2 <= 4095) && count <= 37) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 4194302) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 20)) || ((((0 <= count && a / 2 <= 3) && count <= 57) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && a <= 1048574) && count <= 24) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 54) && a <= 30) && 0 < a) && !(0 == (a + 1) % 2))) || ((((0 <= count && count <= 32) && 0 < a) && a <= 65534) && !(0 == (a + 1) % 2))) || ((((0 <= count && a / 2 <= 1) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 59)) || ((((0 <= count && a / 2 <= 268435455) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 5)) || ((((a <= 16382 && 0 <= count) && 0 < a) && !(0 == (a + 1) % 2)) && count <= 36)) || ((((0 <= count && 0 < a) && !(0 == (a + 1) % 2)) && a <= 536870910) && count <= 6)) || ((((0 <= count && count <= 9) && a / 2 <= 67108863) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 3) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 536870911)) || ((((0 <= count && a / 2 <= 7) && count <= 55) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp))) || ((((0 <= count && count <= 29) && 0 < a + 1) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && a / 2 <= 65535)) || ((((0 <= count && 0 < a + 1) && a / 2 <= 262143) && (\exists v_prenex_2 : int :: (((1 < v_prenex_2 && 0 < v_prenex_2) && v_prenex_2 % 2 == 0) && !(0 == (v_prenex_2 + 1) % 2)) && v_prenex_2 % 2 == tmp)) && count <= 25)) || ((((count <= 30 && 0 <= count) && a <= 131070) && 0 < a) && !(0 == (a + 1) % 2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 6 error locations. SAFE Result, 483.3s OverallTime, 64 OverallIterations, 61 TraceHistogramMax, 300.3s AutomataDifference, 0.0s DeadEndRemovalTime, 45.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 656 SDtfs, 43292 SDslu, 26299 SDs, 0 SdLazy, 28138 SolverSat, 9120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22176 GetRequests, 13986 SyntacticMatches, 0 SemanticMatches, 8190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3459709 ImplicationChecksByTransitivity, 334.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=852occurred in iteration=63, 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: 0.6s AutomataMinimizationTime, 64 MinimizatonAttempts, 119 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 969 NumberOfFragments, 1973 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1320 FormulaSimplificationTreeSizeReduction, 14.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 30704 FormulaSimplificationTreeSizeReductionInter, 31.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 120.8s InterpolantComputationTime, 26484 NumberOfCodeBlocks, 26477 NumberOfCodeBlocksAsserted, 942 NumberOfCheckSat, 26360 ConstructedInterpolants, 1 QuantifiedInterpolants, 22936753 SizeOfPredicates, 1889 NumberOfNonLiveVariables, 27912 ConjunctsInSsa, 3841 ConjunctsInUnsatCore, 124 InterpolantComputations, 4 PerfectInterpolantSequences, 10493/448348 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...