./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NonTermination4_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa 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/NonTermination4_false-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 94b61e96441ca10668b436b4ef10dfd9464f0863 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:33:51,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:33:51,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:33:51,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:33:51,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:33:51,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:33:51,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:33:51,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:33:51,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:33:51,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:33:51,350 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:33:51,350 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:33:51,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:33:51,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:33:51,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:33:51,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:33:51,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:33:51,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:33:51,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:33:51,363 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:33:51,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:33:51,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:33:51,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:33:51,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:33:51,369 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:33:51,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:33:51,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:33:51,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:33:51,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:33:51,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:33:51,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:33:51,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:33:51,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:33:51,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:33:51,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:33:51,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:33:51,380 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:33:51,411 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:33:51,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:33:51,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:33:51,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:33:51,417 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:33:51,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:33:51,418 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:33:51,418 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:33:51,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:33:51,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:33:51,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:33:51,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:33:51,419 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:33:51,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:33:51,419 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:33:51,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:33:51,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:33:51,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:33:51,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:33:51,423 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:33:51,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:33:51,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:33:51,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:33:51,424 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:33:51,424 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:33:51,424 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:33:51,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:33:51,424 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 -> 94b61e96441ca10668b436b4ef10dfd9464f0863 [2019-01-01 20:33:51,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:33:51,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:33:51,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:33:51,485 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:33:51,486 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:33:51,487 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NonTermination4_false-no-overflow.c [2019-01-01 20:33:51,554 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7699767/427f191f47eb42f1880777a5906b7a60/FLAG1124d5aa1 [2019-01-01 20:33:52,044 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:33:52,045 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NonTermination4_false-no-overflow.c [2019-01-01 20:33:52,053 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7699767/427f191f47eb42f1880777a5906b7a60/FLAG1124d5aa1 [2019-01-01 20:33:52,401 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7699767/427f191f47eb42f1880777a5906b7a60 [2019-01-01 20:33:52,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:33:52,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:33:52,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:33:52,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:33:52,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:33:52,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f922b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52, skipping insertion in model container [2019-01-01 20:33:52,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:33:52,444 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:33:52,607 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:33:52,614 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:33:52,632 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:33:52,650 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:33:52,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52 WrapperNode [2019-01-01 20:33:52,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:33:52,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:33:52,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:33:52,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:33:52,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:33:52,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:33:52,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:33:52,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:33:52,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (1/1) ... [2019-01-01 20:33:52,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:33:52,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:33:52,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:33:52,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:33:52,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (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-01 20:33:52,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:33:52,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:33:53,108 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:33:53,109 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 20:33:53,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:33:53 BoogieIcfgContainer [2019-01-01 20:33:53,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:33:53,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:33:53,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:33:53,114 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:33:53,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:33:52" (1/3) ... [2019-01-01 20:33:53,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8ea078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:33:53, skipping insertion in model container [2019-01-01 20:33:53,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:33:52" (2/3) ... [2019-01-01 20:33:53,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8ea078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:33:53, skipping insertion in model container [2019-01-01 20:33:53,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:33:53" (3/3) ... [2019-01-01 20:33:53,118 INFO L112 eAbstractionObserver]: Analyzing ICFG NonTermination4_false-no-overflow.c [2019-01-01 20:33:53,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:33:53,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 20:33:53,155 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 20:33:53,188 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:33:53,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:33:53,189 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:33:53,189 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:33:53,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:33:53,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:33:53,189 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:33:53,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:33:53,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:33:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-01-01 20:33:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-01 20:33:53,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:53,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-01 20:33:53,215 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:53,222 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-01 20:33:53,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:53,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:53,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:53,378 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-01 20:33:53,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:33:53,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:33:53,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:33:53,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:33:53,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:33:53,399 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-01-01 20:33:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:53,545 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-01 20:33:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:33:53,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-01 20:33:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:53,565 INFO L225 Difference]: With dead ends: 22 [2019-01-01 20:33:53,565 INFO L226 Difference]: Without dead ends: 13 [2019-01-01 20:33:53,570 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-01 20:33:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-01 20:33:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 20:33:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 20:33:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-01 20:33:53,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 3 [2019-01-01 20:33:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:53,618 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-01 20:33:53,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:33:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-01 20:33:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:33:53,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:53,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:33:53,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-01-01 20:33:53,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:53,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:53,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:53,663 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-01 20:33:53,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:33:53,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:33:53,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:33:53,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:33:53,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:33:53,667 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-01-01 20:33:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:53,708 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-01 20:33:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:33:53,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 20:33:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:53,709 INFO L225 Difference]: With dead ends: 12 [2019-01-01 20:33:53,709 INFO L226 Difference]: Without dead ends: 11 [2019-01-01 20:33:53,710 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-01 20:33:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-01 20:33:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 20:33:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 20:33:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-01 20:33:53,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 4 [2019-01-01 20:33:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:53,715 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-01 20:33:53,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:33:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-01 20:33:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:33:53,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:53,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:33:53,717 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29862563, now seen corresponding path program 1 times [2019-01-01 20:33:53,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:53,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:53,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:53,759 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-01 20:33:53,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:33:53,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:33:53,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:33:53,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:33:53,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:33:53,762 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 3 states. [2019-01-01 20:33:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:53,806 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-01 20:33:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:33:53,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:33:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:53,809 INFO L225 Difference]: With dead ends: 15 [2019-01-01 20:33:53,809 INFO L226 Difference]: Without dead ends: 14 [2019-01-01 20:33:53,810 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-01 20:33:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-01 20:33:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-01 20:33:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 20:33:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-01 20:33:53,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2019-01-01 20:33:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:53,814 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-01 20:33:53,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:33:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-01 20:33:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:33:53,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:53,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:33:53,815 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash 925739501, now seen corresponding path program 1 times [2019-01-01 20:33:53,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:53,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:53,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:53,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:53,864 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-01 20:33:53,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:33:53,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:33:53,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:33:53,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:33:53,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:33:53,866 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2019-01-01 20:33:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:53,880 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-01 20:33:53,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:33:53,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:33:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:53,881 INFO L225 Difference]: With dead ends: 13 [2019-01-01 20:33:53,881 INFO L226 Difference]: Without dead ends: 12 [2019-01-01 20:33:53,882 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-01 20:33:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-01 20:33:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 20:33:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 20:33:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-01 20:33:53,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2019-01-01 20:33:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:53,886 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-01 20:33:53,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:33:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-01 20:33:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 20:33:53,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:53,887 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:33:53,887 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:53,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:53,888 INFO L82 PathProgramCache]: Analyzing trace with hash 577431471, now seen corresponding path program 1 times [2019-01-01 20:33:53,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:53,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:53,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:53,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:53,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:53,938 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-01 20:33:53,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:53,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:54,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:54,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-01 20:33:54,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:33:54,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:33:54,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:33:54,071 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-01-01 20:33:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:54,103 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-01 20:33:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:33:54,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-01 20:33:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:54,105 INFO L225 Difference]: With dead ends: 17 [2019-01-01 20:33:54,105 INFO L226 Difference]: Without dead ends: 16 [2019-01-01 20:33:54,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:33:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-01 20:33:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 20:33:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 20:33:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-01 20:33:54,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2019-01-01 20:33:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:54,110 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-01 20:33:54,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:33:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-01 20:33:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:33:54,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:54,111 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-01 20:33:54,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash 860863857, now seen corresponding path program 1 times [2019-01-01 20:33:54,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:54,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:54,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:54,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:54,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:54,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 20:33:54,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:54,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:54,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:54,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-01 20:33:54,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:33:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:33:54,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:33:54,293 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2019-01-01 20:33:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:54,413 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-01 20:33:54,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:33:54,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 20:33:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:54,416 INFO L225 Difference]: With dead ends: 19 [2019-01-01 20:33:54,416 INFO L226 Difference]: Without dead ends: 18 [2019-01-01 20:33:54,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:33:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-01 20:33:54,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-01 20:33:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 20:33:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-01 20:33:54,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2019-01-01 20:33:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:54,422 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-01 20:33:54,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:33:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-01 20:33:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 20:33:54,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:54,425 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1] [2019-01-01 20:33:54,425 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:54,427 INFO L82 PathProgramCache]: Analyzing trace with hash 745486881, now seen corresponding path program 2 times [2019-01-01 20:33:54,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:54,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:54,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:54,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:54,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:54,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:54,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 20:33:54,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:33:54,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:33:54,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:54,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:54,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:54,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:33:54,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:33:54,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:33:54,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:33:54,755 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2019-01-01 20:33:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:54,818 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-01 20:33:54,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:33:54,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-01 20:33:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:54,819 INFO L225 Difference]: With dead ends: 22 [2019-01-01 20:33:54,820 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 20:33:54,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:33:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 20:33:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-01 20:33:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 20:33:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-01 20:33:54,824 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2019-01-01 20:33:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:54,825 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-01 20:33:54,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:33:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-01 20:33:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 20:33:54,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:54,826 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-01 20:33:54,826 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash -846644381, now seen corresponding path program 2 times [2019-01-01 20:33:54,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:54,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:54,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:54,880 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-01 20:33:54,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:33:54,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:33:54,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:54,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:54,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:54,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:33:54,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:33:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:33:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:33:54,992 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 5 states. [2019-01-01 20:33:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:55,052 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-01 20:33:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:33:55,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-01 20:33:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:55,054 INFO L225 Difference]: With dead ends: 24 [2019-01-01 20:33:55,054 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 20:33:55,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:33:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 20:33:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-01 20:33:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 20:33:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-01 20:33:55,059 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2019-01-01 20:33:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:55,059 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-01 20:33:55,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:33:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-01 20:33:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 20:33:55,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:55,060 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1] [2019-01-01 20:33:55,061 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:55,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1960222447, now seen corresponding path program 3 times [2019-01-01 20:33:55,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:55,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:55,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:55,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:55,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:55,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:55,253 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-01 20:33:55,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:33:55,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:33:55,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:55,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:55,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:55,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:33:55,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:33:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:33:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:33:55,369 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 6 states. [2019-01-01 20:33:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:55,419 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-01 20:33:55,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:33:55,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-01 20:33:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:55,422 INFO L225 Difference]: With dead ends: 27 [2019-01-01 20:33:55,422 INFO L226 Difference]: Without dead ends: 26 [2019-01-01 20:33:55,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:33:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-01 20:33:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-01 20:33:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 20:33:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-01 20:33:55,428 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 18 [2019-01-01 20:33:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:55,428 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-01 20:33:55,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:33:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-01 20:33:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:33:55,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:55,429 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-01 20:33:55,430 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:55,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1716869967, now seen corresponding path program 3 times [2019-01-01 20:33:55,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:55,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:55,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:55,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:55,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:55,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:55,530 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-01 20:33:55,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:33:55,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:33:55,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:55,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:55,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:55,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:33:55,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:33:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:33:55,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:33:55,747 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 6 states. [2019-01-01 20:33:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:55,788 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-01 20:33:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:33:55,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-01 20:33:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:55,789 INFO L225 Difference]: With dead ends: 29 [2019-01-01 20:33:55,789 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 20:33:55,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:33:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 20:33:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-01 20:33:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 20:33:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-01 20:33:55,795 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-01-01 20:33:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:55,796 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-01 20:33:55,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:33:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-01 20:33:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 20:33:55,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:55,797 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1] [2019-01-01 20:33:55,797 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1492388577, now seen corresponding path program 4 times [2019-01-01 20:33:55,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:55,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:55,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:55,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:55,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:56,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:56,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 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-01 20:33:56,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:33:56,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:33:56,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:56,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:56,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:56,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:33:56,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:33:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:33:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:33:56,351 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2019-01-01 20:33:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:56,423 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-01 20:33:56,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:33:56,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-01 20:33:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:56,425 INFO L225 Difference]: With dead ends: 32 [2019-01-01 20:33:56,425 INFO L226 Difference]: Without dead ends: 31 [2019-01-01 20:33:56,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:33:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-01 20:33:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-01 20:33:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 20:33:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-01 20:33:56,432 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 23 [2019-01-01 20:33:56,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:56,434 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-01 20:33:56,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:33:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-01 20:33:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:33:56,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:56,435 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-01 20:33:56,435 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:56,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:56,436 INFO L82 PathProgramCache]: Analyzing trace with hash -333652957, now seen corresponding path program 4 times [2019-01-01 20:33:56,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:56,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:56,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:56,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:56,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:56,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:56,708 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-01 20:33:56,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:33:56,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:33:56,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:56,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:56,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:56,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:33:56,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:33:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:33:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:33:56,845 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 7 states. [2019-01-01 20:33:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:56,913 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-01 20:33:56,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:33:56,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-01 20:33:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:56,915 INFO L225 Difference]: With dead ends: 34 [2019-01-01 20:33:56,915 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 20:33:56,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:33:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 20:33:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-01 20:33:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 20:33:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-01 20:33:56,922 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 25 [2019-01-01 20:33:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:56,923 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-01 20:33:56,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:33:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-01 20:33:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 20:33:56,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:56,924 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1] [2019-01-01 20:33:56,924 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1300871633, now seen corresponding path program 5 times [2019-01-01 20:33:56,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:56,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:56,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:57,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:57,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 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-01 20:33:57,036 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:33:57,060 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 20:33:57,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:57,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:57,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:57,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:33:57,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:33:57,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:33:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:33:57,182 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 8 states. [2019-01-01 20:33:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:57,269 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-01 20:33:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:33:57,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-01-01 20:33:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:57,271 INFO L225 Difference]: With dead ends: 37 [2019-01-01 20:33:57,271 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 20:33:57,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:33:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 20:33:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-01 20:33:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 20:33:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-01 20:33:57,277 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 28 [2019-01-01 20:33:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:57,278 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-01 20:33:57,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:33:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-01 20:33:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 20:33:57,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:57,279 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-01 20:33:57,279 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash -302154767, now seen corresponding path program 5 times [2019-01-01 20:33:57,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:57,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:57,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:57,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:57,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:57,399 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-01 20:33:57,409 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:33:57,460 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 20:33:57,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:57,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:57,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:57,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:33:57,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:33:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:33:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:33:57,559 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 8 states. [2019-01-01 20:33:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:57,603 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-01 20:33:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:33:57,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-01 20:33:57,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:57,605 INFO L225 Difference]: With dead ends: 39 [2019-01-01 20:33:57,605 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 20:33:57,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:33:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 20:33:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-01 20:33:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 20:33:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-01 20:33:57,610 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 30 [2019-01-01 20:33:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:57,611 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-01 20:33:57,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:33:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-01 20:33:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 20:33:57,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:57,612 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1] [2019-01-01 20:33:57,612 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:57,612 INFO L82 PathProgramCache]: Analyzing trace with hash 758836129, now seen corresponding path program 6 times [2019-01-01 20:33:57,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:57,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:57,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:57,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:57,699 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-01 20:33:57,709 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:33:57,727 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 20:33:57,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:57,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:57,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:57,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:33:57,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:33:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:33:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:33:57,875 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 9 states. [2019-01-01 20:33:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:58,058 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-01 20:33:58,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:33:58,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-01 20:33:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:58,068 INFO L225 Difference]: With dead ends: 42 [2019-01-01 20:33:58,068 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 20:33:58,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:33:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 20:33:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-01 20:33:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 20:33:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-01 20:33:58,075 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 33 [2019-01-01 20:33:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:58,075 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-01 20:33:58,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:33:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-01 20:33:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 20:33:58,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:58,081 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-01 20:33:58,082 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:58,082 INFO L82 PathProgramCache]: Analyzing trace with hash -902918941, now seen corresponding path program 6 times [2019-01-01 20:33:58,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:58,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:58,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:58,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:58,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:58,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:58,349 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-01 20:33:58,360 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:33:58,380 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 20:33:58,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:58,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:58,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:58,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:33:58,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:33:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:33:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:33:58,486 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 9 states. [2019-01-01 20:33:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:58,547 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-01 20:33:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:33:58,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-01-01 20:33:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:58,548 INFO L225 Difference]: With dead ends: 44 [2019-01-01 20:33:58,550 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 20:33:58,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:33:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 20:33:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-01 20:33:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 20:33:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-01 20:33:58,555 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 35 [2019-01-01 20:33:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:58,556 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-01 20:33:58,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:33:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-01 20:33:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 20:33:58,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:58,557 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1] [2019-01-01 20:33:58,561 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 522050927, now seen corresponding path program 7 times [2019-01-01 20:33:58,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:58,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:58,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:58,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:33:58,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:58,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:58,649 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-01 20:33:58,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:58,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:58,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:33:58,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:33:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:33:58,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:33:58,840 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 10 states. [2019-01-01 20:33:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:58,891 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-01 20:33:58,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:33:58,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-01-01 20:33:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:58,893 INFO L225 Difference]: With dead ends: 47 [2019-01-01 20:33:58,893 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 20:33:58,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:33:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 20:33:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-01-01 20:33:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 20:33:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-01 20:33:58,899 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 38 [2019-01-01 20:33:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:58,899 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-01 20:33:58,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:33:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-01 20:33:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 20:33:58,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:58,900 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-01 20:33:58,901 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash -820231375, now seen corresponding path program 7 times [2019-01-01 20:33:58,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:58,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:58,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:58,994 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-01 20:33:59,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:59,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:59,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:59,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:33:59,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:33:59,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:33:59,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:33:59,187 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 10 states. [2019-01-01 20:33:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:33:59,227 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-01 20:33:59,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:33:59,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-01-01 20:33:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:33:59,230 INFO L225 Difference]: With dead ends: 49 [2019-01-01 20:33:59,230 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 20:33:59,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:33:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 20:33:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-01-01 20:33:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 20:33:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-01 20:33:59,238 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 40 [2019-01-01 20:33:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:33:59,238 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-01 20:33:59,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:33:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-01 20:33:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 20:33:59,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:33:59,239 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1] [2019-01-01 20:33:59,240 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:33:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:33:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1443898271, now seen corresponding path program 8 times [2019-01-01 20:33:59,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:33:59,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:33:59,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:59,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:33:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:33:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:33:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:59,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:33:59,709 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-01 20:33:59,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:33:59,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:33:59,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:33:59,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:33:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:33:59,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:33:59,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:33:59,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:33:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:33:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:33:59,903 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 11 states. [2019-01-01 20:34:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:00,033 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-01 20:34:00,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:34:00,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-01-01 20:34:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:00,036 INFO L225 Difference]: With dead ends: 52 [2019-01-01 20:34:00,036 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 20:34:00,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 20:34:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-01-01 20:34:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 20:34:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-01 20:34:00,043 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 43 [2019-01-01 20:34:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:00,043 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-01 20:34:00,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:34:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-01 20:34:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 20:34:00,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:00,044 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-01 20:34:00,045 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:00,045 INFO L82 PathProgramCache]: Analyzing trace with hash -311800413, now seen corresponding path program 8 times [2019-01-01 20:34:00,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:00,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:00,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:00,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:00,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:00,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:00,440 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-01 20:34:00,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:00,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:00,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:00,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:00,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:00,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:34:00,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:34:00,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:34:00,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:00,717 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 11 states. [2019-01-01 20:34:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:00,766 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-01 20:34:00,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:34:00,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-01 20:34:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:00,768 INFO L225 Difference]: With dead ends: 54 [2019-01-01 20:34:00,768 INFO L226 Difference]: Without dead ends: 53 [2019-01-01 20:34:00,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-01 20:34:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-01-01 20:34:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 20:34:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-01 20:34:00,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 45 [2019-01-01 20:34:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:00,777 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-01 20:34:00,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:34:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-01 20:34:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 20:34:00,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:00,778 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1] [2019-01-01 20:34:00,778 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:00,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1168204975, now seen corresponding path program 9 times [2019-01-01 20:34:00,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:00,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:00,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:00,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:00,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:00,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:00,996 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-01 20:34:01,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:01,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 20:34:01,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:01,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:01,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:01,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:34:01,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:34:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:34:01,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:34:01,209 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2019-01-01 20:34:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:01,322 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-01 20:34:01,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:34:01,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-01-01 20:34:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:01,324 INFO L225 Difference]: With dead ends: 57 [2019-01-01 20:34:01,324 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 20:34:01,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:34:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 20:34:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-01-01 20:34:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-01 20:34:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-01 20:34:01,330 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 48 [2019-01-01 20:34:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:01,330 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-01 20:34:01,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:34:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-01 20:34:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 20:34:01,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:01,331 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-01 20:34:01,331 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1658518129, now seen corresponding path program 9 times [2019-01-01 20:34:01,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:01,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:01,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:01,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:01,478 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-01 20:34:01,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:01,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 20:34:01,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:01,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:01,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:01,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:34:01,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:34:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:34:01,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:34:01,719 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 12 states. [2019-01-01 20:34:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:01,779 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-01 20:34:01,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:34:01,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-01-01 20:34:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:01,782 INFO L225 Difference]: With dead ends: 59 [2019-01-01 20:34:01,782 INFO L226 Difference]: Without dead ends: 58 [2019-01-01 20:34:01,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:34:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-01 20:34:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-01-01 20:34:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 20:34:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-01 20:34:01,786 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 50 [2019-01-01 20:34:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:01,787 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-01 20:34:01,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:34:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-01 20:34:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 20:34:01,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:01,788 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1] [2019-01-01 20:34:01,788 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash -390144735, now seen corresponding path program 10 times [2019-01-01 20:34:01,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:01,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:01,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:01,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:02,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:02,165 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-01 20:34:02,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:02,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:02,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:02,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:02,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:02,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 20:34:02,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:34:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:34:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:02,340 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 13 states. [2019-01-01 20:34:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:02,398 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-01 20:34:02,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:34:02,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-01-01 20:34:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:02,401 INFO L225 Difference]: With dead ends: 62 [2019-01-01 20:34:02,401 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 20:34:02,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 20:34:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-01-01 20:34:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 20:34:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-01 20:34:02,407 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 53 [2019-01-01 20:34:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:02,407 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-01 20:34:02,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:34:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-01 20:34:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 20:34:02,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:02,408 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-01 20:34:02,409 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1266934173, now seen corresponding path program 10 times [2019-01-01 20:34:02,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:02,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:02,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:02,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:02,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:02,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:02,597 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-01 20:34:02,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:02,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:02,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:02,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:02,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:02,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 20:34:02,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:34:02,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:34:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:02,825 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 13 states. [2019-01-01 20:34:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:02,876 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-01 20:34:02,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:34:02,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-01-01 20:34:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:02,879 INFO L225 Difference]: With dead ends: 64 [2019-01-01 20:34:02,879 INFO L226 Difference]: Without dead ends: 63 [2019-01-01 20:34:02,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-01 20:34:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-01-01 20:34:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 20:34:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-01 20:34:02,884 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 55 [2019-01-01 20:34:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:02,885 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-01 20:34:02,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:34:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-01 20:34:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 20:34:02,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:02,886 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1] [2019-01-01 20:34:02,886 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:02,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:02,887 INFO L82 PathProgramCache]: Analyzing trace with hash 936696815, now seen corresponding path program 11 times [2019-01-01 20:34:02,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:02,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:02,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:02,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:02,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:03,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:03,050 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-01 20:34:03,062 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:03,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-01 20:34:03,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:03,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:03,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:03,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 20:34:03,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 20:34:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 20:34:03,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:03,307 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 14 states. [2019-01-01 20:34:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:03,408 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-01 20:34:03,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 20:34:03,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-01-01 20:34:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:03,410 INFO L225 Difference]: With dead ends: 67 [2019-01-01 20:34:03,410 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 20:34:03,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 20:34:03,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-01-01 20:34:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 20:34:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-01 20:34:03,414 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 58 [2019-01-01 20:34:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:03,415 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-01 20:34:03,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 20:34:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-01 20:34:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-01 20:34:03,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:03,415 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-01 20:34:03,416 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:03,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1777491535, now seen corresponding path program 11 times [2019-01-01 20:34:03,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:03,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:03,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:04,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:04,802 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-01 20:34:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:04,833 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-01 20:34:04,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:04,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:05,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:05,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 20:34:05,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 20:34:05,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 20:34:05,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:05,104 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 14 states. [2019-01-01 20:34:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:05,190 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-01 20:34:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 20:34:05,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-01-01 20:34:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:05,195 INFO L225 Difference]: With dead ends: 69 [2019-01-01 20:34:05,195 INFO L226 Difference]: Without dead ends: 68 [2019-01-01 20:34:05,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-01 20:34:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-01-01 20:34:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 20:34:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-01 20:34:05,202 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 60 [2019-01-01 20:34:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:05,204 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-01 20:34:05,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 20:34:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-01 20:34:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-01 20:34:05,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:05,204 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1] [2019-01-01 20:34:05,207 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:05,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:05,208 INFO L82 PathProgramCache]: Analyzing trace with hash -598479391, now seen corresponding path program 12 times [2019-01-01 20:34:05,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:05,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:05,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:05,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:05,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:05,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:05,579 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-01 20:34:05,597 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:05,618 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-01 20:34:05,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:05,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:05,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:05,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-01 20:34:05,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:34:05,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:34:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:05,912 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 15 states. [2019-01-01 20:34:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:05,975 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-01 20:34:05,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:34:05,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-01-01 20:34:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:05,978 INFO L225 Difference]: With dead ends: 72 [2019-01-01 20:34:05,978 INFO L226 Difference]: Without dead ends: 71 [2019-01-01 20:34:05,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-01 20:34:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-01-01 20:34:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 20:34:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-01 20:34:05,983 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 63 [2019-01-01 20:34:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:05,983 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-01 20:34:05,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:34:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-01 20:34:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 20:34:05,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:05,984 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-01 20:34:05,984 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:05,984 INFO L82 PathProgramCache]: Analyzing trace with hash 386924323, now seen corresponding path program 12 times [2019-01-01 20:34:05,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:05,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:05,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:06,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:06,313 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-01 20:34:06,322 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:06,345 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-01 20:34:06,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:06,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:06,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:06,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-01 20:34:06,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:34:06,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:34:06,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:06,528 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 15 states. [2019-01-01 20:34:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:06,575 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-01 20:34:06,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:34:06,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-01-01 20:34:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:06,578 INFO L225 Difference]: With dead ends: 74 [2019-01-01 20:34:06,578 INFO L226 Difference]: Without dead ends: 73 [2019-01-01 20:34:06,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-01 20:34:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-01-01 20:34:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-01 20:34:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-01 20:34:06,582 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 65 [2019-01-01 20:34:06,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:06,583 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-01 20:34:06,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:34:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-01 20:34:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-01 20:34:06,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:06,583 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1] [2019-01-01 20:34:06,584 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash -829668561, now seen corresponding path program 13 times [2019-01-01 20:34:06,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:06,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:06,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:06,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:06,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:06,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:06,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 20:34:06,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:06,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:07,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:07,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-01 20:34:07,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:34:07,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:34:07,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:07,121 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 16 states. [2019-01-01 20:34:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:07,231 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-01 20:34:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 20:34:07,233 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-01-01 20:34:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:07,234 INFO L225 Difference]: With dead ends: 77 [2019-01-01 20:34:07,234 INFO L226 Difference]: Without dead ends: 76 [2019-01-01 20:34:07,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-01 20:34:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-01-01 20:34:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-01 20:34:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-01 20:34:07,242 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 68 [2019-01-01 20:34:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:07,243 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-01 20:34:07,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:34:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-01 20:34:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 20:34:07,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:07,244 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-01 20:34:07,244 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:07,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:07,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1552431345, now seen corresponding path program 13 times [2019-01-01 20:34:07,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:07,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:07,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:07,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:07,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:07,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:07,707 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-01 20:34:07,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:07,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:08,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:08,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-01 20:34:08,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:34:08,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:34:08,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:08,008 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 16 states. [2019-01-01 20:34:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,071 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-01 20:34:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 20:34:08,073 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2019-01-01 20:34:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,075 INFO L225 Difference]: With dead ends: 79 [2019-01-01 20:34:08,075 INFO L226 Difference]: Without dead ends: 78 [2019-01-01 20:34:08,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-01 20:34:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-01 20:34:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 20:34:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-01 20:34:08,080 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 70 [2019-01-01 20:34:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,080 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-01 20:34:08,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:34:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-01 20:34:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-01 20:34:08,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,081 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1] [2019-01-01 20:34:08,082 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash 274402977, now seen corresponding path program 14 times [2019-01-01 20:34:08,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:08,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:08,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:08,329 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-01 20:34:08,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:08,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:08,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:08,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:08,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:08,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-01 20:34:08,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 20:34:08,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 20:34:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:34:08,645 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 17 states. [2019-01-01 20:34:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:08,775 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-01 20:34:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:34:08,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2019-01-01 20:34:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:08,778 INFO L225 Difference]: With dead ends: 82 [2019-01-01 20:34:08,778 INFO L226 Difference]: Without dead ends: 81 [2019-01-01 20:34:08,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:34:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-01 20:34:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-01-01 20:34:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-01 20:34:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-01 20:34:08,782 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 73 [2019-01-01 20:34:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:08,782 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-01 20:34:08,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 20:34:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-01 20:34:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-01 20:34:08,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:08,783 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-01 20:34:08,784 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1708257251, now seen corresponding path program 14 times [2019-01-01 20:34:08,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:08,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:09,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:09,109 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-01 20:34:09,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:09,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:09,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:09,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:09,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:09,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-01 20:34:09,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 20:34:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 20:34:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:34:09,416 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 17 states. [2019-01-01 20:34:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:09,518 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-01 20:34:09,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:34:09,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2019-01-01 20:34:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:09,520 INFO L225 Difference]: With dead ends: 84 [2019-01-01 20:34:09,521 INFO L226 Difference]: Without dead ends: 83 [2019-01-01 20:34:09,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:34:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-01 20:34:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-01-01 20:34:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-01 20:34:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-01 20:34:09,526 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 75 [2019-01-01 20:34:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:09,526 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-01 20:34:09,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 20:34:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-01 20:34:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-01 20:34:09,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:09,527 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1] [2019-01-01 20:34:09,527 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash -375678353, now seen corresponding path program 15 times [2019-01-01 20:34:09,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:09,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:09,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:09,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:09,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:09,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:09,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 20:34:09,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:09,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-01 20:34:09,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:09,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:09,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:09,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-01 20:34:09,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 20:34:09,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 20:34:09,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:34:09,993 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 18 states. [2019-01-01 20:34:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:10,069 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-01 20:34:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 20:34:10,071 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-01-01 20:34:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:10,072 INFO L225 Difference]: With dead ends: 87 [2019-01-01 20:34:10,072 INFO L226 Difference]: Without dead ends: 86 [2019-01-01 20:34:10,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 15 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:34:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-01 20:34:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-01-01 20:34:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-01 20:34:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-01 20:34:10,077 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 78 [2019-01-01 20:34:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:10,077 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-01 20:34:10,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 20:34:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-01 20:34:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 20:34:10,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:10,078 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-01 20:34:10,078 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash -249642959, now seen corresponding path program 15 times [2019-01-01 20:34:10,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:10,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:10,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:10,538 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-01 20:34:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:10,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-01 20:34:10,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:10,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:10,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-01 20:34:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 20:34:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 20:34:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:34:10,871 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 18 states. [2019-01-01 20:34:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:10,968 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-01 20:34:10,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 20:34:10,969 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-01-01 20:34:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:10,970 INFO L225 Difference]: With dead ends: 89 [2019-01-01 20:34:10,971 INFO L226 Difference]: Without dead ends: 88 [2019-01-01 20:34:10,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 15 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:34:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-01 20:34:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-01-01 20:34:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-01 20:34:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-01 20:34:10,974 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 80 [2019-01-01 20:34:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:10,975 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-01 20:34:10,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 20:34:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-01 20:34:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-01 20:34:10,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:10,976 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1] [2019-01-01 20:34:10,976 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1770012513, now seen corresponding path program 16 times [2019-01-01 20:34:10,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:11,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:11,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 20:34:11,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:11,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:11,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:11,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:11,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:11,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-01 20:34:11,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 20:34:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 20:34:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:34:11,802 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 19 states. [2019-01-01 20:34:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:11,920 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-01 20:34:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 20:34:11,921 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2019-01-01 20:34:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:11,922 INFO L225 Difference]: With dead ends: 92 [2019-01-01 20:34:11,922 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 20:34:11,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:34:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 20:34:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-01-01 20:34:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 20:34:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-01 20:34:11,928 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 83 [2019-01-01 20:34:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:11,929 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-01 20:34:11,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 20:34:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-01 20:34:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-01 20:34:11,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:11,929 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-01 20:34:11,932 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:11,932 INFO L82 PathProgramCache]: Analyzing trace with hash 174977187, now seen corresponding path program 16 times [2019-01-01 20:34:11,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:11,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:11,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:11,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:11,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:13,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:13,191 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-01 20:34:13,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:13,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:13,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:13,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:13,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:13,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-01 20:34:13,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 20:34:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 20:34:13,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:34:13,625 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 19 states. [2019-01-01 20:34:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:13,679 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-01 20:34:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 20:34:13,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2019-01-01 20:34:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:13,682 INFO L225 Difference]: With dead ends: 94 [2019-01-01 20:34:13,683 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 20:34:13,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:34:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 20:34:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-01-01 20:34:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 20:34:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-01 20:34:13,686 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 85 [2019-01-01 20:34:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:13,687 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-01 20:34:13,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 20:34:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-01 20:34:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-01 20:34:13,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:13,687 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1] [2019-01-01 20:34:13,688 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1344872017, now seen corresponding path program 17 times [2019-01-01 20:34:13,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:13,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:13,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:13,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 20:34:13,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:14,000 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-01 20:34:14,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:14,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:14,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:14,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-01 20:34:14,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 20:34:14,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 20:34:14,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:14,281 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 20 states. [2019-01-01 20:34:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:14,379 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-01 20:34:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:34:14,381 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2019-01-01 20:34:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:14,382 INFO L225 Difference]: With dead ends: 97 [2019-01-01 20:34:14,383 INFO L226 Difference]: Without dead ends: 96 [2019-01-01 20:34:14,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 17 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-01 20:34:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-01-01 20:34:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-01 20:34:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-01 20:34:14,387 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 88 [2019-01-01 20:34:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:14,387 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-01 20:34:14,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 20:34:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-01 20:34:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-01 20:34:14,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:14,388 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-01 20:34:14,388 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:14,389 INFO L82 PathProgramCache]: Analyzing trace with hash 363149169, now seen corresponding path program 17 times [2019-01-01 20:34:14,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:14,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:14,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:14,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:14,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:14,976 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-01 20:34:14,988 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:15,023 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-01 20:34:15,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:15,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:15,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:15,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-01 20:34:15,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 20:34:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 20:34:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:15,323 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 20 states. [2019-01-01 20:34:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:15,464 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-01 20:34:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:34:15,465 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 90 [2019-01-01 20:34:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:15,466 INFO L225 Difference]: With dead ends: 99 [2019-01-01 20:34:15,466 INFO L226 Difference]: Without dead ends: 98 [2019-01-01 20:34:15,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 17 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-01 20:34:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-01-01 20:34:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 20:34:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-01 20:34:15,470 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 90 [2019-01-01 20:34:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:15,471 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-01 20:34:15,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 20:34:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-01 20:34:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 20:34:15,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:15,471 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1] [2019-01-01 20:34:15,472 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash -445677535, now seen corresponding path program 18 times [2019-01-01 20:34:15,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:15,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:15,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:15,830 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-01 20:34:15,841 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:15,876 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-01 20:34:15,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:15,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:16,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:16,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-01 20:34:16,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 20:34:16,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 20:34:16,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:34:16,262 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 21 states. [2019-01-01 20:34:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:16,356 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-01 20:34:16,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 20:34:16,358 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2019-01-01 20:34:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:16,361 INFO L225 Difference]: With dead ends: 102 [2019-01-01 20:34:16,361 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 20:34:16,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 18 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:34:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 20:34:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-01 20:34:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 20:34:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-01 20:34:16,368 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 93 [2019-01-01 20:34:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:16,368 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-01 20:34:16,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 20:34:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-01 20:34:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-01 20:34:16,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:16,369 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-01 20:34:16,370 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1200619875, now seen corresponding path program 18 times [2019-01-01 20:34:16,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:16,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:16,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:16,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:16,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:16,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:16,689 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-01 20:34:16,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:34:16,747 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-01 20:34:16,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:16,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:17,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:17,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-01 20:34:17,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 20:34:17,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 20:34:17,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:34:17,045 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 21 states. [2019-01-01 20:34:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:17,210 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-01 20:34:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 20:34:17,212 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2019-01-01 20:34:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:17,213 INFO L225 Difference]: With dead ends: 104 [2019-01-01 20:34:17,213 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 20:34:17,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 18 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:34:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 20:34:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-01 20:34:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 20:34:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-01 20:34:17,217 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 95 [2019-01-01 20:34:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:17,218 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-01 20:34:17,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 20:34:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-01 20:34:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-01 20:34:17,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:17,218 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1] [2019-01-01 20:34:17,219 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:17,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:17,219 INFO L82 PathProgramCache]: Analyzing trace with hash -820897553, now seen corresponding path program 19 times [2019-01-01 20:34:17,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:17,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:17,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:17,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:17,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:17,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:17,556 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-01 20:34:17,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:17,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:18,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:18,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-01 20:34:18,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 20:34:18,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 20:34:18,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:34:18,030 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 22 states. [2019-01-01 20:34:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:18,126 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-01 20:34:18,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 20:34:18,127 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2019-01-01 20:34:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:18,128 INFO L225 Difference]: With dead ends: 107 [2019-01-01 20:34:18,129 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 20:34:18,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 19 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:34:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 20:34:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-01-01 20:34:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 20:34:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-01 20:34:18,132 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 98 [2019-01-01 20:34:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:18,133 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-01 20:34:18,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 20:34:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-01 20:34:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 20:34:18,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:18,134 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-01 20:34:18,134 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1391435441, now seen corresponding path program 19 times [2019-01-01 20:34:18,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:34:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:34:18,183 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 20:34:18,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:18 BoogieIcfgContainer [2019-01-01 20:34:18,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:18,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:18,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:18,237 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:18,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:33:53" (3/4) ... [2019-01-01 20:34:18,241 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 20:34:18,324 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:18,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:18,326 INFO L168 Benchmark]: Toolchain (without parser) took 25920.20 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -106.0 MB). Peak memory consumption was 248.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:18,329 INFO L168 Benchmark]: CDTParser took 0.18 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-01 20:34:18,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:18,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.10 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:18,332 INFO L168 Benchmark]: Boogie Preprocessor took 28.58 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:18,332 INFO L168 Benchmark]: RCFGBuilder took 382.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:18,332 INFO L168 Benchmark]: TraceAbstraction took 25126.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 270.2 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:18,333 INFO L168 Benchmark]: Witness Printer took 87.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:18,339 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.18 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 244.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 45.10 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.58 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 382.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25126.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 270.2 MB. Max. memory is 11.5 GB. * Witness Printer took 87.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 20]: integer overflow possible integer overflow possible We found a FailurePath: [L15] int x, y; [L16] x = 1 [L17] y = 1 [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] 3*y - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 4 error locations. UNSAFE Result, 25.0s OverallTime, 42 OverallIterations, 20 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 413 SDslu, 1318 SDs, 0 SdLazy, 1445 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2317 GetRequests, 1554 SyntacticMatches, 361 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2109 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=41, 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.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 39 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 4022 NumberOfCodeBlocks, 4022 NumberOfCodeBlocksAsserted, 283 NumberOfCheckSat, 3844 ConstructedInterpolants, 0 QuantifiedInterpolants, 753036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3617 ConjunctsInSsa, 435 ConjunctsInUnsatCore, 78 InterpolantComputations, 4 PerfectInterpolantSequences, 0/23218 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...