./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 01:32:53,192 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:32:53,193 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:32:53,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:32:53,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:32:53,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:32:53,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:32:53,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:32:53,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:32:53,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:32:53,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:32:53,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:32:53,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:32:53,218 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:32:53,221 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:32:53,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:32:53,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:32:53,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:32:53,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:32:53,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:32:53,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:32:53,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:32:53,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:32:53,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:32:53,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:32:53,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:32:53,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:32:53,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:32:53,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:32:53,253 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:32:53,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:32:53,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:32:53,254 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:32:53,255 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:32:53,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:32:53,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:32:53,258 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:32:53,283 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:32:53,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:32:53,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:32:53,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:32:53,285 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:32:53,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:32:53,287 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:32:53,287 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:32:53,287 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:32:53,288 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:32:53,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:32:53,288 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:32:53,288 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:32:53,288 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:32:53,289 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:32:53,290 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:32:53,290 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:32:53,290 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:32:53,291 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:32:53,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:32:53,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:32:53,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:32:53,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:32:53,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:32:53,293 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:32:53,293 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:32:53,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:32:53,293 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 01:32:53,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:32:53,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:32:53,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:32:53,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:32:53,357 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:32:53,358 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 01:32:53,415 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6cb55db6/e0274c567a4943c6af23fb95d25c8936/FLAG616d270a0 [2019-01-14 01:32:53,819 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:32:53,820 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/aviad_true-termination_true-no-overflow.c [2019-01-14 01:32:53,826 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6cb55db6/e0274c567a4943c6af23fb95d25c8936/FLAG616d270a0 [2019-01-14 01:32:54,200 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6cb55db6/e0274c567a4943c6af23fb95d25c8936 [2019-01-14 01:32:54,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:32:54,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:32:54,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:32:54,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:32:54,209 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:32:54,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d61bf9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54, skipping insertion in model container [2019-01-14 01:32:54,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:32:54,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:32:54,453 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:32:54,460 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:32:54,483 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:32:54,508 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:32:54,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54 WrapperNode [2019-01-14 01:32:54,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:32:54,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:32:54,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:32:54,513 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:32:54,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:32:54,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:32:54,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:32:54,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:32:54,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (1/1) ... [2019-01-14 01:32:54,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:32:54,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:32:54,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:32:54,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:32:54,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (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 01:32:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:32:54,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:32:54,976 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:32:54,976 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 01:32:54,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:32:54 BoogieIcfgContainer [2019-01-14 01:32:54,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:32:54,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:32:54,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:32:54,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:32:54,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:32:54" (1/3) ... [2019-01-14 01:32:54,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4934b9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:32:54, skipping insertion in model container [2019-01-14 01:32:54,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:32:54" (2/3) ... [2019-01-14 01:32:54,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4934b9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:32:54, skipping insertion in model container [2019-01-14 01:32:54,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:32:54" (3/3) ... [2019-01-14 01:32:54,985 INFO L112 eAbstractionObserver]: Analyzing ICFG aviad_true-termination_true-no-overflow.c [2019-01-14 01:32:54,995 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:32:55,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 01:32:55,021 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 01:32:55,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:32:55,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:32:55,060 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:32:55,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:32:55,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:32:55,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:32:55,061 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:32:55,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:32:55,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:32:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-14 01:32:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 01:32:55,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:32:55,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 01:32:55,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:32:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:32:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash 963531, now seen corresponding path program 1 times [2019-01-14 01:32:55,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:32:55,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:32:55,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:32:55,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:32:55,256 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 01:32:55,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:32:55,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:32:55,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:32:55,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:32:55,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:32:55,280 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-01-14 01:32:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:32:55,367 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-14 01:32:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:32:55,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 01:32:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:32:55,378 INFO L225 Difference]: With dead ends: 26 [2019-01-14 01:32:55,379 INFO L226 Difference]: Without dead ends: 14 [2019-01-14 01:32:55,382 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 01:32:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-14 01:32:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-14 01:32:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 01:32:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-14 01:32:55,412 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2019-01-14 01:32:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:32:55,412 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-14 01:32:55,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:32:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-14 01:32:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:32:55,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:32:55,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:32:55,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:32:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:32:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash 29869514, now seen corresponding path program 1 times [2019-01-14 01:32:55,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:32:55,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:32:55,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:32:55,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:32:55,456 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 01:32:55,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:32:55,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:32:55,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:32:55,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:32:55,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:32:55,460 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-01-14 01:32:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:32:55,539 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-01-14 01:32:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:32:55,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 01:32:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:32:55,541 INFO L225 Difference]: With dead ends: 14 [2019-01-14 01:32:55,541 INFO L226 Difference]: Without dead ends: 12 [2019-01-14 01:32:55,542 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 01:32:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-14 01:32:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 01:32:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 01:32:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-14 01:32:55,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 5 [2019-01-14 01:32:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:32:55,545 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 01:32:55,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:32:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-14 01:32:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:32:55,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:32:55,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:32:55,546 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:32:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:32:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1360166356, now seen corresponding path program 1 times [2019-01-14 01:32:55,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:32:55,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:32:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:32:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:32:55,605 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 01:32:55,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:32:55,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:32:55,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:32:55,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:32:55,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:32:55,607 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 4 states. [2019-01-14 01:32:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:32:55,695 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-01-14 01:32:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:32:55,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-14 01:32:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:32:55,697 INFO L225 Difference]: With dead ends: 23 [2019-01-14 01:32:55,697 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 01:32:55,698 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 01:32:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 01:32:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-01-14 01:32:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 01:32:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-14 01:32:55,703 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2019-01-14 01:32:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:32:55,703 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-14 01:32:55,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:32:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-01-14 01:32:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:32:55,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:32:55,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:32:55,705 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:32:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:32:55,705 INFO L82 PathProgramCache]: Analyzing trace with hash 784515983, now seen corresponding path program 1 times [2019-01-14 01:32:55,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:32:55,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:32:55,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:32:55,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:32:55,742 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 01:32:55,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:32:55,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:32:55,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:32:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:32:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:32:55,744 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2019-01-14 01:32:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:32:55,792 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-01-14 01:32:55,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:32:55,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-14 01:32:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:32:55,793 INFO L225 Difference]: With dead ends: 20 [2019-01-14 01:32:55,793 INFO L226 Difference]: Without dead ends: 19 [2019-01-14 01:32:55,794 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 01:32:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-14 01:32:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-14 01:32:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 01:32:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-01-14 01:32:55,798 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 8 [2019-01-14 01:32:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:32:55,798 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-14 01:32:55,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:32:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-01-14 01:32:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:32:55,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:32:55,799 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:32:55,800 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:32:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:32:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -938741348, now seen corresponding path program 1 times [2019-01-14 01:32:55,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:32:55,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:32:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:32:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:32:55,939 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 01:32:55,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:32:55,939 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 01:32:55,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:32:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:32:56,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:32:56,035 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 01:32:56,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:32:56,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:32:56,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:32:56,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:32:56,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:32:56,068 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2019-01-14 01:32:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:32:56,460 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-14 01:32:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:32:56,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 01:32:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:32:56,462 INFO L225 Difference]: With dead ends: 30 [2019-01-14 01:32:56,462 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 01:32:56,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:32:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 01:32:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-14 01:32:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 01:32:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-01-14 01:32:56,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 14 [2019-01-14 01:32:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:32:56,469 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-14 01:32:56,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:32:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-01-14 01:32:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 01:32:56,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:32:56,471 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 01:32:56,471 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:32:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:32:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash -433699796, now seen corresponding path program 2 times [2019-01-14 01:32:56,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:32:56,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:32:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:56,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:32:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:32:56,594 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 01:32:56,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:32:56,595 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 01:32:56,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:32:56,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:32:56,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:32:56,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:32:56,662 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 01:32:56,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:32:56,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:32:56,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:32:56,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:32:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:32:56,693 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2019-01-14 01:32:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:32:56,947 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-14 01:32:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:32:56,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-01-14 01:32:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:32:56,950 INFO L225 Difference]: With dead ends: 39 [2019-01-14 01:32:56,950 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 01:32:56,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:32:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 01:32:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-14 01:32:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 01:32:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-01-14 01:32:56,961 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-01-14 01:32:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:32:56,961 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 01:32:56,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:32:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-01-14 01:32:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 01:32:56,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:32:56,963 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-14 01:32:56,963 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:32:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:32:56,964 INFO L82 PathProgramCache]: Analyzing trace with hash 634711964, now seen corresponding path program 3 times [2019-01-14 01:32:56,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:32:56,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:32:56,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:56,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:32:56,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:32:57,128 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 01:32:57,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:32:57,128 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 01:32:57,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:32:57,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 01:32:57,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:32:57,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:32:57,424 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2019-01-14 01:32:57,870 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 01:32:57,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:32:57,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2019-01-14 01:32:57,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 01:32:57,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 01:32:57,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:32:57,893 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 14 states. [2019-01-14 01:32:58,954 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 01:32:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:32:59,669 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2019-01-14 01:32:59,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 01:32:59,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-01-14 01:32:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:32:59,671 INFO L225 Difference]: With dead ends: 94 [2019-01-14 01:32:59,671 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 01:32:59,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:32:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 01:32:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-14 01:32:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 01:32:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-01-14 01:32:59,685 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 28 [2019-01-14 01:32:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:32:59,685 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-01-14 01:32:59,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 01:32:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-01-14 01:32:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 01:32:59,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:32:59,687 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1] [2019-01-14 01:32:59,687 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:32:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:32:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash -262032200, now seen corresponding path program 1 times [2019-01-14 01:32:59,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:32:59,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:32:59,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:59,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:32:59,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:32:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:00,071 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 01:33:00,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:00,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 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 01:33:00,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:00,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:00,139 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 01:33:00,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:00,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:33:00,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:33:00,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:33:00,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:33:00,165 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 12 states. [2019-01-14 01:33:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:00,599 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-01-14 01:33:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:33:00,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-01-14 01:33:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:00,602 INFO L225 Difference]: With dead ends: 85 [2019-01-14 01:33:00,602 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 01:33:00,603 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 01:33:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 01:33:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-01-14 01:33:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-14 01:33:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2019-01-14 01:33:00,612 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 35 [2019-01-14 01:33:00,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:00,612 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2019-01-14 01:33:00,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:33:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2019-01-14 01:33:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 01:33:00,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:00,614 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1] [2019-01-14 01:33:00,615 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:00,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2052543542, now seen corresponding path program 2 times [2019-01-14 01:33:00,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:00,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:00,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:00,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:00,820 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 01:33:00,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:00,821 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 01:33:00,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:33:00,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:33:00,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:00,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:00,901 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 01:33:00,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 01:33:00,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 01:33:00,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 01:33:00,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:33:00,920 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 14 states. [2019-01-14 01:33:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:01,081 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2019-01-14 01:33:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 01:33:01,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-01-14 01:33:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:01,084 INFO L225 Difference]: With dead ends: 99 [2019-01-14 01:33:01,084 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 01:33:01,085 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 01:33:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 01:33:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-01-14 01:33:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 01:33:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-01-14 01:33:01,095 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 42 [2019-01-14 01:33:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:01,095 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-01-14 01:33:01,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 01:33:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-01-14 01:33:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 01:33:01,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:01,097 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1] [2019-01-14 01:33:01,098 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash 639261246, now seen corresponding path program 3 times [2019-01-14 01:33:01,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:01,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:01,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:01,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:01,368 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 01:33:01,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:01,369 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 01:33:01,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:33:01,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 01:33:01,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:01,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:01,421 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 01:33:01,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:01,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-14 01:33:01,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 01:33:01,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 01:33:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:33:01,440 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 16 states. [2019-01-14 01:33:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:01,575 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2019-01-14 01:33:01,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 01:33:01,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-01-14 01:33:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:01,578 INFO L225 Difference]: With dead ends: 113 [2019-01-14 01:33:01,578 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 01:33:01,579 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 01:33:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 01:33:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-01-14 01:33:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 01:33:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-01-14 01:33:01,589 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 49 [2019-01-14 01:33:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:01,589 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-01-14 01:33:01,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 01:33:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-01-14 01:33:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 01:33:01,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:01,592 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1] [2019-01-14 01:33:01,592 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1924785028, now seen corresponding path program 4 times [2019-01-14 01:33:01,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:01,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:01,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:02,024 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 01:33:02,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:02,025 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 01:33:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:33:02,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:33:02,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:02,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:02,081 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 01:33:02,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:02,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-14 01:33:02,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 01:33:02,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 01:33:02,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:33:02,101 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 18 states. [2019-01-14 01:33:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:02,360 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-01-14 01:33:02,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 01:33:02,361 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-01-14 01:33:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:02,363 INFO L225 Difference]: With dead ends: 127 [2019-01-14 01:33:02,363 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 01:33:02,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-01-14 01:33:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 01:33:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-01-14 01:33:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-14 01:33:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-01-14 01:33:02,375 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 56 [2019-01-14 01:33:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:02,376 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-01-14 01:33:02,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 01:33:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-01-14 01:33:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 01:33:02,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:02,380 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1] [2019-01-14 01:33:02,380 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:02,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1848106308, now seen corresponding path program 5 times [2019-01-14 01:33:02,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:02,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:02,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:02,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:02,647 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 01:33:02,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:02,647 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 01:33:02,656 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:33:02,742 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-14 01:33:02,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:02,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:02,770 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 01:33:02,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:02,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-14 01:33:02,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 01:33:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 01:33:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:33:02,793 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 20 states. [2019-01-14 01:33:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:03,078 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2019-01-14 01:33:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 01:33:03,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2019-01-14 01:33:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:03,082 INFO L225 Difference]: With dead ends: 141 [2019-01-14 01:33:03,082 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 01:33:03,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2019-01-14 01:33:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 01:33:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-01-14 01:33:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-14 01:33:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2019-01-14 01:33:03,099 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 63 [2019-01-14 01:33:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:03,100 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2019-01-14 01:33:03,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 01:33:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2019-01-14 01:33:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 01:33:03,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:03,103 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1] [2019-01-14 01:33:03,103 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:03,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:03,103 INFO L82 PathProgramCache]: Analyzing trace with hash 457838014, now seen corresponding path program 6 times [2019-01-14 01:33:03,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:03,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:03,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:03,529 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 01:33:03,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:03,529 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 01:33:03,547 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:33:03,583 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 01:33:03,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:03,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:03,609 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 01:33:03,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:03,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-14 01:33:03,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 01:33:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 01:33:03,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 01:33:03,639 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 22 states. [2019-01-14 01:33:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:03,927 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2019-01-14 01:33:03,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 01:33:03,928 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2019-01-14 01:33:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:03,930 INFO L225 Difference]: With dead ends: 155 [2019-01-14 01:33:03,930 INFO L226 Difference]: Without dead ends: 154 [2019-01-14 01:33:03,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=686, Unknown=0, NotChecked=0, Total=992 [2019-01-14 01:33:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-14 01:33:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-01-14 01:33:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-14 01:33:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2019-01-14 01:33:03,941 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 70 [2019-01-14 01:33:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:03,941 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2019-01-14 01:33:03,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 01:33:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2019-01-14 01:33:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 01:33:03,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:03,945 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 6, 6, 6, 5, 5, 5, 1, 1] [2019-01-14 01:33:03,945 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:03,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2113445322, now seen corresponding path program 7 times [2019-01-14 01:33:03,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:03,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:03,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:03,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:04,362 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 01:33:04,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:04,362 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 01:33:04,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:04,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:04,419 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 01:33:04,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:04,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-14 01:33:04,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 01:33:04,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 01:33:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:33:04,448 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 24 states. [2019-01-14 01:33:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:04,855 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2019-01-14 01:33:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 01:33:04,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2019-01-14 01:33:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:04,858 INFO L225 Difference]: With dead ends: 169 [2019-01-14 01:33:04,858 INFO L226 Difference]: Without dead ends: 168 [2019-01-14 01:33:04,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=826, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 01:33:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-14 01:33:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-01-14 01:33:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-14 01:33:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2019-01-14 01:33:04,868 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 77 [2019-01-14 01:33:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:04,868 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2019-01-14 01:33:04,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 01:33:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2019-01-14 01:33:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 01:33:04,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:04,871 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 6, 6, 6, 6, 6, 6, 1, 1] [2019-01-14 01:33:04,872 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -486618504, now seen corresponding path program 8 times [2019-01-14 01:33:04,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:04,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:04,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:04,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:04,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:05,296 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 01:33:05,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:05,297 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 01:33:05,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:33:05,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:33:05,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:05,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:05,363 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 01:33:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:05,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-14 01:33:05,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 01:33:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 01:33:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 01:33:05,391 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 26 states. [2019-01-14 01:33:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:05,865 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2019-01-14 01:33:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 01:33:05,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2019-01-14 01:33:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:05,869 INFO L225 Difference]: With dead ends: 183 [2019-01-14 01:33:05,869 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 01:33:05,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=427, Invalid=979, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 01:33:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 01:33:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-01-14 01:33:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 01:33:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2019-01-14 01:33:05,878 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 84 [2019-01-14 01:33:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:05,879 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2019-01-14 01:33:05,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 01:33:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2019-01-14 01:33:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 01:33:05,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:05,880 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 7, 7, 7, 6, 6, 6, 1, 1] [2019-01-14 01:33:05,880 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:05,881 INFO L82 PathProgramCache]: Analyzing trace with hash 978516944, now seen corresponding path program 9 times [2019-01-14 01:33:05,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:05,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:05,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:05,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:05,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:06,486 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 01:33:06,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:06,487 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 01:33:06,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:33:06,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-14 01:33:06,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:06,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:06,568 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 01:33:06,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:06,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-14 01:33:06,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 01:33:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 01:33:06,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 01:33:06,598 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 28 states. [2019-01-14 01:33:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:06,953 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2019-01-14 01:33:06,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 01:33:06,954 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-01-14 01:33:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:06,956 INFO L225 Difference]: With dead ends: 197 [2019-01-14 01:33:06,957 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 01:33:06,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=495, Invalid=1145, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 01:33:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 01:33:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-01-14 01:33:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-14 01:33:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2019-01-14 01:33:06,967 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 91 [2019-01-14 01:33:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:06,969 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2019-01-14 01:33:06,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 01:33:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2019-01-14 01:33:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 01:33:06,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:06,970 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 7, 7, 7, 7, 7, 7, 1, 1] [2019-01-14 01:33:06,972 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1960461902, now seen corresponding path program 10 times [2019-01-14 01:33:06,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:06,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:06,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:07,463 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 01:33:07,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:07,464 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 01:33:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:33:07,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:33:07,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:07,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:07,554 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 01:33:07,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:07,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-14 01:33:07,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 01:33:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 01:33:07,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 01:33:07,576 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand 30 states. [2019-01-14 01:33:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:07,887 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2019-01-14 01:33:07,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 01:33:07,889 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 98 [2019-01-14 01:33:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:07,891 INFO L225 Difference]: With dead ends: 211 [2019-01-14 01:33:07,891 INFO L226 Difference]: Without dead ends: 210 [2019-01-14 01:33:07,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=568, Invalid=1324, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:33:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-14 01:33:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-01-14 01:33:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-01-14 01:33:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2019-01-14 01:33:07,901 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 98 [2019-01-14 01:33:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:07,901 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2019-01-14 01:33:07,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 01:33:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2019-01-14 01:33:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 01:33:07,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:07,904 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 8, 8, 8, 7, 7, 7, 1, 1] [2019-01-14 01:33:07,904 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash -44738730, now seen corresponding path program 11 times [2019-01-14 01:33:07,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:07,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:07,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:08,373 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 01:33:08,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:08,374 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 01:33:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:33:08,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-01-14 01:33:08,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:08,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:08,471 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 01:33:08,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:08,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-01-14 01:33:08,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 01:33:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 01:33:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 01:33:08,501 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 32 states. [2019-01-14 01:33:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:09,050 INFO L93 Difference]: Finished difference Result 225 states and 243 transitions. [2019-01-14 01:33:09,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 01:33:09,051 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 105 [2019-01-14 01:33:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:09,053 INFO L225 Difference]: With dead ends: 225 [2019-01-14 01:33:09,053 INFO L226 Difference]: Without dead ends: 224 [2019-01-14 01:33:09,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=646, Invalid=1516, Unknown=0, NotChecked=0, Total=2162 [2019-01-14 01:33:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-14 01:33:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-01-14 01:33:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-14 01:33:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 239 transitions. [2019-01-14 01:33:09,065 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 239 transitions. Word has length 105 [2019-01-14 01:33:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:09,066 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 239 transitions. [2019-01-14 01:33:09,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 01:33:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 239 transitions. [2019-01-14 01:33:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 01:33:09,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:09,069 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 8, 8, 8, 8, 8, 8, 1, 1] [2019-01-14 01:33:09,070 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:09,071 INFO L82 PathProgramCache]: Analyzing trace with hash 750025580, now seen corresponding path program 12 times [2019-01-14 01:33:09,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:09,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:09,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:10,385 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 01:33:10,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:10,385 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 01:33:10,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:33:10,452 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-14 01:33:10,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:10,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:10,481 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 01:33:10,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:10,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-01-14 01:33:10,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 01:33:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 01:33:10,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 01:33:10,501 INFO L87 Difference]: Start difference. First operand 222 states and 239 transitions. Second operand 34 states. [2019-01-14 01:33:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:10,897 INFO L93 Difference]: Finished difference Result 239 states and 258 transitions. [2019-01-14 01:33:10,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 01:33:10,899 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 112 [2019-01-14 01:33:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:10,901 INFO L225 Difference]: With dead ends: 239 [2019-01-14 01:33:10,901 INFO L226 Difference]: Without dead ends: 238 [2019-01-14 01:33:10,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=729, Invalid=1721, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 01:33:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-14 01:33:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-01-14 01:33:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-14 01:33:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 254 transitions. [2019-01-14 01:33:10,910 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 254 transitions. Word has length 112 [2019-01-14 01:33:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:10,910 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 254 transitions. [2019-01-14 01:33:10,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 01:33:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 254 transitions. [2019-01-14 01:33:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-14 01:33:10,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:10,914 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 9, 9, 9, 8, 8, 8, 1, 1] [2019-01-14 01:33:10,914 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1551241308, now seen corresponding path program 13 times [2019-01-14 01:33:10,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:10,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:10,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:12,611 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 01:33:12,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:12,611 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 01:33:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:12,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:12,702 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 01:33:12,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:12,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-01-14 01:33:12,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 01:33:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 01:33:12,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 01:33:12,734 INFO L87 Difference]: Start difference. First operand 236 states and 254 transitions. Second operand 36 states. [2019-01-14 01:33:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:13,268 INFO L93 Difference]: Finished difference Result 253 states and 273 transitions. [2019-01-14 01:33:13,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 01:33:13,270 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 119 [2019-01-14 01:33:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:13,272 INFO L225 Difference]: With dead ends: 253 [2019-01-14 01:33:13,272 INFO L226 Difference]: Without dead ends: 252 [2019-01-14 01:33:13,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=817, Invalid=1939, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 01:33:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-14 01:33:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2019-01-14 01:33:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-14 01:33:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 269 transitions. [2019-01-14 01:33:13,282 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 269 transitions. Word has length 119 [2019-01-14 01:33:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:13,283 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 269 transitions. [2019-01-14 01:33:13,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 01:33:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 269 transitions. [2019-01-14 01:33:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-14 01:33:13,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:13,285 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 9, 9, 9, 9, 9, 9, 1, 1] [2019-01-14 01:33:13,286 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:13,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:13,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1303859290, now seen corresponding path program 14 times [2019-01-14 01:33:13,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:13,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:13,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:13,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:13,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:14,263 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 01:33:14,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:14,263 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 01:33:14,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:33:14,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:33:14,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:14,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:14,352 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 01:33:14,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-01-14 01:33:14,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 01:33:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 01:33:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 01:33:14,381 INFO L87 Difference]: Start difference. First operand 250 states and 269 transitions. Second operand 38 states. [2019-01-14 01:33:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:15,372 INFO L93 Difference]: Finished difference Result 267 states and 288 transitions. [2019-01-14 01:33:15,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 01:33:15,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 126 [2019-01-14 01:33:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:15,376 INFO L225 Difference]: With dead ends: 267 [2019-01-14 01:33:15,376 INFO L226 Difference]: Without dead ends: 266 [2019-01-14 01:33:15,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=910, Invalid=2170, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 01:33:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-14 01:33:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-01-14 01:33:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-14 01:33:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 284 transitions. [2019-01-14 01:33:15,386 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 284 transitions. Word has length 126 [2019-01-14 01:33:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:15,386 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 284 transitions. [2019-01-14 01:33:15,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 01:33:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 284 transitions. [2019-01-14 01:33:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-14 01:33:15,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:15,390 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 10, 10, 10, 9, 9, 9, 1, 1] [2019-01-14 01:33:15,391 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:15,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1854113506, now seen corresponding path program 15 times [2019-01-14 01:33:15,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:15,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:15,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:15,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:15,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:16,055 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 01:33:16,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:16,056 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 01:33:16,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:33:16,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-14 01:33:16,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:16,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:16,160 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 01:33:16,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:16,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-01-14 01:33:16,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 01:33:16,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 01:33:16,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 01:33:16,192 INFO L87 Difference]: Start difference. First operand 264 states and 284 transitions. Second operand 40 states. [2019-01-14 01:33:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:16,681 INFO L93 Difference]: Finished difference Result 281 states and 303 transitions. [2019-01-14 01:33:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 01:33:16,684 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 133 [2019-01-14 01:33:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:16,686 INFO L225 Difference]: With dead ends: 281 [2019-01-14 01:33:16,686 INFO L226 Difference]: Without dead ends: 280 [2019-01-14 01:33:16,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1008, Invalid=2414, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 01:33:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-14 01:33:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2019-01-14 01:33:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-01-14 01:33:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 299 transitions. [2019-01-14 01:33:16,699 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 299 transitions. Word has length 133 [2019-01-14 01:33:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:16,699 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 299 transitions. [2019-01-14 01:33:16,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 01:33:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 299 transitions. [2019-01-14 01:33:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-14 01:33:16,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:16,701 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 10, 10, 10, 10, 10, 10, 1, 1] [2019-01-14 01:33:16,701 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:16,705 INFO L82 PathProgramCache]: Analyzing trace with hash -769132960, now seen corresponding path program 16 times [2019-01-14 01:33:16,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:16,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:16,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:16,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:16,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:17,826 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 01:33:17,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:17,826 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 01:33:17,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:33:17,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:33:17,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:17,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:17,932 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 01:33:17,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:17,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-14 01:33:17,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 01:33:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 01:33:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 01:33:17,952 INFO L87 Difference]: Start difference. First operand 278 states and 299 transitions. Second operand 42 states. [2019-01-14 01:33:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:18,629 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2019-01-14 01:33:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-14 01:33:18,630 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 140 [2019-01-14 01:33:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:18,633 INFO L225 Difference]: With dead ends: 295 [2019-01-14 01:33:18,633 INFO L226 Difference]: Without dead ends: 294 [2019-01-14 01:33:18,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1111, Invalid=2671, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 01:33:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-14 01:33:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-01-14 01:33:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-14 01:33:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 314 transitions. [2019-01-14 01:33:18,645 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 314 transitions. Word has length 140 [2019-01-14 01:33:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:18,645 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 314 transitions. [2019-01-14 01:33:18,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 01:33:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 314 transitions. [2019-01-14 01:33:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-14 01:33:18,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:18,648 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 11, 11, 11, 10, 10, 10, 1, 1] [2019-01-14 01:33:18,650 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:18,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1851516184, now seen corresponding path program 17 times [2019-01-14 01:33:18,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:18,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:18,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:18,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:18,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:19,831 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 01:33:19,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:19,831 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 01:33:19,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:33:19,925 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-01-14 01:33:19,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:19,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:19,957 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 01:33:19,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:19,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-01-14 01:33:19,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 01:33:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 01:33:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:33:19,977 INFO L87 Difference]: Start difference. First operand 292 states and 314 transitions. Second operand 44 states. [2019-01-14 01:33:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:21,144 INFO L93 Difference]: Finished difference Result 309 states and 333 transitions. [2019-01-14 01:33:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 01:33:21,145 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 147 [2019-01-14 01:33:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:21,148 INFO L225 Difference]: With dead ends: 309 [2019-01-14 01:33:21,148 INFO L226 Difference]: Without dead ends: 308 [2019-01-14 01:33:21,150 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 01:33:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-01-14 01:33:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2019-01-14 01:33:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-14 01:33:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 329 transitions. [2019-01-14 01:33:21,159 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 329 transitions. Word has length 147 [2019-01-14 01:33:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:21,160 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 329 transitions. [2019-01-14 01:33:21,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 01:33:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 329 transitions. [2019-01-14 01:33:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-14 01:33:21,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:21,163 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 11, 11, 11, 11, 11, 11, 1, 1] [2019-01-14 01:33:21,163 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2009075814, now seen corresponding path program 18 times [2019-01-14 01:33:21,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:21,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:21,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:23,001 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 01:33:23,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:23,002 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 01:33:23,013 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:33:23,116 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-14 01:33:23,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:23,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:23,152 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 01:33:23,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:23,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-01-14 01:33:23,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 01:33:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 01:33:23,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 01:33:23,173 INFO L87 Difference]: Start difference. First operand 306 states and 329 transitions. Second operand 46 states. [2019-01-14 01:33:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:23,724 INFO L93 Difference]: Finished difference Result 323 states and 348 transitions. [2019-01-14 01:33:23,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-14 01:33:23,725 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 154 [2019-01-14 01:33:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:23,727 INFO L225 Difference]: With dead ends: 323 [2019-01-14 01:33:23,728 INFO L226 Difference]: Without dead ends: 322 [2019-01-14 01:33:23,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1332, Invalid=3224, Unknown=0, NotChecked=0, Total=4556 [2019-01-14 01:33:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-14 01:33:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2019-01-14 01:33:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-14 01:33:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 344 transitions. [2019-01-14 01:33:23,738 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 344 transitions. Word has length 154 [2019-01-14 01:33:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:23,739 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 344 transitions. [2019-01-14 01:33:23,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 01:33:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 344 transitions. [2019-01-14 01:33:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-14 01:33:23,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:23,743 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 12, 12, 12, 11, 11, 11, 1, 1] [2019-01-14 01:33:23,743 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:23,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:23,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1319752594, now seen corresponding path program 19 times [2019-01-14 01:33:23,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:23,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:23,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:23,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:23,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:25,179 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 01:33:25,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:25,179 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 01:33:25,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:25,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:25,270 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 01:33:25,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:25,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-14 01:33:25,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 01:33:25,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 01:33:25,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 01:33:25,290 INFO L87 Difference]: Start difference. First operand 320 states and 344 transitions. Second operand 48 states. [2019-01-14 01:33:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:25,888 INFO L93 Difference]: Finished difference Result 337 states and 363 transitions. [2019-01-14 01:33:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-14 01:33:25,890 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 161 [2019-01-14 01:33:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:25,893 INFO L225 Difference]: With dead ends: 337 [2019-01-14 01:33:25,893 INFO L226 Difference]: Without dead ends: 336 [2019-01-14 01:33:25,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1450, Invalid=3520, Unknown=0, NotChecked=0, Total=4970 [2019-01-14 01:33:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-14 01:33:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-14 01:33:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-14 01:33:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 359 transitions. [2019-01-14 01:33:25,903 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 359 transitions. Word has length 161 [2019-01-14 01:33:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:25,904 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 359 transitions. [2019-01-14 01:33:25,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 01:33:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 359 transitions. [2019-01-14 01:33:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-14 01:33:25,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:25,905 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 12, 12, 12, 12, 12, 12, 1, 1] [2019-01-14 01:33:25,905 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:25,909 INFO L82 PathProgramCache]: Analyzing trace with hash 270941012, now seen corresponding path program 20 times [2019-01-14 01:33:25,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:25,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:25,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:25,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:25,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:26,793 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 01:33:26,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:26,793 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 01:33:26,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:33:26,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:33:26,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:26,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:26,886 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 01:33:26,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:26,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-01-14 01:33:26,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 01:33:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 01:33:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 01:33:26,905 INFO L87 Difference]: Start difference. First operand 334 states and 359 transitions. Second operand 50 states. [2019-01-14 01:33:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:27,583 INFO L93 Difference]: Finished difference Result 351 states and 378 transitions. [2019-01-14 01:33:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-14 01:33:27,585 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 168 [2019-01-14 01:33:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:27,587 INFO L225 Difference]: With dead ends: 351 [2019-01-14 01:33:27,587 INFO L226 Difference]: Without dead ends: 350 [2019-01-14 01:33:27,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1573, Invalid=3829, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 01:33:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-14 01:33:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-01-14 01:33:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-14 01:33:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 374 transitions. [2019-01-14 01:33:27,598 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 374 transitions. Word has length 168 [2019-01-14 01:33:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:27,599 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 374 transitions. [2019-01-14 01:33:27,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 01:33:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 374 transitions. [2019-01-14 01:33:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-14 01:33:27,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:27,603 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 13, 13, 13, 12, 12, 12, 1, 1] [2019-01-14 01:33:27,603 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash 208673652, now seen corresponding path program 21 times [2019-01-14 01:33:27,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:27,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:27,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:27,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:27,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:29,121 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 01:33:29,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:29,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 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 01:33:29,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:33:29,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-14 01:33:29,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:29,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:29,276 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 01:33:29,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:29,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-01-14 01:33:29,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 01:33:29,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 01:33:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 01:33:29,297 INFO L87 Difference]: Start difference. First operand 348 states and 374 transitions. Second operand 52 states. [2019-01-14 01:33:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:30,098 INFO L93 Difference]: Finished difference Result 365 states and 393 transitions. [2019-01-14 01:33:30,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-14 01:33:30,099 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 175 [2019-01-14 01:33:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:30,101 INFO L225 Difference]: With dead ends: 365 [2019-01-14 01:33:30,101 INFO L226 Difference]: Without dead ends: 364 [2019-01-14 01:33:30,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1701, Invalid=4151, Unknown=0, NotChecked=0, Total=5852 [2019-01-14 01:33:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-14 01:33:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2019-01-14 01:33:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-01-14 01:33:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 389 transitions. [2019-01-14 01:33:30,109 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 389 transitions. Word has length 175 [2019-01-14 01:33:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:30,110 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 389 transitions. [2019-01-14 01:33:30,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 01:33:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 389 transitions. [2019-01-14 01:33:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-14 01:33:30,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:30,111 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 13, 13, 13, 13, 13, 13, 1, 1] [2019-01-14 01:33:30,111 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:30,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1595439502, now seen corresponding path program 22 times [2019-01-14 01:33:30,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:30,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:30,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:31,147 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 01:33:31,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:31,148 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 01:33:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:33:31,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:33:31,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:31,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:31,279 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 01:33:31,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:31,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-14 01:33:31,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 01:33:31,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 01:33:31,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 01:33:31,319 INFO L87 Difference]: Start difference. First operand 362 states and 389 transitions. Second operand 54 states. [2019-01-14 01:33:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:32,045 INFO L93 Difference]: Finished difference Result 379 states and 408 transitions. [2019-01-14 01:33:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-14 01:33:32,047 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 182 [2019-01-14 01:33:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:32,049 INFO L225 Difference]: With dead ends: 379 [2019-01-14 01:33:32,050 INFO L226 Difference]: Without dead ends: 378 [2019-01-14 01:33:32,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1834, Invalid=4486, Unknown=0, NotChecked=0, Total=6320 [2019-01-14 01:33:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-01-14 01:33:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2019-01-14 01:33:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-14 01:33:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 404 transitions. [2019-01-14 01:33:32,062 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 404 transitions. Word has length 182 [2019-01-14 01:33:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:32,063 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 404 transitions. [2019-01-14 01:33:32,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 01:33:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 404 transitions. [2019-01-14 01:33:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-14 01:33:32,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:32,067 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 14, 14, 14, 13, 13, 13, 1, 1] [2019-01-14 01:33:32,069 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2065713146, now seen corresponding path program 23 times [2019-01-14 01:33:32,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:32,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:32,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:32,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:32,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:33,110 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 01:33:33,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:33,111 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 01:33:33,121 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:33:33,252 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-14 01:33:33,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:33,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:33,301 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 01:33:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-01-14 01:33:33,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-14 01:33:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-14 01:33:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-01-14 01:33:33,333 INFO L87 Difference]: Start difference. First operand 376 states and 404 transitions. Second operand 56 states. [2019-01-14 01:33:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:34,207 INFO L93 Difference]: Finished difference Result 393 states and 423 transitions. [2019-01-14 01:33:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-14 01:33:34,208 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 189 [2019-01-14 01:33:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:34,211 INFO L225 Difference]: With dead ends: 393 [2019-01-14 01:33:34,212 INFO L226 Difference]: Without dead ends: 392 [2019-01-14 01:33:34,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1972, Invalid=4834, Unknown=0, NotChecked=0, Total=6806 [2019-01-14 01:33:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-01-14 01:33:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2019-01-14 01:33:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-01-14 01:33:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 419 transitions. [2019-01-14 01:33:34,225 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 419 transitions. Word has length 189 [2019-01-14 01:33:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:34,225 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 419 transitions. [2019-01-14 01:33:34,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-14 01:33:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 419 transitions. [2019-01-14 01:33:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-14 01:33:34,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:34,230 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 14, 14, 14, 14, 14, 14, 1, 1] [2019-01-14 01:33:34,230 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash 503073352, now seen corresponding path program 24 times [2019-01-14 01:33:34,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:34,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:34,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:34,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:34,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:35,982 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 01:33:35,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:35,982 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 01:33:35,993 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:33:36,174 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-01-14 01:33:36,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:36,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:36,239 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 01:33:36,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:36,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-01-14 01:33:36,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 01:33:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 01:33:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 01:33:36,267 INFO L87 Difference]: Start difference. First operand 390 states and 419 transitions. Second operand 58 states. [2019-01-14 01:33:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:37,127 INFO L93 Difference]: Finished difference Result 407 states and 438 transitions. [2019-01-14 01:33:37,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-14 01:33:37,128 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 196 [2019-01-14 01:33:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:37,133 INFO L225 Difference]: With dead ends: 407 [2019-01-14 01:33:37,133 INFO L226 Difference]: Without dead ends: 406 [2019-01-14 01:33:37,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2115, Invalid=5195, Unknown=0, NotChecked=0, Total=7310 [2019-01-14 01:33:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-14 01:33:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2019-01-14 01:33:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-01-14 01:33:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 434 transitions. [2019-01-14 01:33:37,145 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 434 transitions. Word has length 196 [2019-01-14 01:33:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:37,148 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 434 transitions. [2019-01-14 01:33:37,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 01:33:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 434 transitions. [2019-01-14 01:33:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-01-14 01:33:37,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:37,150 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 15, 15, 15, 14, 14, 14, 1, 1] [2019-01-14 01:33:37,153 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash 887951872, now seen corresponding path program 25 times [2019-01-14 01:33:37,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:37,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:37,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:37,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:37,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:38,271 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 01:33:38,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:38,271 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 01:33:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:38,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:38,395 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 01:33:38,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:38,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-01-14 01:33:38,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 01:33:38,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 01:33:38,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 01:33:38,416 INFO L87 Difference]: Start difference. First operand 404 states and 434 transitions. Second operand 60 states. [2019-01-14 01:33:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:39,306 INFO L93 Difference]: Finished difference Result 421 states and 453 transitions. [2019-01-14 01:33:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-14 01:33:39,307 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 203 [2019-01-14 01:33:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:39,310 INFO L225 Difference]: With dead ends: 421 [2019-01-14 01:33:39,311 INFO L226 Difference]: Without dead ends: 420 [2019-01-14 01:33:39,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2263, Invalid=5569, Unknown=0, NotChecked=0, Total=7832 [2019-01-14 01:33:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-01-14 01:33:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2019-01-14 01:33:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-01-14 01:33:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 449 transitions. [2019-01-14 01:33:39,323 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 449 transitions. Word has length 203 [2019-01-14 01:33:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:39,324 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 449 transitions. [2019-01-14 01:33:39,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 01:33:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 449 transitions. [2019-01-14 01:33:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-14 01:33:39,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:39,328 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 15, 15, 15, 15, 15, 15, 1, 1] [2019-01-14 01:33:39,329 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash 593448322, now seen corresponding path program 26 times [2019-01-14 01:33:39,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:39,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:39,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:39,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:39,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:40,972 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 01:33:40,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:40,972 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 01:33:40,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:33:41,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:33:41,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:41,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:41,119 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 01:33:41,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:41,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-01-14 01:33:41,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-14 01:33:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-14 01:33:41,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 01:33:41,142 INFO L87 Difference]: Start difference. First operand 418 states and 449 transitions. Second operand 62 states. [2019-01-14 01:33:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:42,060 INFO L93 Difference]: Finished difference Result 435 states and 468 transitions. [2019-01-14 01:33:42,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-14 01:33:42,062 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 210 [2019-01-14 01:33:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:42,065 INFO L225 Difference]: With dead ends: 435 [2019-01-14 01:33:42,065 INFO L226 Difference]: Without dead ends: 434 [2019-01-14 01:33:42,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2416, Invalid=5956, Unknown=0, NotChecked=0, Total=8372 [2019-01-14 01:33:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-14 01:33:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2019-01-14 01:33:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-01-14 01:33:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 464 transitions. [2019-01-14 01:33:42,076 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 464 transitions. Word has length 210 [2019-01-14 01:33:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:42,079 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 464 transitions. [2019-01-14 01:33:42,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 01:33:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 464 transitions. [2019-01-14 01:33:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-14 01:33:42,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:42,082 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 16, 16, 16, 15, 15, 15, 1, 1] [2019-01-14 01:33:42,083 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:42,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash 380950918, now seen corresponding path program 27 times [2019-01-14 01:33:42,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:42,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:42,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:43,402 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 01:33:43,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:43,402 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 01:33:43,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:33:43,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-14 01:33:43,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:43,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:43,608 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 01:33:43,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:43,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-01-14 01:33:43,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-14 01:33:43,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-14 01:33:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 01:33:43,640 INFO L87 Difference]: Start difference. First operand 432 states and 464 transitions. Second operand 64 states. [2019-01-14 01:33:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:45,488 INFO L93 Difference]: Finished difference Result 449 states and 483 transitions. [2019-01-14 01:33:45,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-14 01:33:45,489 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 217 [2019-01-14 01:33:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:45,491 INFO L225 Difference]: With dead ends: 449 [2019-01-14 01:33:45,492 INFO L226 Difference]: Without dead ends: 448 [2019-01-14 01:33:45,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2574, Invalid=6356, Unknown=0, NotChecked=0, Total=8930 [2019-01-14 01:33:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-01-14 01:33:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2019-01-14 01:33:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-14 01:33:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 479 transitions. [2019-01-14 01:33:45,506 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 479 transitions. Word has length 217 [2019-01-14 01:33:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:45,506 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 479 transitions. [2019-01-14 01:33:45,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-14 01:33:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 479 transitions. [2019-01-14 01:33:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-01-14 01:33:45,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:45,511 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 16, 16, 16, 16, 16, 16, 1, 1] [2019-01-14 01:33:45,512 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1836524348, now seen corresponding path program 28 times [2019-01-14 01:33:45,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:45,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:45,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:45,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:45,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:47,308 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 01:33:47,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:47,308 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 01:33:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:33:47,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:33:47,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:47,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:47,454 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 01:33:47,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:47,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-01-14 01:33:47,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-14 01:33:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-14 01:33:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2019-01-14 01:33:47,487 INFO L87 Difference]: Start difference. First operand 446 states and 479 transitions. Second operand 66 states. [2019-01-14 01:33:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:48,716 INFO L93 Difference]: Finished difference Result 463 states and 498 transitions. [2019-01-14 01:33:48,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-14 01:33:48,718 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 224 [2019-01-14 01:33:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:48,721 INFO L225 Difference]: With dead ends: 463 [2019-01-14 01:33:48,721 INFO L226 Difference]: Without dead ends: 462 [2019-01-14 01:33:48,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2737, Invalid=6769, Unknown=0, NotChecked=0, Total=9506 [2019-01-14 01:33:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-01-14 01:33:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2019-01-14 01:33:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-01-14 01:33:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 494 transitions. [2019-01-14 01:33:48,732 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 494 transitions. Word has length 224 [2019-01-14 01:33:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:48,733 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 494 transitions. [2019-01-14 01:33:48,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-14 01:33:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 494 transitions. [2019-01-14 01:33:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-14 01:33:48,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:48,737 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 17, 17, 17, 16, 16, 16, 1, 1] [2019-01-14 01:33:48,737 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1756233356, now seen corresponding path program 29 times [2019-01-14 01:33:48,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:48,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:48,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:50,366 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 01:33:50,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:50,366 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 01:33:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:33:50,604 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-01-14 01:33:50,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:50,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:50,677 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 01:33:50,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:50,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-01-14 01:33:50,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-14 01:33:50,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-14 01:33:50,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2019-01-14 01:33:50,721 INFO L87 Difference]: Start difference. First operand 460 states and 494 transitions. Second operand 68 states. [2019-01-14 01:33:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:51,879 INFO L93 Difference]: Finished difference Result 477 states and 513 transitions. [2019-01-14 01:33:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-14 01:33:51,881 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 231 [2019-01-14 01:33:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:51,883 INFO L225 Difference]: With dead ends: 477 [2019-01-14 01:33:51,884 INFO L226 Difference]: Without dead ends: 476 [2019-01-14 01:33:51,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2905, Invalid=7195, Unknown=0, NotChecked=0, Total=10100 [2019-01-14 01:33:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-01-14 01:33:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2019-01-14 01:33:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-01-14 01:33:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 509 transitions. [2019-01-14 01:33:51,896 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 509 transitions. Word has length 231 [2019-01-14 01:33:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:51,899 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 509 transitions. [2019-01-14 01:33:51,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-14 01:33:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 509 transitions. [2019-01-14 01:33:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-01-14 01:33:51,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:51,902 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 17, 17, 17, 17, 17, 17, 1, 1] [2019-01-14 01:33:51,904 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1675531402, now seen corresponding path program 30 times [2019-01-14 01:33:51,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:51,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:51,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:53,532 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 01:33:53,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:53,532 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 01:33:53,542 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:33:53,710 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-01-14 01:33:53,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:53,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:53,761 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 01:33:53,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:53,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-01-14 01:33:53,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-14 01:33:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-14 01:33:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-01-14 01:33:53,781 INFO L87 Difference]: Start difference. First operand 474 states and 509 transitions. Second operand 70 states. [2019-01-14 01:33:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:54,899 INFO L93 Difference]: Finished difference Result 491 states and 528 transitions. [2019-01-14 01:33:54,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-14 01:33:54,900 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 238 [2019-01-14 01:33:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:54,903 INFO L225 Difference]: With dead ends: 491 [2019-01-14 01:33:54,903 INFO L226 Difference]: Without dead ends: 490 [2019-01-14 01:33:54,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3078, Invalid=7634, Unknown=0, NotChecked=0, Total=10712 [2019-01-14 01:33:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-01-14 01:33:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2019-01-14 01:33:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-01-14 01:33:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 524 transitions. [2019-01-14 01:33:54,917 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 524 transitions. Word has length 238 [2019-01-14 01:33:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:54,917 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 524 transitions. [2019-01-14 01:33:54,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-14 01:33:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 524 transitions. [2019-01-14 01:33:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-14 01:33:54,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:54,923 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 18, 18, 18, 17, 17, 17, 1, 1] [2019-01-14 01:33:54,923 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash 610722066, now seen corresponding path program 31 times [2019-01-14 01:33:54,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:54,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:54,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:54,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:54,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:56,909 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 01:33:56,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:56,909 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 01:33:56,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:56,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:57,064 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 01:33:57,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:57,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-01-14 01:33:57,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-14 01:33:57,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-14 01:33:57,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-01-14 01:33:57,100 INFO L87 Difference]: Start difference. First operand 488 states and 524 transitions. Second operand 72 states. [2019-01-14 01:33:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:58,451 INFO L93 Difference]: Finished difference Result 505 states and 543 transitions. [2019-01-14 01:33:58,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-14 01:33:58,453 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 245 [2019-01-14 01:33:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:58,456 INFO L225 Difference]: With dead ends: 505 [2019-01-14 01:33:58,456 INFO L226 Difference]: Without dead ends: 504 [2019-01-14 01:33:58,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3256, Invalid=8086, Unknown=0, NotChecked=0, Total=11342 [2019-01-14 01:33:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-01-14 01:33:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2019-01-14 01:33:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-01-14 01:33:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 539 transitions. [2019-01-14 01:33:58,467 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 539 transitions. Word has length 245 [2019-01-14 01:33:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:58,467 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 539 transitions. [2019-01-14 01:33:58,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-14 01:33:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 539 transitions. [2019-01-14 01:33:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-14 01:33:58,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:58,469 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 18, 18, 18, 18, 18, 18, 1, 1] [2019-01-14 01:33:58,470 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash -354171344, now seen corresponding path program 32 times [2019-01-14 01:33:58,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:58,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:58,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:00,385 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 01:34:00,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:00,386 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 01:34:00,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:34:00,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:34:00,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:00,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:00,559 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 01:34:00,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:00,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-01-14 01:34:00,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-14 01:34:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-14 01:34:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 01:34:00,600 INFO L87 Difference]: Start difference. First operand 502 states and 539 transitions. Second operand 74 states. [2019-01-14 01:34:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:02,247 INFO L93 Difference]: Finished difference Result 519 states and 558 transitions. [2019-01-14 01:34:02,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-14 01:34:02,249 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 252 [2019-01-14 01:34:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:02,252 INFO L225 Difference]: With dead ends: 519 [2019-01-14 01:34:02,252 INFO L226 Difference]: Without dead ends: 518 [2019-01-14 01:34:02,253 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 01:34:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-01-14 01:34:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2019-01-14 01:34:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-14 01:34:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 554 transitions. [2019-01-14 01:34:02,267 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 554 transitions. Word has length 252 [2019-01-14 01:34:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:02,267 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 554 transitions. [2019-01-14 01:34:02,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-14 01:34:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 554 transitions. [2019-01-14 01:34:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-01-14 01:34:02,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:02,273 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 19, 19, 19, 18, 18, 18, 1, 1] [2019-01-14 01:34:02,273 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:02,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:02,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1161436904, now seen corresponding path program 33 times [2019-01-14 01:34:02,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:02,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:02,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:04,228 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 01:34:04,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:04,229 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 01:34:04,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:34:04,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-14 01:34:04,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:04,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:04,550 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 01:34:04,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:04,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-01-14 01:34:04,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-14 01:34:04,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-14 01:34:04,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-01-14 01:34:04,589 INFO L87 Difference]: Start difference. First operand 516 states and 554 transitions. Second operand 76 states. [2019-01-14 01:34:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:06,901 INFO L93 Difference]: Finished difference Result 533 states and 573 transitions. [2019-01-14 01:34:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-14 01:34:06,903 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 259 [2019-01-14 01:34:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:06,906 INFO L225 Difference]: With dead ends: 533 [2019-01-14 01:34:06,906 INFO L226 Difference]: Without dead ends: 532 [2019-01-14 01:34:06,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3627, Invalid=9029, Unknown=0, NotChecked=0, Total=12656 [2019-01-14 01:34:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-01-14 01:34:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 530. [2019-01-14 01:34:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-01-14 01:34:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 569 transitions. [2019-01-14 01:34:06,916 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 569 transitions. Word has length 259 [2019-01-14 01:34:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:06,916 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 569 transitions. [2019-01-14 01:34:06,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-14 01:34:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 569 transitions. [2019-01-14 01:34:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-14 01:34:06,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:06,921 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 19, 19, 19, 19, 19, 19, 1, 1] [2019-01-14 01:34:06,921 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:06,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1427385494, now seen corresponding path program 34 times [2019-01-14 01:34:06,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:06,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:06,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:06,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:06,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:09,412 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 01:34:09,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:09,412 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 01:34:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:34:09,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:34:09,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:09,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:09,577 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 01:34:09,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:09,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-01-14 01:34:09,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-14 01:34:09,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-14 01:34:09,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2019-01-14 01:34:09,607 INFO L87 Difference]: Start difference. First operand 530 states and 569 transitions. Second operand 78 states. [2019-01-14 01:34:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:11,290 INFO L93 Difference]: Finished difference Result 547 states and 588 transitions. [2019-01-14 01:34:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-14 01:34:11,292 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 266 [2019-01-14 01:34:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:11,295 INFO L225 Difference]: With dead ends: 547 [2019-01-14 01:34:11,295 INFO L226 Difference]: Without dead ends: 546 [2019-01-14 01:34:11,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3820, Invalid=9520, Unknown=0, NotChecked=0, Total=13340 [2019-01-14 01:34:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-01-14 01:34:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-01-14 01:34:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-01-14 01:34:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 584 transitions. [2019-01-14 01:34:11,309 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 584 transitions. Word has length 266 [2019-01-14 01:34:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:11,309 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 584 transitions. [2019-01-14 01:34:11,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-14 01:34:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 584 transitions. [2019-01-14 01:34:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-01-14 01:34:11,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:11,314 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 20, 20, 20, 19, 19, 19, 1, 1] [2019-01-14 01:34:11,314 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:11,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1510563486, now seen corresponding path program 35 times [2019-01-14 01:34:11,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:11,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:11,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:11,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:11,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:13,226 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 01:34:13,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:13,227 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 01:34:13,237 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:34:13,572 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-01-14 01:34:13,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:13,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:13,663 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 01:34:13,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:13,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-01-14 01:34:13,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-14 01:34:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-14 01:34:13,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-01-14 01:34:13,700 INFO L87 Difference]: Start difference. First operand 544 states and 584 transitions. Second operand 80 states. [2019-01-14 01:34:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:15,209 INFO L93 Difference]: Finished difference Result 561 states and 603 transitions. [2019-01-14 01:34:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-14 01:34:15,211 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 273 [2019-01-14 01:34:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:15,214 INFO L225 Difference]: With dead ends: 561 [2019-01-14 01:34:15,214 INFO L226 Difference]: Without dead ends: 560 [2019-01-14 01:34:15,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4018, Invalid=10024, Unknown=0, NotChecked=0, Total=14042 [2019-01-14 01:34:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-01-14 01:34:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2019-01-14 01:34:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-01-14 01:34:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 599 transitions. [2019-01-14 01:34:15,230 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 599 transitions. Word has length 273 [2019-01-14 01:34:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:15,230 INFO L480 AbstractCegarLoop]: Abstraction has 558 states and 599 transitions. [2019-01-14 01:34:15,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-14 01:34:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 599 transitions. [2019-01-14 01:34:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-14 01:34:15,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:15,236 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 20, 20, 20, 20, 20, 20, 1, 1] [2019-01-14 01:34:15,236 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:15,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1024406308, now seen corresponding path program 36 times [2019-01-14 01:34:15,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:15,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:15,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:15,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:15,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:17,422 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 01:34:17,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:17,422 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 01:34:17,431 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:34:17,622 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-01-14 01:34:17,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:17,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:17,714 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 01:34:17,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:17,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-01-14 01:34:17,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-14 01:34:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-14 01:34:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-01-14 01:34:17,748 INFO L87 Difference]: Start difference. First operand 558 states and 599 transitions. Second operand 82 states. [2019-01-14 01:34:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:19,474 INFO L93 Difference]: Finished difference Result 575 states and 618 transitions. [2019-01-14 01:34:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-14 01:34:19,475 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 280 [2019-01-14 01:34:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:19,477 INFO L225 Difference]: With dead ends: 575 [2019-01-14 01:34:19,478 INFO L226 Difference]: Without dead ends: 574 [2019-01-14 01:34:19,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4221, Invalid=10541, Unknown=0, NotChecked=0, Total=14762 [2019-01-14 01:34:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-01-14 01:34:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2019-01-14 01:34:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-01-14 01:34:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 614 transitions. [2019-01-14 01:34:19,494 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 614 transitions. Word has length 280 [2019-01-14 01:34:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:19,494 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 614 transitions. [2019-01-14 01:34:19,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-14 01:34:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 614 transitions. [2019-01-14 01:34:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-01-14 01:34:19,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:19,500 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 21, 21, 21, 20, 20, 20, 1, 1] [2019-01-14 01:34:19,500 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1278756444, now seen corresponding path program 37 times [2019-01-14 01:34:19,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:19,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:19,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:19,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:22,036 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 01:34:22,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:22,036 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 01:34:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:34:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:22,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:22,190 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 01:34:22,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:22,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-01-14 01:34:22,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-14 01:34:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-14 01:34:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2019-01-14 01:34:22,212 INFO L87 Difference]: Start difference. First operand 572 states and 614 transitions. Second operand 84 states. [2019-01-14 01:34:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:23,839 INFO L93 Difference]: Finished difference Result 589 states and 633 transitions. [2019-01-14 01:34:23,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-14 01:34:23,840 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 287 [2019-01-14 01:34:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:23,844 INFO L225 Difference]: With dead ends: 589 [2019-01-14 01:34:23,844 INFO L226 Difference]: Without dead ends: 588 [2019-01-14 01:34:23,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4429, Invalid=11071, Unknown=0, NotChecked=0, Total=15500 [2019-01-14 01:34:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-01-14 01:34:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 586. [2019-01-14 01:34:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-01-14 01:34:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 629 transitions. [2019-01-14 01:34:23,854 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 629 transitions. Word has length 287 [2019-01-14 01:34:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:23,854 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 629 transitions. [2019-01-14 01:34:23,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-14 01:34:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 629 transitions. [2019-01-14 01:34:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-01-14 01:34:23,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:23,857 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 21, 21, 21, 21, 21, 21, 1, 1] [2019-01-14 01:34:23,857 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:23,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:23,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1949596322, now seen corresponding path program 38 times [2019-01-14 01:34:23,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:23,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:23,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:23,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:34:23,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:26,230 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 01:34:26,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:26,230 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 01:34:26,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:34:26,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:34:26,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:26,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:26,426 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 01:34:26,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:26,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-01-14 01:34:26,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-14 01:34:26,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-14 01:34:26,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2019-01-14 01:34:26,448 INFO L87 Difference]: Start difference. First operand 586 states and 629 transitions. Second operand 86 states. [2019-01-14 01:34:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:28,107 INFO L93 Difference]: Finished difference Result 603 states and 648 transitions. [2019-01-14 01:34:28,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-14 01:34:28,108 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 294 [2019-01-14 01:34:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:28,112 INFO L225 Difference]: With dead ends: 603 [2019-01-14 01:34:28,112 INFO L226 Difference]: Without dead ends: 602 [2019-01-14 01:34:28,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4642, Invalid=11614, Unknown=0, NotChecked=0, Total=16256 [2019-01-14 01:34:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-01-14 01:34:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-01-14 01:34:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-01-14 01:34:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 644 transitions. [2019-01-14 01:34:28,122 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 644 transitions. Word has length 294 [2019-01-14 01:34:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:28,122 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 644 transitions. [2019-01-14 01:34:28,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-14 01:34:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 644 transitions. [2019-01-14 01:34:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-14 01:34:28,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:28,125 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 22, 22, 22, 21, 21, 21, 1, 1] [2019-01-14 01:34:28,125 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:28,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1122980394, now seen corresponding path program 39 times [2019-01-14 01:34:28,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:28,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:28,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:28,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:28,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:30,452 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 01:34:30,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:30,452 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 01:34:30,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:34:30,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-14 01:34:30,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:30,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:30,862 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 01:34:30,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:30,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-01-14 01:34:30,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-14 01:34:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-14 01:34:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2019-01-14 01:34:30,882 INFO L87 Difference]: Start difference. First operand 600 states and 644 transitions. Second operand 88 states. [2019-01-14 01:34:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:32,852 INFO L93 Difference]: Finished difference Result 617 states and 663 transitions. [2019-01-14 01:34:32,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-14 01:34:32,853 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 301 [2019-01-14 01:34:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:32,857 INFO L225 Difference]: With dead ends: 617 [2019-01-14 01:34:32,857 INFO L226 Difference]: Without dead ends: 616 [2019-01-14 01:34:32,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4860, Invalid=12170, Unknown=0, NotChecked=0, Total=17030 [2019-01-14 01:34:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-01-14 01:34:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-01-14 01:34:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-01-14 01:34:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 659 transitions. [2019-01-14 01:34:32,870 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 659 transitions. Word has length 301 [2019-01-14 01:34:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:32,870 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 659 transitions. [2019-01-14 01:34:32,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-14 01:34:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 659 transitions. [2019-01-14 01:34:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-14 01:34:32,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:32,877 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 22, 22, 22, 22, 22, 22, 1, 1] [2019-01-14 01:34:32,877 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash 88500760, now seen corresponding path program 40 times [2019-01-14 01:34:32,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:32,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:32,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:35,127 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 01:34:35,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:35,127 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 01:34:35,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:34:35,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:34:35,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:35,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:35,353 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 01:34:35,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:35,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-01-14 01:34:35,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-14 01:34:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-14 01:34:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2019-01-14 01:34:35,413 INFO L87 Difference]: Start difference. First operand 614 states and 659 transitions. Second operand 90 states. [2019-01-14 01:34:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:37,940 INFO L93 Difference]: Finished difference Result 631 states and 678 transitions. [2019-01-14 01:34:37,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-14 01:34:37,942 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 308 [2019-01-14 01:34:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:37,944 INFO L225 Difference]: With dead ends: 631 [2019-01-14 01:34:37,944 INFO L226 Difference]: Without dead ends: 630 [2019-01-14 01:34:37,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5083, Invalid=12739, Unknown=0, NotChecked=0, Total=17822 [2019-01-14 01:34:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-01-14 01:34:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2019-01-14 01:34:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-01-14 01:34:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 674 transitions. [2019-01-14 01:34:37,955 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 674 transitions. Word has length 308 [2019-01-14 01:34:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:37,956 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 674 transitions. [2019-01-14 01:34:37,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-14 01:34:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 674 transitions. [2019-01-14 01:34:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-14 01:34:37,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:37,958 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 23, 23, 23, 22, 22, 22, 1, 1] [2019-01-14 01:34:37,958 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:37,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 298223664, now seen corresponding path program 41 times [2019-01-14 01:34:37,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:37,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:37,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:40,381 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 01:34:40,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:40,381 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 01:34:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:34:40,666 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-01-14 01:34:40,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:40,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:40,744 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 01:34:40,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:40,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-01-14 01:34:40,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-14 01:34:40,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-14 01:34:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2019-01-14 01:34:40,764 INFO L87 Difference]: Start difference. First operand 628 states and 674 transitions. Second operand 92 states. [2019-01-14 01:34:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:42,747 INFO L93 Difference]: Finished difference Result 645 states and 693 transitions. [2019-01-14 01:34:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-14 01:34:42,749 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 315 [2019-01-14 01:34:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:42,751 INFO L225 Difference]: With dead ends: 645 [2019-01-14 01:34:42,752 INFO L226 Difference]: Without dead ends: 644 [2019-01-14 01:34:42,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5311, Invalid=13321, Unknown=0, NotChecked=0, Total=18632 [2019-01-14 01:34:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-01-14 01:34:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2019-01-14 01:34:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-01-14 01:34:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 689 transitions. [2019-01-14 01:34:42,764 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 689 transitions. Word has length 315 [2019-01-14 01:34:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:42,764 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 689 transitions. [2019-01-14 01:34:42,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-14 01:34:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 689 transitions. [2019-01-14 01:34:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-01-14 01:34:42,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:42,767 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 23, 23, 23, 23, 23, 23, 1, 1] [2019-01-14 01:34:42,767 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash 357400914, now seen corresponding path program 42 times [2019-01-14 01:34:42,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:42,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:42,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:42,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:42,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:45,255 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 01:34:45,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:45,255 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 01:34:45,265 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:34:45,518 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-01-14 01:34:45,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:45,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:45,590 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 01:34:45,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:45,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-01-14 01:34:45,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-14 01:34:45,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-14 01:34:45,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2019-01-14 01:34:45,611 INFO L87 Difference]: Start difference. First operand 642 states and 689 transitions. Second operand 94 states. [2019-01-14 01:34:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:47,804 INFO L93 Difference]: Finished difference Result 659 states and 708 transitions. [2019-01-14 01:34:47,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-14 01:34:47,806 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 322 [2019-01-14 01:34:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:47,808 INFO L225 Difference]: With dead ends: 659 [2019-01-14 01:34:47,808 INFO L226 Difference]: Without dead ends: 658 [2019-01-14 01:34:47,810 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 01:34:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-01-14 01:34:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 656. [2019-01-14 01:34:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-01-14 01:34:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 704 transitions. [2019-01-14 01:34:47,820 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 704 transitions. Word has length 322 [2019-01-14 01:34:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:47,821 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 704 transitions. [2019-01-14 01:34:47,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-14 01:34:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 704 transitions. [2019-01-14 01:34:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-01-14 01:34:47,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:47,823 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 24, 24, 24, 23, 23, 23, 1, 1] [2019-01-14 01:34:47,823 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:47,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1328202, now seen corresponding path program 43 times [2019-01-14 01:34:47,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:47,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:47,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:47,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:47,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:50,427 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 01:34:50,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:50,427 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 01:34:50,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:34:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:50,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:50,624 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 01:34:50,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:50,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-01-14 01:34:50,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-14 01:34:50,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-14 01:34:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2019-01-14 01:34:50,644 INFO L87 Difference]: Start difference. First operand 656 states and 704 transitions. Second operand 96 states. [2019-01-14 01:34:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:52,775 INFO L93 Difference]: Finished difference Result 673 states and 723 transitions. [2019-01-14 01:34:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-14 01:34:52,777 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 329 [2019-01-14 01:34:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:52,781 INFO L225 Difference]: With dead ends: 673 [2019-01-14 01:34:52,781 INFO L226 Difference]: Without dead ends: 672 [2019-01-14 01:34:52,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5782, Invalid=14524, Unknown=0, NotChecked=0, Total=20306 [2019-01-14 01:34:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-01-14 01:34:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2019-01-14 01:34:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-01-14 01:34:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 719 transitions. [2019-01-14 01:34:52,792 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 719 transitions. Word has length 329 [2019-01-14 01:34:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:52,793 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 719 transitions. [2019-01-14 01:34:52,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-14 01:34:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 719 transitions. [2019-01-14 01:34:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-14 01:34:52,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:52,795 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 24, 24, 24, 24, 24, 24, 1, 1] [2019-01-14 01:34:52,795 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:52,796 INFO L82 PathProgramCache]: Analyzing trace with hash 525757196, now seen corresponding path program 44 times [2019-01-14 01:34:52,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:52,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:52,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:52,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:34:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:34:55,454 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 01:34:55,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:34:55,455 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 01:34:55,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:34:55,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:34:55,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:34:55,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:34:55,694 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 01:34:55,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:34:55,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-01-14 01:34:55,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-14 01:34:55,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-14 01:34:55,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2019-01-14 01:34:55,723 INFO L87 Difference]: Start difference. First operand 670 states and 719 transitions. Second operand 98 states. [2019-01-14 01:34:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:34:58,067 INFO L93 Difference]: Finished difference Result 687 states and 738 transitions. [2019-01-14 01:34:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-14 01:34:58,069 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 336 [2019-01-14 01:34:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:34:58,073 INFO L225 Difference]: With dead ends: 687 [2019-01-14 01:34:58,073 INFO L226 Difference]: Without dead ends: 686 [2019-01-14 01:34:58,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6025, Invalid=15145, Unknown=0, NotChecked=0, Total=21170 [2019-01-14 01:34:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-01-14 01:34:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 684. [2019-01-14 01:34:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-01-14 01:34:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 734 transitions. [2019-01-14 01:34:58,085 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 734 transitions. Word has length 336 [2019-01-14 01:34:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:34:58,086 INFO L480 AbstractCegarLoop]: Abstraction has 684 states and 734 transitions. [2019-01-14 01:34:58,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-14 01:34:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 734 transitions. [2019-01-14 01:34:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-01-14 01:34:58,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:34:58,092 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 25, 25, 25, 24, 24, 24, 1, 1] [2019-01-14 01:34:58,092 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:34:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:34:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2007675716, now seen corresponding path program 45 times [2019-01-14 01:34:58,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:34:58,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:34:58,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:58,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:34:58,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:34:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:00,875 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 01:35:00,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:00,875 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 01:35:00,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:35:01,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-14 01:35:01,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:35:01,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:01,317 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 01:35:01,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:01,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-01-14 01:35:01,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-14 01:35:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-14 01:35:01,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2019-01-14 01:35:01,338 INFO L87 Difference]: Start difference. First operand 684 states and 734 transitions. Second operand 100 states. [2019-01-14 01:35:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:03,619 INFO L93 Difference]: Finished difference Result 701 states and 753 transitions. [2019-01-14 01:35:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-14 01:35:03,620 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 343 [2019-01-14 01:35:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:03,624 INFO L225 Difference]: With dead ends: 701 [2019-01-14 01:35:03,624 INFO L226 Difference]: Without dead ends: 700 [2019-01-14 01:35:03,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6273, Invalid=15779, Unknown=0, NotChecked=0, Total=22052 [2019-01-14 01:35:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-01-14 01:35:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2019-01-14 01:35:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-01-14 01:35:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 749 transitions. [2019-01-14 01:35:03,637 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 749 transitions. Word has length 343 [2019-01-14 01:35:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:03,637 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 749 transitions. [2019-01-14 01:35:03,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-14 01:35:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 749 transitions. [2019-01-14 01:35:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-14 01:35:03,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:03,639 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 25, 25, 25, 25, 25, 25, 1, 1] [2019-01-14 01:35:03,640 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash -125909178, now seen corresponding path program 46 times [2019-01-14 01:35:03,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:03,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:35:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:06,585 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 01:35:06,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:06,586 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 01:35:06,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:35:06,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:35:06,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:35:06,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:06,887 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 01:35:06,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:06,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-01-14 01:35:06,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-14 01:35:06,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-14 01:35:06,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2019-01-14 01:35:06,922 INFO L87 Difference]: Start difference. First operand 698 states and 749 transitions. Second operand 102 states. [2019-01-14 01:35:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:09,442 INFO L93 Difference]: Finished difference Result 715 states and 768 transitions. [2019-01-14 01:35:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-14 01:35:09,444 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 350 [2019-01-14 01:35:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:09,447 INFO L225 Difference]: With dead ends: 715 [2019-01-14 01:35:09,447 INFO L226 Difference]: Without dead ends: 714 [2019-01-14 01:35:09,449 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 01:35:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-01-14 01:35:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 712. [2019-01-14 01:35:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-01-14 01:35:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 764 transitions. [2019-01-14 01:35:09,459 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 764 transitions. Word has length 350 [2019-01-14 01:35:09,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:09,459 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 764 transitions. [2019-01-14 01:35:09,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-14 01:35:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 764 transitions. [2019-01-14 01:35:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-01-14 01:35:09,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:09,462 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 26, 26, 26, 25, 25, 25, 1, 1] [2019-01-14 01:35:09,462 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:09,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:09,462 INFO L82 PathProgramCache]: Analyzing trace with hash 122788674, now seen corresponding path program 47 times [2019-01-14 01:35:09,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:09,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:09,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:35:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:12,764 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 01:35:12,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:12,764 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 01:35:12,776 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:35:13,126 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2019-01-14 01:35:13,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:35:13,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:13,221 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 01:35:13,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:13,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-01-14 01:35:13,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-14 01:35:13,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-14 01:35:13,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2019-01-14 01:35:13,242 INFO L87 Difference]: Start difference. First operand 712 states and 764 transitions. Second operand 104 states. [2019-01-14 01:35:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:15,599 INFO L93 Difference]: Finished difference Result 729 states and 783 transitions. [2019-01-14 01:35:15,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-14 01:35:15,601 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 357 [2019-01-14 01:35:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:15,603 INFO L225 Difference]: With dead ends: 729 [2019-01-14 01:35:15,603 INFO L226 Difference]: Without dead ends: 728 [2019-01-14 01:35:15,604 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 01:35:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-01-14 01:35:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-01-14 01:35:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-01-14 01:35:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 779 transitions. [2019-01-14 01:35:15,615 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 779 transitions. Word has length 357 [2019-01-14 01:35:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:15,615 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 779 transitions. [2019-01-14 01:35:15,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-14 01:35:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 779 transitions. [2019-01-14 01:35:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-14 01:35:15,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:15,618 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 26, 26, 26, 26, 26, 26, 1, 1] [2019-01-14 01:35:15,618 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:15,619 INFO L82 PathProgramCache]: Analyzing trace with hash -510904832, now seen corresponding path program 48 times [2019-01-14 01:35:15,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:15,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:15,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:15,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:35:15,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:18,748 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 01:35:18,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:18,749 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 01:35:18,760 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:35:19,114 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2019-01-14 01:35:19,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:35:19,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:19,248 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 01:35:19,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-01-14 01:35:19,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-14 01:35:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-14 01:35:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2019-01-14 01:35:19,269 INFO L87 Difference]: Start difference. First operand 726 states and 779 transitions. Second operand 106 states. [2019-01-14 01:35:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:21,712 INFO L93 Difference]: Finished difference Result 743 states and 798 transitions. [2019-01-14 01:35:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-14 01:35:21,715 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 364 [2019-01-14 01:35:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:21,719 INFO L225 Difference]: With dead ends: 743 [2019-01-14 01:35:21,719 INFO L226 Difference]: Without dead ends: 742 [2019-01-14 01:35:21,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7047, Invalid=17759, Unknown=0, NotChecked=0, Total=24806 [2019-01-14 01:35:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-01-14 01:35:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2019-01-14 01:35:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-01-14 01:35:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 794 transitions. [2019-01-14 01:35:21,732 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 794 transitions. Word has length 364 [2019-01-14 01:35:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:21,733 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 794 transitions. [2019-01-14 01:35:21,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-14 01:35:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 794 transitions. [2019-01-14 01:35:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-14 01:35:21,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:21,739 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 27, 27, 27, 26, 26, 26, 1, 1] [2019-01-14 01:35:21,739 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2138634424, now seen corresponding path program 49 times [2019-01-14 01:35:21,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:21,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:21,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:21,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:35:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:25,200 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 01:35:25,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:25,200 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 01:35:25,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:35:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:25,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:25,418 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 01:35:25,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:25,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2019-01-14 01:35:25,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-14 01:35:25,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-14 01:35:25,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2019-01-14 01:35:25,439 INFO L87 Difference]: Start difference. First operand 740 states and 794 transitions. Second operand 108 states. [2019-01-14 01:35:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:28,243 INFO L93 Difference]: Finished difference Result 757 states and 813 transitions. [2019-01-14 01:35:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-14 01:35:28,245 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 371 [2019-01-14 01:35:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:28,248 INFO L225 Difference]: With dead ends: 757 [2019-01-14 01:35:28,248 INFO L226 Difference]: Without dead ends: 756 [2019-01-14 01:35:28,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7315, Invalid=18445, Unknown=0, NotChecked=0, Total=25760 [2019-01-14 01:35:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-01-14 01:35:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 754. [2019-01-14 01:35:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-14 01:35:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 809 transitions. [2019-01-14 01:35:28,262 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 809 transitions. Word has length 371 [2019-01-14 01:35:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:28,262 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 809 transitions. [2019-01-14 01:35:28,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-14 01:35:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 809 transitions. [2019-01-14 01:35:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-01-14 01:35:28,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:28,265 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 27, 27, 27, 27, 27, 27, 1, 1] [2019-01-14 01:35:28,265 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 15488826, now seen corresponding path program 50 times [2019-01-14 01:35:28,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:28,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:28,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:28,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:35:28,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:32,006 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 01:35:32,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:32,006 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 01:35:32,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:35:32,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:35:32,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:35:32,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:32,227 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 01:35:32,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:32,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2019-01-14 01:35:32,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-14 01:35:32,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-14 01:35:32,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2019-01-14 01:35:32,247 INFO L87 Difference]: Start difference. First operand 754 states and 809 transitions. Second operand 110 states. [2019-01-14 01:35:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:35,158 INFO L93 Difference]: Finished difference Result 771 states and 828 transitions. [2019-01-14 01:35:35,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-14 01:35:35,159 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 378 [2019-01-14 01:35:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:35,163 INFO L225 Difference]: With dead ends: 771 [2019-01-14 01:35:35,163 INFO L226 Difference]: Without dead ends: 770 [2019-01-14 01:35:35,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7588, Invalid=19144, Unknown=0, NotChecked=0, Total=26732 [2019-01-14 01:35:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-01-14 01:35:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 768. [2019-01-14 01:35:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-01-14 01:35:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 824 transitions. [2019-01-14 01:35:35,175 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 824 transitions. Word has length 378 [2019-01-14 01:35:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:35,176 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 824 transitions. [2019-01-14 01:35:35,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-14 01:35:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 824 transitions. [2019-01-14 01:35:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-14 01:35:35,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:35,178 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 28, 28, 28, 27, 27, 27, 1, 1] [2019-01-14 01:35:35,179 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:35,179 INFO L82 PathProgramCache]: Analyzing trace with hash -453775154, now seen corresponding path program 51 times [2019-01-14 01:35:35,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:35,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:35,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:35:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:38,741 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 01:35:38,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:38,741 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 01:35:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:35:39,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-14 01:35:39,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:35:39,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:39,212 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 01:35:39,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:39,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2019-01-14 01:35:39,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-14 01:35:39,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-14 01:35:39,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2019-01-14 01:35:39,255 INFO L87 Difference]: Start difference. First operand 768 states and 824 transitions. Second operand 112 states. [2019-01-14 01:35:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:41,917 INFO L93 Difference]: Finished difference Result 785 states and 843 transitions. [2019-01-14 01:35:41,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-14 01:35:41,920 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 385 [2019-01-14 01:35:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:41,924 INFO L225 Difference]: With dead ends: 785 [2019-01-14 01:35:41,924 INFO L226 Difference]: Without dead ends: 784 [2019-01-14 01:35:41,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7866, Invalid=19856, Unknown=0, NotChecked=0, Total=27722 [2019-01-14 01:35:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-01-14 01:35:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2019-01-14 01:35:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-01-14 01:35:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 839 transitions. [2019-01-14 01:35:41,937 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 839 transitions. Word has length 385 [2019-01-14 01:35:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:41,937 INFO L480 AbstractCegarLoop]: Abstraction has 782 states and 839 transitions. [2019-01-14 01:35:41,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-14 01:35:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 839 transitions. [2019-01-14 01:35:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-14 01:35:41,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:41,940 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 28, 28, 28, 28, 28, 28, 1, 1] [2019-01-14 01:35:41,940 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:41,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1555352308, now seen corresponding path program 52 times [2019-01-14 01:35:41,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:41,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:41,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:41,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:35:41,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:45,583 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 01:35:45,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:45,584 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 01:35:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:35:45,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:35:45,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:35:45,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:45,840 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 01:35:45,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:45,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2019-01-14 01:35:45,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-14 01:35:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-14 01:35:45,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2019-01-14 01:35:45,861 INFO L87 Difference]: Start difference. First operand 782 states and 839 transitions. Second operand 114 states. [2019-01-14 01:35:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:49,022 INFO L93 Difference]: Finished difference Result 799 states and 858 transitions. [2019-01-14 01:35:49,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-01-14 01:35:49,024 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 392 [2019-01-14 01:35:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:49,028 INFO L225 Difference]: With dead ends: 799 [2019-01-14 01:35:49,028 INFO L226 Difference]: Without dead ends: 798 [2019-01-14 01:35:49,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8149, Invalid=20581, Unknown=0, NotChecked=0, Total=28730 [2019-01-14 01:35:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-01-14 01:35:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2019-01-14 01:35:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-01-14 01:35:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 854 transitions. [2019-01-14 01:35:49,041 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 854 transitions. Word has length 392 [2019-01-14 01:35:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:49,041 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 854 transitions. [2019-01-14 01:35:49,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-14 01:35:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 854 transitions. [2019-01-14 01:35:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-01-14 01:35:49,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:49,044 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 29, 29, 29, 28, 28, 28, 1, 1] [2019-01-14 01:35:49,045 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -655444012, now seen corresponding path program 53 times [2019-01-14 01:35:49,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:49,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:49,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:35:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:35:52,732 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 01:35:52,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:35:52,733 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 01:35:52,744 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:35:53,199 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-01-14 01:35:53,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:35:53,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:35:53,310 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 01:35:53,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:35:53,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2019-01-14 01:35:53,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-14 01:35:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-14 01:35:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2019-01-14 01:35:53,332 INFO L87 Difference]: Start difference. First operand 796 states and 854 transitions. Second operand 116 states. [2019-01-14 01:35:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:35:56,425 INFO L93 Difference]: Finished difference Result 813 states and 873 transitions. [2019-01-14 01:35:56,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-14 01:35:56,427 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 399 [2019-01-14 01:35:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:35:56,432 INFO L225 Difference]: With dead ends: 813 [2019-01-14 01:35:56,432 INFO L226 Difference]: Without dead ends: 812 [2019-01-14 01:35:56,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8437, Invalid=21319, Unknown=0, NotChecked=0, Total=29756 [2019-01-14 01:35:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-01-14 01:35:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 810. [2019-01-14 01:35:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-01-14 01:35:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 869 transitions. [2019-01-14 01:35:56,445 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 869 transitions. Word has length 399 [2019-01-14 01:35:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:35:56,445 INFO L480 AbstractCegarLoop]: Abstraction has 810 states and 869 transitions. [2019-01-14 01:35:56,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-14 01:35:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 869 transitions. [2019-01-14 01:35:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-01-14 01:35:56,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:35:56,448 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 29, 29, 29, 29, 29, 29, 1, 1] [2019-01-14 01:35:56,448 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:35:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:35:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1419981102, now seen corresponding path program 54 times [2019-01-14 01:35:56,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:35:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:35:56,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:56,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:35:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:35:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:36:00,391 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 01:36:00,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:36:00,392 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 01:36:00,400 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:36:00,843 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2019-01-14 01:36:00,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:36:00,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:36:00,981 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 01:36:01,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:36:01,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2019-01-14 01:36:01,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-14 01:36:01,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-14 01:36:01,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2019-01-14 01:36:01,002 INFO L87 Difference]: Start difference. First operand 810 states and 869 transitions. Second operand 118 states. [2019-01-14 01:36:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:36:04,208 INFO L93 Difference]: Finished difference Result 827 states and 888 transitions. [2019-01-14 01:36:04,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-01-14 01:36:04,209 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 406 [2019-01-14 01:36:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:36:04,214 INFO L225 Difference]: With dead ends: 827 [2019-01-14 01:36:04,214 INFO L226 Difference]: Without dead ends: 826 [2019-01-14 01:36:04,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8730, Invalid=22070, Unknown=0, NotChecked=0, Total=30800 [2019-01-14 01:36:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-01-14 01:36:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 824. [2019-01-14 01:36:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2019-01-14 01:36:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 884 transitions. [2019-01-14 01:36:04,228 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 884 transitions. Word has length 406 [2019-01-14 01:36:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:36:04,228 INFO L480 AbstractCegarLoop]: Abstraction has 824 states and 884 transitions. [2019-01-14 01:36:04,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-14 01:36:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 884 transitions. [2019-01-14 01:36:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-01-14 01:36:04,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:36:04,231 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 30, 30, 30, 29, 29, 29, 1, 1] [2019-01-14 01:36:04,232 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:36:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:36:04,232 INFO L82 PathProgramCache]: Analyzing trace with hash -98190246, now seen corresponding path program 55 times [2019-01-14 01:36:04,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:36:04,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:36:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:36:04,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:36:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:36:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:36:08,138 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 01:36:08,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:36:08,138 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 01:36:08,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:36:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:36:08,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:36:08,450 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 01:36:08,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:36:08,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2019-01-14 01:36:08,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-14 01:36:08,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-14 01:36:08,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2019-01-14 01:36:08,471 INFO L87 Difference]: Start difference. First operand 824 states and 884 transitions. Second operand 120 states. [2019-01-14 01:36:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:36:11,746 INFO L93 Difference]: Finished difference Result 841 states and 903 transitions. [2019-01-14 01:36:11,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-01-14 01:36:11,747 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 413 [2019-01-14 01:36:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:36:11,751 INFO L225 Difference]: With dead ends: 841 [2019-01-14 01:36:11,751 INFO L226 Difference]: Without dead ends: 840 [2019-01-14 01:36:11,753 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 01:36:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-01-14 01:36:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2019-01-14 01:36:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-01-14 01:36:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 899 transitions. [2019-01-14 01:36:11,766 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 899 transitions. Word has length 413 [2019-01-14 01:36:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:36:11,767 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 899 transitions. [2019-01-14 01:36:11,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-14 01:36:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 899 transitions. [2019-01-14 01:36:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-14 01:36:11,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:36:11,770 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 30, 30, 30, 30, 30, 30, 1, 1] [2019-01-14 01:36:11,770 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:36:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:36:11,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1675810328, now seen corresponding path program 56 times [2019-01-14 01:36:11,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:36:11,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:36:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:36:11,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:36:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:36:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:36:16,047 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 01:36:16,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:36:16,047 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 01:36:16,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:36:16,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:36:16,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:36:16,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:36:16,337 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 01:36:16,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:36:16,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2019-01-14 01:36:16,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-14 01:36:16,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-14 01:36:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2019-01-14 01:36:16,359 INFO L87 Difference]: Start difference. First operand 838 states and 899 transitions. Second operand 122 states. [2019-01-14 01:36:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:36:19,758 INFO L93 Difference]: Finished difference Result 855 states and 918 transitions. [2019-01-14 01:36:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-01-14 01:36:19,759 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 420 [2019-01-14 01:36:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:36:19,763 INFO L225 Difference]: With dead ends: 855 [2019-01-14 01:36:19,763 INFO L226 Difference]: Without dead ends: 854 [2019-01-14 01:36:19,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9331, Invalid=23611, Unknown=0, NotChecked=0, Total=32942 [2019-01-14 01:36:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-01-14 01:36:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 852. [2019-01-14 01:36:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-01-14 01:36:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 914 transitions. [2019-01-14 01:36:19,777 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 914 transitions. Word has length 420 [2019-01-14 01:36:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:36:19,778 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 914 transitions. [2019-01-14 01:36:19,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-14 01:36:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 914 transitions. [2019-01-14 01:36:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-01-14 01:36:19,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:36:19,781 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 31, 31, 31, 30, 30, 30, 1, 1] [2019-01-14 01:36:19,781 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:36:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:36:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1516282272, now seen corresponding path program 57 times [2019-01-14 01:36:19,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:36:19,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:36:19,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:36:19,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:36:19,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:36:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:36:22,320 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 01:36:24,820 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 01:36:24,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:36:24,820 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 01:36:24,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:36:25,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-14 01:36:25,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:36:25,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:36:34,106 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 01:36:34,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:36:34,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 122] total 215 [2019-01-14 01:36:34,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2019-01-14 01:36:34,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2019-01-14 01:36:34,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7253, Invalid=38757, Unknown=0, NotChecked=0, Total=46010 [2019-01-14 01:36:34,130 INFO L87 Difference]: Start difference. First operand 852 states and 914 transitions. Second operand 215 states. [2019-01-14 01:38:49,149 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 01:40:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:40:12,858 INFO L93 Difference]: Finished difference Result 7999 states and 8498 transitions. [2019-01-14 01:40:12,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2454 states. [2019-01-14 01:40:12,858 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 427 [2019-01-14 01:40:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:40:12,859 INFO L225 Difference]: With dead ends: 7999 [2019-01-14 01:40:12,859 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:40:13,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3903 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 2665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353048 ImplicationChecksByTransitivity, 178.9s TimeCoverageRelationStatistics Valid=579180, Invalid=6531042, Unknown=0, NotChecked=0, Total=7110222 [2019-01-14 01:40:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:40:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:40:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:40:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:40:13,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2019-01-14 01:40:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:40:13,020 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:40:13,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2019-01-14 01:40:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:40:13,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:40:13,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:40:20,032 WARN L181 SmtUtils]: Spent 7.00 s on a formula simplification. DAG size of input: 1224 DAG size of output: 1194 [2019-01-14 01:40:51,066 WARN L181 SmtUtils]: Spent 30.97 s on a formula simplification. DAG size of input: 1194 DAG size of output: 320 [2019-01-14 01:40:51,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:40:51,071 INFO L444 ceAbstractionStarter]: At program point L23(lines 20 24) the Hoare annotation is: (<= ULTIMATE.start_f_~a 2147483647) [2019-01-14 01:40:51,071 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:40:51,071 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:40:51,071 INFO L444 ceAbstractionStarter]: At program point L17(lines 9 18) the Hoare annotation is: (<= ULTIMATE.start_f_~a 2147483647) [2019-01-14 01:40:51,071 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-14 01:40:51,071 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-01-14 01:40:51,072 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-01-14 01:40:51,072 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-14 01:40:51,072 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-01-14 01:40:51,072 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2019-01-14 01:40:51,072 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 14) no Hoare annotation was computed. [2019-01-14 01:40:51,073 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 01:40:51,073 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 16) no Hoare annotation was computed. [2019-01-14 01:40:51,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:40:51,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:40:51,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:40:51,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:40:51,074 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-01-14 01:40:51,074 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-14 01:40:51,074 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2019-01-14 01:40:51,092 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,107 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,107 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,108 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,108 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,109 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,109 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,109 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,115 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,115 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,115 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,282 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:40:51 BoogieIcfgContainer [2019-01-14 01:40:51,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:40:51,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:40:51,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:40:51,301 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:40:51,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:32:54" (3/4) ... [2019-01-14 01:40:51,309 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:40:51,335 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 01:40:51,335 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:40:51,374 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 01:40:51,401 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:40:51,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:40:51,405 INFO L168 Benchmark]: Toolchain (without parser) took 477200.92 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 951.4 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-01-14 01:40:51,405 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:40:51,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:40:51,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.81 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:40:51,408 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:40:51,409 INFO L168 Benchmark]: RCFGBuilder took 396.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-14 01:40:51,409 INFO L168 Benchmark]: TraceAbstraction took 476321.65 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 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-01-14 01:40:51,410 INFO L168 Benchmark]: Witness Printer took 103.47 ms. Allocated memory is still 5.3 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:40:51,417 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 42.81 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.75 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 396.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 476321.65 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 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 103.47 ms. Allocated memory is still 5.3 GB. Free memory is still 2.8 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: 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: 15]: 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 01:40:51,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,536 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,538 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,633 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,633 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,638 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,638 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,638 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,638 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,638 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,896 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,896 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,896 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-14 01:40:51,987 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, 476.0s OverallTime, 64 OverallIterations, 61 TraceHistogramMax, 302.8s AutomataDifference, 0.0s DeadEndRemovalTime, 38.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 656 SDtfs, 43292 SDslu, 26299 SDs, 0 SdLazy, 28138 SolverSat, 9120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22176 GetRequests, 13986 SyntacticMatches, 0 SemanticMatches, 8190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3459709 ImplicationChecksByTransitivity, 337.3s 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, 7.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 30704 FormulaSimplificationTreeSizeReductionInter, 31.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 119.1s 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...