./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 835dc6725bef5f7d15ae0e4368f1a97f9d2b8c09 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:41:45,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:41:45,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:41:45,966 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:41:45,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:41:45,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:41:45,970 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:41:45,971 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:41:45,973 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:41:45,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:41:45,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:41:45,975 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:41:45,976 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:41:45,977 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:41:45,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:41:45,980 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:41:45,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:41:45,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:41:45,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:41:45,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:41:45,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:41:45,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:41:45,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:41:45,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:41:45,993 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:41:45,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:41:45,996 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:41:45,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:41:45,997 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:41:45,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:41:45,999 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:41:46,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:41:46,000 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:41:46,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:41:46,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:41:46,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:41:46,003 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:41:46,034 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:41:46,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:41:46,036 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:41:46,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:41:46,038 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:41:46,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:41:46,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:41:46,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:41:46,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:41:46,038 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:41:46,040 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:41:46,040 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:41:46,040 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:41:46,040 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:41:46,040 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:41:46,041 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:41:46,041 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:41:46,041 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:41:46,041 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:41:46,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:41:46,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:41:46,042 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:41:46,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:41:46,044 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:41:46,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:41:46,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:41:46,045 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 -> 835dc6725bef5f7d15ae0e4368f1a97f9d2b8c09 [2019-01-14 21:41:46,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:41:46,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:41:46,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:41:46,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:41:46,124 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:41:46,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-14 21:41:46,182 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df89ec55/250c02db592f48698691964300a314c8/FLAGe39ff7309 [2019-01-14 21:41:46,604 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:41:46,605 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-14 21:41:46,614 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df89ec55/250c02db592f48698691964300a314c8/FLAGe39ff7309 [2019-01-14 21:41:46,942 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df89ec55/250c02db592f48698691964300a314c8 [2019-01-14 21:41:46,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:41:46,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:41:46,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:41:46,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:41:46,951 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:41:46,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:41:46" (1/1) ... [2019-01-14 21:41:46,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f3a513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:46, skipping insertion in model container [2019-01-14 21:41:46,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:41:46" (1/1) ... [2019-01-14 21:41:46,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:41:46,976 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:41:47,145 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:41:47,149 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:41:47,167 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:41:47,183 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:41:47,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47 WrapperNode [2019-01-14 21:41:47,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:41:47,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:41:47,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:41:47,185 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:41:47,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:41:47,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:41:47,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:41:47,234 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:41:47,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... [2019-01-14 21:41:47,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:41:47,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:41:47,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:41:47,258 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:41:47,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:41:47,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:41:47,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:41:47,771 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:41:47,771 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 21:41:47,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:41:47 BoogieIcfgContainer [2019-01-14 21:41:47,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:41:47,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:41:47,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:41:47,777 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:41:47,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:41:46" (1/3) ... [2019-01-14 21:41:47,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f7355a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:41:47, skipping insertion in model container [2019-01-14 21:41:47,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:41:47" (2/3) ... [2019-01-14 21:41:47,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f7355a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:41:47, skipping insertion in model container [2019-01-14 21:41:47,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:41:47" (3/3) ... [2019-01-14 21:41:47,781 INFO L112 eAbstractionObserver]: Analyzing ICFG UrbanMine-ESOP2014-Fig3_true-termination_true-no-overflow.c [2019-01-14 21:41:47,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:41:47,801 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 21:41:47,820 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 21:41:47,850 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:41:47,851 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:41:47,851 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:41:47,851 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:41:47,852 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:41:47,852 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:41:47,852 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:41:47,852 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:41:47,852 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:41:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-14 21:41:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:41:47,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:47,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:41:47,876 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash 29863588, now seen corresponding path program 1 times [2019-01-14 21:41:47,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:47,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:47,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:47,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:47,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:48,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:48,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:41:48,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:41:48,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:41:48,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,054 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-01-14 21:41:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:48,169 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-01-14 21:41:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:41:48,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 21:41:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:48,181 INFO L225 Difference]: With dead ends: 43 [2019-01-14 21:41:48,181 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 21:41:48,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 21:41:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-14 21:41:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 21:41:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-14 21:41:48,217 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 5 [2019-01-14 21:41:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:48,217 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 21:41:48,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:41:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-01-14 21:41:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:41:48,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:48,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:41:48,219 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:48,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash 29863780, now seen corresponding path program 1 times [2019-01-14 21:41:48,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:48,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:48,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:48,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:41:48,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:41:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:41:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,263 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 3 states. [2019-01-14 21:41:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:48,329 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-01-14 21:41:48,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:41:48,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 21:41:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:48,331 INFO L225 Difference]: With dead ends: 28 [2019-01-14 21:41:48,331 INFO L226 Difference]: Without dead ends: 26 [2019-01-14 21:41:48,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-14 21:41:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-14 21:41:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 21:41:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-14 21:41:48,337 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 5 [2019-01-14 21:41:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:48,338 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-14 21:41:48,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:41:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-14 21:41:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:41:48,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:48,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:41:48,339 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash 29879476, now seen corresponding path program 1 times [2019-01-14 21:41:48,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:48,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:48,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:48,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:48,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:48,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:41:48,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:41:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:41:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,386 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 3 states. [2019-01-14 21:41:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:48,422 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-01-14 21:41:48,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:41:48,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 21:41:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:48,424 INFO L225 Difference]: With dead ends: 26 [2019-01-14 21:41:48,424 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 21:41:48,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 21:41:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 21:41:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 21:41:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-01-14 21:41:48,429 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 5 [2019-01-14 21:41:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:48,429 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-14 21:41:48,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:41:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2019-01-14 21:41:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:41:48,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:48,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:41:48,431 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:48,431 INFO L82 PathProgramCache]: Analyzing trace with hash 925771278, now seen corresponding path program 1 times [2019-01-14 21:41:48,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:48,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:48,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:48,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:48,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:48,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:41:48,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:41:48,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:41:48,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,484 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2019-01-14 21:41:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:48,583 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-01-14 21:41:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:41:48,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 21:41:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:48,584 INFO L225 Difference]: With dead ends: 52 [2019-01-14 21:41:48,584 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 21:41:48,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 21:41:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 21:41:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 21:41:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-14 21:41:48,591 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 6 [2019-01-14 21:41:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:48,591 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 21:41:48,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:41:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-01-14 21:41:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:41:48,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:48,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:41:48,593 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:48,593 INFO L82 PathProgramCache]: Analyzing trace with hash 925777236, now seen corresponding path program 1 times [2019-01-14 21:41:48,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:48,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:48,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:48,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:48,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:48,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:41:48,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:41:48,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:41:48,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,664 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 3 states. [2019-01-14 21:41:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:48,805 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-14 21:41:48,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:41:48,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 21:41:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:48,807 INFO L225 Difference]: With dead ends: 29 [2019-01-14 21:41:48,807 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 21:41:48,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 21:41:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-14 21:41:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 21:41:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-01-14 21:41:48,813 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2019-01-14 21:41:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:48,814 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-14 21:41:48,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:41:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-14 21:41:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:41:48,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:48,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:41:48,817 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash 926263822, now seen corresponding path program 1 times [2019-01-14 21:41:48,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:48,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:48,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:48,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:41:48,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:41:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:41:48,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,863 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-01-14 21:41:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:48,936 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-14 21:41:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:41:48,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 21:41:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:48,937 INFO L225 Difference]: With dead ends: 26 [2019-01-14 21:41:48,937 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 21:41:48,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:41:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 21:41:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 21:41:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 21:41:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-01-14 21:41:48,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 6 [2019-01-14 21:41:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:48,943 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-01-14 21:41:48,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:41:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-01-14 21:41:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 21:41:48,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:41:48,944 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:41:48,945 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:41:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:41:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash -248985325, now seen corresponding path program 1 times [2019-01-14 21:41:48,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:41:48,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:41:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:41:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:41:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:41:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:41:49,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:41:49,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:41:49,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:41:49,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:41:49,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:41:49,032 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 4 states. [2019-01-14 21:41:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:41:49,110 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-01-14 21:41:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:41:49,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 21:41:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:41:49,111 INFO L225 Difference]: With dead ends: 50 [2019-01-14 21:41:49,111 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:41:49,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:41:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:41:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:41:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:41:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:41:49,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-14 21:41:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:41:49,114 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:41:49,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:41:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:41:49,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:41:49,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:41:49,182 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:41:49,182 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 32) no Hoare annotation was computed. [2019-01-14 21:41:49,182 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-14 21:41:49,182 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2019-01-14 21:41:49,183 INFO L444 ceAbstractionStarter]: At program point L27-2(lines 18 34) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~x~0 2147483648)) (<= ULTIMATE.start_main_~y~0 2147483647)) [2019-01-14 21:41:49,183 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-14 21:41:49,183 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-14 21:41:49,183 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 21:41:49,183 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 33) no Hoare annotation was computed. [2019-01-14 21:41:49,183 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 21:41:49,184 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 21:41:49,184 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-14 21:41:49,184 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:41:49,184 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-01-14 21:41:49,184 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:41:49,184 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-14 21:41:49,185 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-01-14 21:41:49,185 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-14 21:41:49,185 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-14 21:41:49,185 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2019-01-14 21:41:49,185 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-01-14 21:41:49,185 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 25) no Hoare annotation was computed. [2019-01-14 21:41:49,185 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 34) no Hoare annotation was computed. [2019-01-14 21:41:49,186 INFO L451 ceAbstractionStarter]: At program point L35(lines 13 36) the Hoare annotation is: true [2019-01-14 21:41:49,186 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 21:41:49,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:41:49 BoogieIcfgContainer [2019-01-14 21:41:49,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:41:49,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:41:49,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:41:49,201 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:41:49,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:41:47" (3/4) ... [2019-01-14 21:41:49,207 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:41:49,220 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 21:41:49,220 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:41:49,278 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:41:49,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:41:49,279 INFO L168 Benchmark]: Toolchain (without parser) took 2333.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -100.4 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:49,281 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:41:49,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.96 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:49,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.93 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:41:49,287 INFO L168 Benchmark]: Boogie Preprocessor took 23.61 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:41:49,287 INFO L168 Benchmark]: RCFGBuilder took 515.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:49,288 INFO L168 Benchmark]: TraceAbstraction took 1426.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: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:49,289 INFO L168 Benchmark]: Witness Printer took 77.77 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 21:41:49,302 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.14 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 236.96 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.93 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.61 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 515.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1426.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: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. * Witness Printer took 77.77 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: 6.8 MB). Peak memory consumption was 6.8 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: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (x <= 2147483647 && 0 <= x + 2147483648) && y <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 8 error locations. SAFE Result, 1.3s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 108 SDtfs, 74 SDslu, 30 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=1, 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, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 9 NumberOfFragments, 13 HoareAnnotationTreeSize, 2 FomulaSimplifications, 46 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 25 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...