./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 32bit --witnessprinter.graph.data.programhash 1b503f9744330c40db60063d7713649b00b515fae7df517a0a6da071e866822e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:25:57,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:25:57,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:25:57,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:25:57,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:25:57,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:25:57,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:25:57,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:25:57,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:25:57,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:25:57,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:25:57,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:25:57,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:25:57,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:25:57,337 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:25:57,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:25:57,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:25:57,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:25:57,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:25:57,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:25:57,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:25:57,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:25:57,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:25:57,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:25:57,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:25:57,344 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:25:57,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:25:57,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:25:57,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:25:57,345 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:25:57,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:25:57,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:25:57,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:25:57,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:25:57,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:25:57,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:25:57,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:25:57,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:25:57,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:25:57,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:25:57,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:25:57,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:25:57,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:25:57,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:25:57,350 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b503f9744330c40db60063d7713649b00b515fae7df517a0a6da071e866822e [2024-10-14 20:25:57,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:25:57,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:25:57,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:25:57,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:25:57,634 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:25:57,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2024-10-14 20:25:59,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:25:59,306 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:25:59,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2024-10-14 20:25:59,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff6f11e1c/876bc5419a724a4f94ca80eaf82a80c4/FLAG8aa05c06d [2024-10-14 20:25:59,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff6f11e1c/876bc5419a724a4f94ca80eaf82a80c4 [2024-10-14 20:25:59,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:25:59,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:25:59,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:25:59,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:25:59,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:25:59,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5295adb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59, skipping insertion in model container [2024-10-14 20:25:59,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:25:59,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:25:59,538 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:25:59,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:25:59,564 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:25:59,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59 WrapperNode [2024-10-14 20:25:59,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:25:59,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:25:59,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:25:59,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:25:59,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,599 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2024-10-14 20:25:59,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:25:59,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:25:59,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:25:59,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:25:59,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,644 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 20:25:59,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:25:59,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:25:59,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:25:59,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:25:59,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (1/1) ... [2024-10-14 20:25:59,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:25:59,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:25:59,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:25:59,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:25:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:25:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:25:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:25:59,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:25:59,801 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:25:59,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:25:59,939 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 20:25:59,943 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:25:59,974 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:25:59,974 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:25:59,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:25:59 BoogieIcfgContainer [2024-10-14 20:25:59,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:25:59,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:25:59,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:25:59,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:25:59,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:25:59" (1/3) ... [2024-10-14 20:25:59,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57699f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:25:59, skipping insertion in model container [2024-10-14 20:25:59,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:25:59" (2/3) ... [2024-10-14 20:25:59,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57699f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:25:59, skipping insertion in model container [2024-10-14 20:25:59,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:25:59" (3/3) ... [2024-10-14 20:25:59,984 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark01_conjunctive.i [2024-10-14 20:26:00,001 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:26:00,001 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 20:26:00,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:26:00,074 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5be835a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:26:00,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 20:26:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:26:00,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:26:00,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:26:00,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 20:26:00,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:26:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash 68561168, now seen corresponding path program 1 times [2024-10-14 20:26:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:26:00,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257227669] [2024-10-14 20:26:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:26:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:26:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:26:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:00,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:26:00,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257227669] [2024-10-14 20:26:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257227669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:26:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:26:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:26:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917154653] [2024-10-14 20:26:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:26:00,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:26:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:26:00,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:26:00,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:26:00,326 INFO L87 Difference]: Start difference. First operand has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:26:00,353 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-10-14 20:26:00,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:26:00,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 20:26:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:26:00,362 INFO L225 Difference]: With dead ends: 21 [2024-10-14 20:26:00,362 INFO L226 Difference]: Without dead ends: 7 [2024-10-14 20:26:00,364 INFO L431 NwaCegarLoop]: 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 [2024-10-14 20:26:00,368 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:26:00,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:26:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-10-14 20:26:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-14 20:26:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-10-14 20:26:00,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-10-14 20:26:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:26:00,391 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-10-14 20:26:00,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-10-14 20:26:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 20:26:00,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:26:00,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 20:26:00,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:26:00,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 20:26:00,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:26:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2125396259, now seen corresponding path program 1 times [2024-10-14 20:26:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:26:00,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566961724] [2024-10-14 20:26:00,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:26:00,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:26:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:26:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:26:00,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566961724] [2024-10-14 20:26:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566961724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:26:00,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:26:00,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:26:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591963735] [2024-10-14 20:26:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:26:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:26:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:26:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:26:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:26:00,454 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:26:00,479 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-10-14 20:26:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:26:00,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 20:26:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:26:00,480 INFO L225 Difference]: With dead ends: 12 [2024-10-14 20:26:00,482 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 20:26:00,482 INFO L431 NwaCegarLoop]: 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 [2024-10-14 20:26:00,483 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:26:00,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:26:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 20:26:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 20:26:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 20:26:00,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2024-10-14 20:26:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:26:00,491 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 20:26:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 20:26:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:26:00,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:26:00,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-10-14 20:26:00,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:26:00,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 20:26:00,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:26:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash 780893642, now seen corresponding path program 1 times [2024-10-14 20:26:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:26:00,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863817656] [2024-10-14 20:26:00,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:26:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:26:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:26:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:00,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:26:00,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863817656] [2024-10-14 20:26:00,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863817656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:26:00,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665247507] [2024-10-14 20:26:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:26:00,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:26:00,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:26:00,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:26:00,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 20:26:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:26:00,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:26:00,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:26:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:00,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:26:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:00,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665247507] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:26:00,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:26:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-10-14 20:26:00,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919772149] [2024-10-14 20:26:00,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:26:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 20:26:00,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:26:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 20:26:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:26:00,903 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:26:00,959 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-10-14 20:26:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:26:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:26:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:26:00,961 INFO L225 Difference]: With dead ends: 24 [2024-10-14 20:26:00,961 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 20:26:00,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:26:00,962 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:26:00,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:26:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 20:26:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-14 20:26:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-10-14 20:26:00,975 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2024-10-14 20:26:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:26:00,976 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-10-14 20:26:00,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-10-14 20:26:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:26:00,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:26:00,977 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1] [2024-10-14 20:26:00,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:26:01,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:26:01,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 20:26:01,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:26:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash -534509889, now seen corresponding path program 2 times [2024-10-14 20:26:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:26:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503524820] [2024-10-14 20:26:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:26:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:26:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:26:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:26:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503524820] [2024-10-14 20:26:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503524820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:26:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707546223] [2024-10-14 20:26:01,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:26:01,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:26:01,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:26:01,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:26:01,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 20:26:01,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:26:01,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:26:01,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 20:26:01,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:26:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:01,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:26:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:01,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707546223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:26:01,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:26:01,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-10-14 20:26:01,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072498807] [2024-10-14 20:26:01,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:26:01,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 20:26:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:26:01,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 20:26:01,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2024-10-14 20:26:01,925 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:26:01,993 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-10-14 20:26:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 20:26:01,994 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-14 20:26:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:26:01,995 INFO L225 Difference]: With dead ends: 48 [2024-10-14 20:26:01,996 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 20:26:01,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=175, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:26:01,998 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:26:01,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:26:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 20:26:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 20:26:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2024-10-14 20:26:02,008 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 22 [2024-10-14 20:26:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:26:02,009 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2024-10-14 20:26:02,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2024-10-14 20:26:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 20:26:02,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:26:02,010 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 1, 1, 1] [2024-10-14 20:26:02,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:26:02,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 20:26:02,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 20:26:02,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:26:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1632633385, now seen corresponding path program 3 times [2024-10-14 20:26:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:26:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074117622] [2024-10-14 20:26:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:26:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:26:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:26:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:02,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:26:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074117622] [2024-10-14 20:26:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074117622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:26:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027693285] [2024-10-14 20:26:02,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:26:02,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:26:02,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:26:02,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:26:02,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:26:02,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 20:26:02,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:26:02,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 20:26:02,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:26:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:03,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:26:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:03,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027693285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:26:03,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:26:03,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-10-14 20:26:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633509160] [2024-10-14 20:26:03,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:26:03,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 20:26:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:26:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 20:26:03,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=680, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 20:26:03,611 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 35 states, 34 states have (on average 4.0) internal successors, (136), 35 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:26:03,729 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2024-10-14 20:26:03,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 20:26:03,730 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.0) internal successors, (136), 35 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-14 20:26:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:26:03,731 INFO L225 Difference]: With dead ends: 96 [2024-10-14 20:26:03,731 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 20:26:03,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=545, Invalid=715, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 20:26:03,733 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:26:03,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:26:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 20:26:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 20:26:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2024-10-14 20:26:03,748 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 46 [2024-10-14 20:26:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:26:03,749 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2024-10-14 20:26:03,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.0) internal successors, (136), 35 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2024-10-14 20:26:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 20:26:03,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:26:03,752 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 1, 1, 1] [2024-10-14 20:26:03,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:26:03,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:26:03,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 20:26:03,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:26:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 18783997, now seen corresponding path program 4 times [2024-10-14 20:26:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:26:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251012246] [2024-10-14 20:26:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:26:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:26:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:26:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:05,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:26:05,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251012246] [2024-10-14 20:26:05,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251012246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:26:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772721831] [2024-10-14 20:26:05,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 20:26:05,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:26:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:26:05,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:26:05,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:26:05,394 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 20:26:05,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:26:05,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-14 20:26:05,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:26:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:06,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:26:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:26:07,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772721831] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:26:07,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:26:07,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2024-10-14 20:26:07,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966092862] [2024-10-14 20:26:07,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:26:07,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-14 20:26:07,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:26:07,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-14 20:26:07,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=3044, Unknown=0, NotChecked=0, Total=4970 [2024-10-14 20:26:07,773 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand has 71 states, 70 states have (on average 4.0) internal successors, (280), 71 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:26:07,942 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2024-10-14 20:26:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 20:26:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 4.0) internal successors, (280), 71 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-14 20:26:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:26:07,947 INFO L225 Difference]: With dead ends: 128 [2024-10-14 20:26:07,947 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 20:26:07,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1997, Invalid=3115, Unknown=0, NotChecked=0, Total=5112 [2024-10-14 20:26:07,951 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:26:07,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:26:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 20:26:07,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-14 20:26:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2024-10-14 20:26:07,963 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 94 [2024-10-14 20:26:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:26:07,964 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2024-10-14 20:26:07,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 4.0) internal successors, (280), 71 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:26:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2024-10-14 20:26:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 20:26:07,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:26:07,969 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 30, 1, 1, 1] [2024-10-14 20:26:07,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:26:08,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:26:08,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 20:26:08,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:26:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1145824715, now seen corresponding path program 5 times [2024-10-14 20:26:08,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:26:08,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841008338] [2024-10-14 20:26:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:26:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:26:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:26:08,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 20:26:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:26:08,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 20:26:08,373 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 20:26:08,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-14 20:26:08,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-14 20:26:08,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:26:08,379 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-10-14 20:26:08,432 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:26:08,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:26:08 BoogieIcfgContainer [2024-10-14 20:26:08,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:26:08,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:26:08,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:26:08,439 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:26:08,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:25:59" (3/4) ... [2024-10-14 20:26:08,440 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 20:26:08,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:26:08,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:26:08,505 INFO L158 Benchmark]: Toolchain (without parser) took 9166.24ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 111.1MB in the beginning and 212.6MB in the end (delta: -101.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:26:08,505 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 109.1MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:26:08,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.87ms. Allocated memory is still 178.3MB. Free memory was 110.8MB in the beginning and 100.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:26:08,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.72ms. Allocated memory is still 178.3MB. Free memory was 99.8MB in the beginning and 98.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:26:08,506 INFO L158 Benchmark]: Boogie Preprocessor took 59.74ms. Allocated memory is still 178.3MB. Free memory was 98.4MB in the beginning and 152.4MB in the end (delta: -54.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-14 20:26:08,507 INFO L158 Benchmark]: RCFGBuilder took 314.87ms. Allocated memory is still 178.3MB. Free memory was 152.4MB in the beginning and 141.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:26:08,507 INFO L158 Benchmark]: TraceAbstraction took 8460.26ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 140.8MB in the beginning and 216.8MB in the end (delta: -76.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-14 20:26:08,507 INFO L158 Benchmark]: Witness Printer took 66.35ms. Allocated memory is still 270.5MB. Free memory was 215.7MB in the beginning and 212.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:26:08,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 109.1MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.87ms. Allocated memory is still 178.3MB. Free memory was 110.8MB in the beginning and 100.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.72ms. Allocated memory is still 178.3MB. Free memory was 99.8MB in the beginning and 98.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.74ms. Allocated memory is still 178.3MB. Free memory was 98.4MB in the beginning and 152.4MB in the end (delta: -54.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 314.87ms. Allocated memory is still 178.3MB. Free memory was 152.4MB in the beginning and 141.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8460.26ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 140.8MB in the beginning and 216.8MB in the end (delta: -76.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 66.35ms. Allocated memory is still 270.5MB. Free memory was 215.7MB in the beginning and 212.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L20] int x = __VERIFIER_nondet_int(); [L21] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(x==1 && y==1)) VAL [x=1, y=1] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2, y=2] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4, y=4] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8, y=8] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16, y=16] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=32, y=32] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=64, y=64] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=128, y=128] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=256, y=256] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=512, y=512] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1024, y=1024] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2048, y=2048] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4096, y=4096] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8192, y=8192] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16384, y=16384] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=32768, y=32768] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=65536, y=65536] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=131072, y=131072] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=262144, y=262144] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=524288, y=524288] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1048576, y=1048576] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2097152, y=2097152] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4194304, y=4194304] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8388608, y=8388608] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16777216, y=16777216] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=33554432, y=33554432] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=67108864, y=67108864] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=134217728, y=134217728] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=268435456, y=268435456] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=536870912, y=536870912] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1073741824, y=1073741824] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] x+y - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 7, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 28 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=6, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 513 ConstructedInterpolants, 0 QuantifiedInterpolants, 3133 SizeOfPredicates, 8 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3828 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 20:26:08,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)