./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 91b1670e 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/MenloPark_true-no-overflow_true-termination_true-valid-memsafety.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 7c87c9e4b733dad657e6ff9e27a5e9b26a2c3764 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:06:15,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:06:15,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:06:15,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:06:15,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:06:15,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:06:15,404 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:06:15,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:06:15,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:06:15,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:06:15,416 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:06:15,416 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:06:15,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:06:15,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:06:15,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:06:15,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:06:15,430 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:06:15,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:06:15,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:06:15,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:06:15,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:06:15,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:06:15,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:06:15,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:06:15,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:06:15,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:06:15,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:06:15,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:06:15,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:06:15,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:06:15,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:06:15,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:06:15,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:06:15,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:06:15,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:06:15,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:06:15,452 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-28 23:06:15,477 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:06:15,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:06:15,479 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:06:15,479 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:06:15,480 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:06:15,480 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:06:15,480 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:06:15,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:06:15,481 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:06:15,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:06:15,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:06:15,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:06:15,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:06:15,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:06:15,483 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:06:15,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:06:15,483 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:06:15,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:06:15,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:06:15,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:06:15,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:06:15,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:06:15,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:06:15,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:06:15,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:06:15,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:06:15,486 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:06:15,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:06:15,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:06:15,487 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 -> 7c87c9e4b733dad657e6ff9e27a5e9b26a2c3764 [2018-11-28 23:06:15,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:06:15,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:06:15,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:06:15,567 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:06:15,568 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:06:15,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:15,635 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8bcfdbc/e5be576a78a64667a1051dbf0b452bba/FLAG653b82b3f [2018-11-28 23:06:16,107 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:06:16,108 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:16,114 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8bcfdbc/e5be576a78a64667a1051dbf0b452bba/FLAG653b82b3f [2018-11-28 23:06:16,490 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8bcfdbc/e5be576a78a64667a1051dbf0b452bba [2018-11-28 23:06:16,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:06:16,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:06:16,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:06:16,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:06:16,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:06:16,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b87525c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16, skipping insertion in model container [2018-11-28 23:06:16,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:06:16,545 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:06:16,704 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:06:16,708 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:06:16,726 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:06:16,741 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:06:16,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16 WrapperNode [2018-11-28 23:06:16,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:06:16,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:06:16,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:06:16,743 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:06:16,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:06:16,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:06:16,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:06:16,768 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:06:16,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (1/1) ... [2018-11-28 23:06:16,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:06:16,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:06:16,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:06:16,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:06:16,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (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 [2018-11-28 23:06:16,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:06:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:06:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:06:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:06:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:06:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:06:17,236 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:06:17,237 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 23:06:17,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:17 BoogieIcfgContainer [2018-11-28 23:06:17,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:06:17,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:06:17,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:06:17,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:06:17,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:06:16" (1/3) ... [2018-11-28 23:06:17,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d23c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:06:17, skipping insertion in model container [2018-11-28 23:06:17,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:16" (2/3) ... [2018-11-28 23:06:17,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d23c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:06:17, skipping insertion in model container [2018-11-28 23:06:17,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:17" (3/3) ... [2018-11-28 23:06:17,245 INFO L112 eAbstractionObserver]: Analyzing ICFG MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:17,258 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:06:17,275 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-28 23:06:17,316 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-28 23:06:17,356 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:06:17,357 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:06:17,357 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:06:17,357 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:06:17,357 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:06:17,357 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:06:17,358 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:06:17,358 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:06:17,358 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:06:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-28 23:06:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 23:06:17,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:17,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:17,390 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:17,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash -778806590, now seen corresponding path program 1 times [2018-11-28 23:06:17,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:17,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:17,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:17,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:17,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:17,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:17,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:17,563 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-11-28 23:06:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:17,672 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-28 23:06:17,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:17,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 23:06:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:17,684 INFO L225 Difference]: With dead ends: 35 [2018-11-28 23:06:17,684 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 23:06:17,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 23:06:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-28 23:06:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:06:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-28 23:06:17,722 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2018-11-28 23:06:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:17,723 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-28 23:06:17,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-28 23:06:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:06:17,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:17,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:17,727 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:17,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:17,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1626799533, now seen corresponding path program 1 times [2018-11-28 23:06:17,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:17,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:17,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:17,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:17,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:17,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:17,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:17,819 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2018-11-28 23:06:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:17,955 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-28 23:06:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:06:17,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-28 23:06:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:17,957 INFO L225 Difference]: With dead ends: 26 [2018-11-28 23:06:17,957 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 23:06:17,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 23:06:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-28 23:06:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:06:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-28 23:06:17,964 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2018-11-28 23:06:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:17,965 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-28 23:06:17,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-28 23:06:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 23:06:17,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:17,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:17,966 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:17,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1108821980, now seen corresponding path program 1 times [2018-11-28 23:06:17,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:17,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:17,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:17,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:17,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:18,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:18,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:18,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:18,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:18,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:18,027 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-11-28 23:06:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:18,185 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-28 23:06:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:18,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 23:06:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:18,187 INFO L225 Difference]: With dead ends: 24 [2018-11-28 23:06:18,187 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 23:06:18,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 23:06:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-28 23:06:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:06:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-28 23:06:18,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 9 [2018-11-28 23:06:18,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:18,193 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-28 23:06:18,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-28 23:06:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:06:18,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:18,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:18,194 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:18,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:18,194 INFO L82 PathProgramCache]: Analyzing trace with hash -13742961, now seen corresponding path program 1 times [2018-11-28 23:06:18,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:18,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:18,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:18,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:18,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:18,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:18,234 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 3 states. [2018-11-28 23:06:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:18,446 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-28 23:06:18,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:18,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 23:06:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:18,448 INFO L225 Difference]: With dead ends: 24 [2018-11-28 23:06:18,448 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 23:06:18,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 23:06:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 23:06:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:06:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-28 23:06:18,458 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2018-11-28 23:06:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:18,459 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-28 23:06:18,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-28 23:06:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 23:06:18,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:18,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:18,461 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:18,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:18,461 INFO L82 PathProgramCache]: Analyzing trace with hash -426031738, now seen corresponding path program 1 times [2018-11-28 23:06:18,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:18,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:18,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:18,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:18,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:18,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:18,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:18,534 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 3 states. [2018-11-28 23:06:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:18,588 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-28 23:06:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:18,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 23:06:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:18,589 INFO L225 Difference]: With dead ends: 26 [2018-11-28 23:06:18,589 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 23:06:18,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 23:06:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-28 23:06:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:06:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-28 23:06:18,594 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2018-11-28 23:06:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:18,594 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-28 23:06:18,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-28 23:06:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:06:18,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:18,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:18,595 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:18,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash -322081935, now seen corresponding path program 1 times [2018-11-28 23:06:18,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:18,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:18,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:18,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:18,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:18,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:18,635 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 3 states. [2018-11-28 23:06:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:18,674 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-28 23:06:18,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:18,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 23:06:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:18,677 INFO L225 Difference]: With dead ends: 26 [2018-11-28 23:06:18,677 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 23:06:18,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 23:06:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 23:06:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:06:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-28 23:06:18,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 12 [2018-11-28 23:06:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:18,683 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-28 23:06:18,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-28 23:06:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 23:06:18,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:18,684 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:18,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:18,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:18,685 INFO L82 PathProgramCache]: Analyzing trace with hash -283092845, now seen corresponding path program 1 times [2018-11-28 23:06:18,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:18,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:18,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:18,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:18,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:18,773 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 [2018-11-28 23:06:18,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:18,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:19,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-11-28 23:06:19,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:06:19,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:06:19,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:19,078 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 9 states. [2018-11-28 23:06:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:19,361 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-28 23:06:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:06:19,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-11-28 23:06:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:19,366 INFO L225 Difference]: With dead ends: 34 [2018-11-28 23:06:19,366 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 23:06:19,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:06:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 23:06:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-28 23:06:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:06:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-28 23:06:19,379 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2018-11-28 23:06:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:19,380 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-28 23:06:19,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:06:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-28 23:06:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 23:06:19,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:19,382 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:19,383 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:19,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:19,383 INFO L82 PathProgramCache]: Analyzing trace with hash -185943556, now seen corresponding path program 1 times [2018-11-28 23:06:19,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:19,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:19,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:19,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:19,673 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 [2018-11-28 23:06:19,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:19,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:19,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-28 23:06:19,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:06:19,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:06:19,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:06:19,889 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-11-28 23:06:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,020 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-28 23:06:20,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:06:20,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-28 23:06:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,023 INFO L225 Difference]: With dead ends: 33 [2018-11-28 23:06:20,024 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 23:06:20,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 23:06:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-28 23:06:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:06:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-28 23:06:20,029 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2018-11-28 23:06:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,029 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-28 23:06:20,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:06:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-28 23:06:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 23:06:20,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,030 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,031 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1469282891, now seen corresponding path program 1 times [2018-11-28 23:06:20,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:20,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:20,105 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 [2018-11-28 23:06:20,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:20,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:20,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 23:06:20,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:20,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:20,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:20,173 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 5 states. [2018-11-28 23:06:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,326 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-28 23:06:20,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:06:20,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-28 23:06:20,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,329 INFO L225 Difference]: With dead ends: 28 [2018-11-28 23:06:20,329 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 23:06:20,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:06:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 23:06:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 23:06:20,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:06:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-28 23:06:20,334 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 16 [2018-11-28 23:06:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,335 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-28 23:06:20,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-28 23:06:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 23:06:20,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,336 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,336 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1696870686, now seen corresponding path program 1 times [2018-11-28 23:06:20,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:20,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:20,434 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 [2018-11-28 23:06:20,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:20,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:20,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 23:06:20,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:20,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:20,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:20,488 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2018-11-28 23:06:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,686 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-28 23:06:20,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:06:20,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 23:06:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,689 INFO L225 Difference]: With dead ends: 39 [2018-11-28 23:06:20,689 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 23:06:20,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:06:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 23:06:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-28 23:06:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 23:06:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 23:06:20,696 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2018-11-28 23:06:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,696 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 23:06:20,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 23:06:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 23:06:20,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,697 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,698 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1063383767, now seen corresponding path program 1 times [2018-11-28 23:06:20,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:20,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:20,750 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 [2018-11-28 23:06:20,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:20,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:20,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-28 23:06:20,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:20,821 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2018-11-28 23:06:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,967 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-28 23:06:20,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:20,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-28 23:06:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,972 INFO L225 Difference]: With dead ends: 34 [2018-11-28 23:06:20,972 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 23:06:20,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 23:06:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-28 23:06:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:06:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-28 23:06:20,977 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2018-11-28 23:06:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,978 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-28 23:06:20,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-28 23:06:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:06:20,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,979 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,979 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,980 INFO L82 PathProgramCache]: Analyzing trace with hash -412918366, now seen corresponding path program 2 times [2018-11-28 23:06:20,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:21,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:21,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-11-28 23:06:21,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:21,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:21,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:21,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:21,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-28 23:06:21,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 23:06:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:06:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:06:21,373 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 14 states. [2018-11-28 23:06:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:21,762 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-28 23:06:21,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:06:21,768 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-28 23:06:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:21,769 INFO L225 Difference]: With dead ends: 57 [2018-11-28 23:06:21,769 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 23:06:21,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-11-28 23:06:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 23:06:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-28 23:06:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 23:06:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-28 23:06:21,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2018-11-28 23:06:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:21,777 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-28 23:06:21,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 23:06:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-28 23:06:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 23:06:21,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:21,778 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:21,778 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:21,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash 84432589, now seen corresponding path program 2 times [2018-11-28 23:06:21,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:21,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:06:21,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:21,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-11-28 23:06:21,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:21,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:21,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:21,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:06:21,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:21,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:06:21,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:06:21,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:06:21,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:06:21,938 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 7 states. [2018-11-28 23:06:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:22,009 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-28 23:06:22,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:06:22,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 23:06:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:22,012 INFO L225 Difference]: With dead ends: 52 [2018-11-28 23:06:22,012 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 23:06:22,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:06:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 23:06:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-28 23:06:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 23:06:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-28 23:06:22,020 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 22 [2018-11-28 23:06:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:22,021 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-28 23:06:22,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:06:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-28 23:06:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 23:06:22,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:22,024 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:22,024 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:22,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -464659025, now seen corresponding path program 2 times [2018-11-28 23:06:22,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:22,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:22,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:22,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:06:22,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:22,105 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 [2018-11-28 23:06:22,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:22,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:22,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:22,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:22,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:22,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2018-11-28 23:06:22,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:06:22,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:06:22,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:06:22,227 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 10 states. [2018-11-28 23:06:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:22,352 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-28 23:06:22,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:06:22,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 23:06:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:22,353 INFO L225 Difference]: With dead ends: 51 [2018-11-28 23:06:22,354 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 23:06:22,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:06:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 23:06:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-11-28 23:06:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 23:06:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-28 23:06:22,359 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 24 [2018-11-28 23:06:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:22,360 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-28 23:06:22,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:06:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-28 23:06:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 23:06:22,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:22,361 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:22,362 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:22,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash -606346541, now seen corresponding path program 3 times [2018-11-28 23:06:22,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:22,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-28 23:06:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:22,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 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 [2018-11-28 23:06:22,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:06:22,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 23:06:22,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:22,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 23:06:22,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:22,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-11-28 23:06:22,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 23:06:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 23:06:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:06:22,792 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 16 states. [2018-11-28 23:06:22,976 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-11-28 23:06:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:23,254 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-28 23:06:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:06:23,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-28 23:06:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:23,263 INFO L225 Difference]: With dead ends: 43 [2018-11-28 23:06:23,263 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:06:23,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-11-28 23:06:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:06:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:06:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:06:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:06:23,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-11-28 23:06:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:23,267 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:06:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 23:06:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:06:23,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:06:23,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:06:23,419 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:06:23,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:06:23,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:06:23,420 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:06:23,420 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:06:23,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:06:23,420 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-28 23:06:23,420 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 16 28) no Hoare annotation was computed. [2018-11-28 23:06:23,420 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-28 23:06:23,420 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-28 23:06:23,421 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-28 23:06:23,421 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-11-28 23:06:23,421 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-28 23:06:23,421 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-11-28 23:06:23,421 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 16 28) no Hoare annotation was computed. [2018-11-28 23:06:23,421 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-11-28 23:06:23,421 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 16 28) the Hoare annotation is: true [2018-11-28 23:06:23,421 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-28 23:06:23,421 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-11-28 23:06:23,423 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-28 23:06:23,423 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 26) the Hoare annotation is: (or (and (<= main_~y~0 (+ main_~z~0 99)) (<= main_~x~0 2147483647) (<= main_~z~0 1) (<= 100 main_~y~0)) (let ((.cse0 (+ main_~z~0 100))) (and (<= .cse0 main_~y~0) (<= main_~y~0 100) (<= main_~x~0 (+ main_~y~0 2147483448)) (<= 99 main_~y~0) (<= main_~y~0 .cse0)))) [2018-11-28 23:06:23,423 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 26) no Hoare annotation was computed. [2018-11-28 23:06:23,423 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-11-28 23:06:23,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:06:23 BoogieIcfgContainer [2018-11-28 23:06:23,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:06:23,439 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:06:23,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:06:23,440 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:06:23,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:17" (3/4) ... [2018-11-28 23:06:23,445 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:06:23,452 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:06:23,452 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:06:23,457 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 23:06:23,457 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 23:06:23,457 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:06:23,502 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:06:23,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:06:23,503 INFO L168 Benchmark]: Toolchain (without parser) took 7007.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:23,504 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. [2018-11-28 23:06:23,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 937.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:23,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.14 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:23,506 INFO L168 Benchmark]: Boogie Preprocessor took 29.22 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:23,506 INFO L168 Benchmark]: RCFGBuilder took 440.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:23,507 INFO L168 Benchmark]: TraceAbstraction took 6200.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:23,508 INFO L168 Benchmark]: Witness Printer took 63.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:23,512 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.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 937.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.14 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.22 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 440.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6200.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. * Witness Printer took 63.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((y <= z + 99 && x <= 2147483647) && z <= 1) && 100 <= y) || ((((z + 100 <= y && y <= 100) && x <= y + 2147483448) && 99 <= y) && y <= z + 100) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 6 error locations. SAFE Result, 6.0s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 185 SDslu, 264 SDs, 0 SdLazy, 548 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=12, 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.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 32 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 42 HoareAnnotationTreeSize, 5 FomulaSimplifications, 213 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 110 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 41678 SizeOfPredicates, 7 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 58/282 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...