./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3428809e66c8ffa9373e37ec3d02a46642c7f8bc ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:36:23,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:36:23,179 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:36:23,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:36:23,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:36:23,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:36:23,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:36:23,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:36:23,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:36:23,203 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:36:23,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:36:23,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:36:23,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:36:23,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:36:23,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:36:23,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:36:23,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:36:23,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:36:23,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:36:23,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:36:23,233 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:36:23,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:36:23,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:36:23,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:36:23,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:36:23,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:36:23,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:36:23,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:36:23,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:36:23,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:36:23,253 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:36:23,255 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:36:23,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:36:23,256 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:36:23,257 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:36:23,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:36:23,260 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:36:23,294 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:36:23,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:36:23,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:36:23,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:36:23,297 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:36:23,297 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:36:23,297 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:36:23,297 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:36:23,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:36:23,298 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:36:23,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:36:23,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:36:23,302 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:36:23,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:36:23,302 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:36:23,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:36:23,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:36:23,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:36:23,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:36:23,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:36:23,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:36:23,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:36:23,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:36:23,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:36:23,305 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:36:23,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:36:23,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:36:23,308 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 -> 3428809e66c8ffa9373e37ec3d02a46642c7f8bc [2019-01-01 20:36:23,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:36:23,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:36:23,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:36:23,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:36:23,391 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:36:23,392 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2019-01-01 20:36:23,456 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4b14c6b/079a108d50fa403897414857e303be04/FLAGb627263af [2019-01-01 20:36:23,908 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:36:23,909 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2019-01-01 20:36:23,916 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4b14c6b/079a108d50fa403897414857e303be04/FLAGb627263af [2019-01-01 20:36:24,281 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4b14c6b/079a108d50fa403897414857e303be04 [2019-01-01 20:36:24,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:36:24,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:36:24,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:36:24,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:36:24,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:36:24,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1500d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24, skipping insertion in model container [2019-01-01 20:36:24,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:36:24,322 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:36:24,490 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:36:24,495 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:36:24,520 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:36:24,543 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:36:24,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24 WrapperNode [2019-01-01 20:36:24,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:36:24,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:36:24,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:36:24,546 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:36:24,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:36:24,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:36:24,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:36:24,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:36:24,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... [2019-01-01 20:36:24,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:36:24,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:36:24,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:36:24,620 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:36:24,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 20:36:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:36:24,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 20:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 20:36:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 20:36:25,214 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:36:25,215 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 20:36:25,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:36:25 BoogieIcfgContainer [2019-01-01 20:36:25,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:36:25,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:36:25,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:36:25,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:36:25,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:36:24" (1/3) ... [2019-01-01 20:36:25,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7623e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:36:25, skipping insertion in model container [2019-01-01 20:36:25,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:36:24" (2/3) ... [2019-01-01 20:36:25,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7623e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:36:25, skipping insertion in model container [2019-01-01 20:36:25,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:36:25" (3/3) ... [2019-01-01 20:36:25,226 INFO L112 eAbstractionObserver]: Analyzing ICFG HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2019-01-01 20:36:25,236 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:36:25,245 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 20:36:25,263 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 20:36:25,300 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:36:25,301 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:36:25,301 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:36:25,301 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:36:25,301 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:36:25,302 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:36:25,302 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:36:25,302 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:36:25,302 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:36:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-01-01 20:36:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:36:25,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:25,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:36:25,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:25,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash 889574220, now seen corresponding path program 1 times [2019-01-01 20:36:25,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:25,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:25,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:25,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:36:25,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:25,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:36:25,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:36:25,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:36:25,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:36:25,558 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-01-01 20:36:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:25,689 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-01-01 20:36:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:36:25,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-01 20:36:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:25,701 INFO L225 Difference]: With dead ends: 60 [2019-01-01 20:36:25,701 INFO L226 Difference]: Without dead ends: 35 [2019-01-01 20:36:25,704 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 [2019-01-01 20:36:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-01 20:36:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2019-01-01 20:36:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 20:36:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-01 20:36:25,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 6 [2019-01-01 20:36:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:25,741 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-01 20:36:25,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:36:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-01 20:36:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 20:36:25,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:25,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:25,743 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash 180741427, now seen corresponding path program 1 times [2019-01-01 20:36:25,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:25,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:25,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:25,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:25,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:36:25,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:25,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:36:25,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:36:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:36:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:36:25,846 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2019-01-01 20:36:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:25,911 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-01-01 20:36:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:36:25,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-01 20:36:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:25,915 INFO L225 Difference]: With dead ends: 35 [2019-01-01 20:36:25,915 INFO L226 Difference]: Without dead ends: 24 [2019-01-01 20:36:25,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:36:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-01 20:36:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-01 20:36:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 20:36:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-01 20:36:25,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2019-01-01 20:36:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:25,920 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-01 20:36:25,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:36:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-01 20:36:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:36:25,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:25,921 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:25,922 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash -869586168, now seen corresponding path program 1 times [2019-01-01 20:36:25,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:25,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:25,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:36:26,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:36:26,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:36:26,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:26,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:36:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:36:26,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:36:26,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-01 20:36:26,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:36:26,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:36:26,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:36:26,346 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2019-01-01 20:36:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:26,564 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-01 20:36:26,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:36:26,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-01 20:36:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:26,566 INFO L225 Difference]: With dead ends: 41 [2019-01-01 20:36:26,566 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 20:36:26,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:36:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 20:36:26,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-01-01 20:36:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 20:36:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-01 20:36:26,573 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2019-01-01 20:36:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:26,574 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-01 20:36:26,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:36:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-01 20:36:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 20:36:26,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:26,575 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:36:26,575 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:26,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1187367381, now seen corresponding path program 1 times [2019-01-01 20:36:26,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:26,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:26,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:26,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:36:26,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:36:26,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:36:26,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:26,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:36:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:36:26,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:36:26,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-01-01 20:36:26,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:36:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:36:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:36:26,940 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2019-01-01 20:36:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:27,070 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-01-01 20:36:27,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:36:27,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-01-01 20:36:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:27,075 INFO L225 Difference]: With dead ends: 27 [2019-01-01 20:36:27,075 INFO L226 Difference]: Without dead ends: 26 [2019-01-01 20:36:27,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:36:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-01 20:36:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-01 20:36:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 20:36:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 20:36:27,080 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2019-01-01 20:36:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:27,081 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 20:36:27,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:36:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-01 20:36:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 20:36:27,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:27,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:27,082 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:27,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1844723183, now seen corresponding path program 1 times [2019-01-01 20:36:27,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:27,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:27,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:36:27,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:36:27,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:36:27,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:27,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:36:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:36:27,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:36:27,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2019-01-01 20:36:27,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:36:27,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:36:27,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:36:27,478 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2019-01-01 20:36:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:27,909 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-01-01 20:36:27,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:36:27,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-01-01 20:36:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:27,910 INFO L225 Difference]: With dead ends: 48 [2019-01-01 20:36:27,912 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 20:36:27,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:36:27,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 20:36:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-01-01 20:36:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 20:36:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-01 20:36:27,918 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 12 [2019-01-01 20:36:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:27,919 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-01 20:36:27,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:36:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-01 20:36:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 20:36:27,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:27,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:27,920 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:27,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1351843898, now seen corresponding path program 1 times [2019-01-01 20:36:27,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:27,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:27,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:27,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:27,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:36:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:36:28,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:36:28,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:36:28,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:36:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:36:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:36:28,011 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2019-01-01 20:36:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:36:28,110 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-01-01 20:36:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:36:28,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-01 20:36:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:36:28,113 INFO L225 Difference]: With dead ends: 48 [2019-01-01 20:36:28,113 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 20:36:28,114 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-01 20:36:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 20:36:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-01 20:36:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 20:36:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-01-01 20:36:28,120 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 13 [2019-01-01 20:36:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:36:28,120 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-01-01 20:36:28,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:36:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-01-01 20:36:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:36:28,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:36:28,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:36:28,122 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:36:28,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:36:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1042512047, now seen corresponding path program 1 times [2019-01-01 20:36:28,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:36:28,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:36:28,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:28,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:36:28,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:36:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:36:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 20:36:28,183 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 20:36:28,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:36:28 BoogieIcfgContainer [2019-01-01 20:36:28,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:36:28,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:36:28,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:36:28,214 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:36:28,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:36:25" (3/4) ... [2019-01-01 20:36:28,217 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 20:36:28,266 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:36:28,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:36:28,267 INFO L168 Benchmark]: Toolchain (without parser) took 3982.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 951.4 MB in the beginning and 963.5 MB in the end (delta: -12.1 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:28,269 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:36:28,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.96 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:28,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.64 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-01 20:36:28,270 INFO L168 Benchmark]: Boogie Preprocessor took 29.73 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:28,271 INFO L168 Benchmark]: RCFGBuilder took 596.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:28,272 INFO L168 Benchmark]: TraceAbstraction took 2997.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 129.0 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:28,273 INFO L168 Benchmark]: Witness Printer took 51.90 ms. Allocated memory is still 1.2 GB. Free memory was 970.4 MB in the beginning and 963.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:36:28,282 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.96 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.64 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 29.73 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 596.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2997.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 129.0 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. * Witness Printer took 51.90 ms. Allocated memory is still 1.2 GB. Free memory was 970.4 MB in the beginning and 963.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: integer overflow possible integer overflow possible We found a FailurePath: [L12] int a_length = __VERIFIER_nondet_int(); [L13] COND FALSE !(a_length < 1) [L16] int a[a_length]; [L17] int j = 0; [L17] COND TRUE j < a_length [L18] a[j] = __VERIFIER_nondet_int() [L17] j++ [L17] COND FALSE !(j < a_length) [L20] int offset = 1; [L21] int i = 0; [L22] COND TRUE i < a_length [L23] EXPR a[i] [L23] COND FALSE !(a[i] < 0) [L26] EXPR i + offset [L26] EXPR a[i] [L26] i + offset + a[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 6 error locations. UNSAFE Result, 2.9s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 92 SDtfs, 145 SDslu, 183 SDs, 0 SdLazy, 202 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, 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, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 2282 SizeOfPredicates, 4 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 6/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...