./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array10_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d 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/termination-15/array10_alloca.i -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 --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 ee3d17ae6d0b40e558f09e5ca9e74abdfbd39515e0905530f1cfe0f2f95236b7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:10:28,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:10:28,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 13:10:28,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:10:28,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:10:28,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:10:28,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:10:28,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:10:28,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:10:28,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:10:28,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:10:28,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:10:28,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:10:28,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:10:28,111 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:10:28,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:10:28,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:10:28,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:10:28,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:10:28,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:10:28,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:10:28,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:10:28,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:10:28,117 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:10:28,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:10:28,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:10:28,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:10:28,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:10:28,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:10:28,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:10:28,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:10:28,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:10:28,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:10:28,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:10:28,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:10:28,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:10:28,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:10:28,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:10:28,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:10:28,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:10:28,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:10:28,121 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee3d17ae6d0b40e558f09e5ca9e74abdfbd39515e0905530f1cfe0f2f95236b7 [2024-10-13 13:10:28,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:10:28,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:10:28,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:10:28,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:10:28,346 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:10:28,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array10_alloca.i [2024-10-13 13:10:29,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:10:29,864 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:10:29,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array10_alloca.i [2024-10-13 13:10:29,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fa6cbae/2c4e54f7819f4036861f73ff08c03435/FLAGa00f2fb0f [2024-10-13 13:10:29,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fa6cbae/2c4e54f7819f4036861f73ff08c03435 [2024-10-13 13:10:29,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:10:29,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:10:29,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:10:29,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:10:29,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:10:29,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:10:29" (1/1) ... [2024-10-13 13:10:29,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5bb58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:29, skipping insertion in model container [2024-10-13 13:10:29,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:10:29" (1/1) ... [2024-10-13 13:10:29,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:10:30,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:10:30,186 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:10:30,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:10:30,242 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:10:30,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30 WrapperNode [2024-10-13 13:10:30,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:10:30,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:10:30,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:10:30,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:10:30,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,278 INFO L138 Inliner]: procedures = 151, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-10-13 13:10:30,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:10:30,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:10:30,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:10:30,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:10:30,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,305 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-13 13:10:30,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:10:30,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:10:30,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:10:30,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:10:30,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (1/1) ... [2024-10-13 13:10:30,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:10:30,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:10:30,369 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-13 13:10:30,374 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-13 13:10:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 13:10:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 13:10:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 13:10:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 13:10:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:10:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:10:30,462 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:10:30,464 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:10:30,620 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 13:10:30,620 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:10:30,644 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:10:30,648 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:10:30,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:10:30 BoogieIcfgContainer [2024-10-13 13:10:30,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:10:30,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:10:30,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:10:30,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:10:30,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:10:29" (1/3) ... [2024-10-13 13:10:30,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcb7ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:10:30, skipping insertion in model container [2024-10-13 13:10:30,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:10:30" (2/3) ... [2024-10-13 13:10:30,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcb7ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:10:30, skipping insertion in model container [2024-10-13 13:10:30,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:10:30" (3/3) ... [2024-10-13 13:10:30,659 INFO L112 eAbstractionObserver]: Analyzing ICFG array10_alloca.i [2024-10-13 13:10:30,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:10:30,685 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 13:10:30,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:10:30,745 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;@549d03a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:10:30,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 13:10:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.8) internal successors, (27), 21 states have internal predecessors, (27), 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-13 13:10:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 13:10:30,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:10:30,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 13:10:30,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:10:30,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:10:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1742071887, now seen corresponding path program 1 times [2024-10-13 13:10:30,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:10:30,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631886669] [2024-10-13 13:10:30,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:10:30,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:10:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:10:30,921 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-13 13:10:30,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:10:30,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631886669] [2024-10-13 13:10:30,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631886669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:10:30,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:10:30,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:10:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337095740] [2024-10-13 13:10:30,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:10:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:10:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:10:30,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:10:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:10:30,945 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.8) internal successors, (27), 21 states have internal predecessors, (27), 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 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-13 13:10:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:10:30,975 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-10-13 13:10:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:10:30,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-13 13:10:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:10:30,983 INFO L225 Difference]: With dead ends: 40 [2024-10-13 13:10:30,983 INFO L226 Difference]: Without dead ends: 22 [2024-10-13 13:10:30,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:10:30,987 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:10:30,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:10:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-13 13:10:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-13 13:10:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 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-13 13:10:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-13 13:10:31,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2024-10-13 13:10:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:10:31,015 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-13 13:10:31,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-13 13:10:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-13 13:10:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 13:10:31,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:10:31,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:10:31,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:10:31,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:10:31,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:10:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash 905067806, now seen corresponding path program 1 times [2024-10-13 13:10:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:10:31,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840589827] [2024-10-13 13:10:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:10:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:10:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:10:31,115 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-13 13:10:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:10:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840589827] [2024-10-13 13:10:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840589827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:10:31,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:10:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:10:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496403313] [2024-10-13 13:10:31,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:10:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:10:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:10:31,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:10:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:10:31,121 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-13 13:10:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:10:31,147 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-10-13 13:10:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:10:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-10-13 13:10:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:10:31,149 INFO L225 Difference]: With dead ends: 32 [2024-10-13 13:10:31,149 INFO L226 Difference]: Without dead ends: 22 [2024-10-13 13:10:31,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:10:31,151 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:10:31,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:10:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-13 13:10:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-13 13:10:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 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-13 13:10:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-13 13:10:31,159 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2024-10-13 13:10:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:10:31,160 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-13 13:10:31,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-13 13:10:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-13 13:10:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:10:31,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:10:31,160 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:10:31,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:10:31,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:10:31,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:10:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1973689558, now seen corresponding path program 1 times [2024-10-13 13:10:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:10:31,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014325664] [2024-10-13 13:10:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:10:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:10:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:10:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:10:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:10:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014325664] [2024-10-13 13:10:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014325664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:10:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935706078] [2024-10-13 13:10:31,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:10:31,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:10:31,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:10:31,278 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-13 13:10:31,281 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-13 13:10:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:10:31,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:10:31,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:10:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:10:31,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:10:31,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935706078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:10:31,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:10:31,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-13 13:10:31,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14124211] [2024-10-13 13:10:31,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:10:31,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:10:31,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:10:31,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:10:31,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:10:31,366 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-13 13:10:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:10:31,387 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-10-13 13:10:31,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:10:31,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2024-10-13 13:10:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:10:31,388 INFO L225 Difference]: With dead ends: 22 [2024-10-13 13:10:31,388 INFO L226 Difference]: Without dead ends: 21 [2024-10-13 13:10:31,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:10:31,389 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:10:31,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:10:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-13 13:10:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-13 13:10:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 20 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-13 13:10:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-10-13 13:10:31,392 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 9 [2024-10-13 13:10:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:10:31,392 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-13 13:10:31,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-13 13:10:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-10-13 13:10:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:10:31,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:10:31,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 13:10:31,406 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-13 13:10:31,594 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-13 13:10:31,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:10:31,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:10:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1054834096, now seen corresponding path program 1 times [2024-10-13 13:10:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:10:31,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003051824] [2024-10-13 13:10:31,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:10:31,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:10:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:10:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:10:31,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:10:31,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003051824] [2024-10-13 13:10:31,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003051824] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:10:31,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740567778] [2024-10-13 13:10:31,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:10:31,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:10:31,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:10:31,712 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-13 13:10:31,713 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-13 13:10:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:10:31,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:10:31,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:10:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:10:31,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:10:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:10:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740567778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:10:31,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:10:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-10-13 13:10:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651515757] [2024-10-13 13:10:31,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:10:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 13:10:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:10:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 13:10:31,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:10:31,849 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-13 13:10:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:10:31,915 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-10-13 13:10:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 13:10:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-13 13:10:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:10:31,917 INFO L225 Difference]: With dead ends: 60 [2024-10-13 13:10:31,917 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 13:10:31,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-13 13:10:31,918 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:10:31,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 82 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:10:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 13:10:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2024-10-13 13:10:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 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-13 13:10:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-13 13:10:31,922 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2024-10-13 13:10:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:10:31,922 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-13 13:10:31,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-13 13:10:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-13 13:10:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:10:31,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:10:31,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:10:31,943 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-13 13:10:32,127 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-13 13:10:32,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:10:32,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:10:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1658785367, now seen corresponding path program 1 times [2024-10-13 13:10:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:10:32,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624441512] [2024-10-13 13:10:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:10:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:10:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 13:10:32,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 13:10:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 13:10:32,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 13:10:32,157 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 13:10:32,158 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 13:10:32,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 13:10:32,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 13:10:32,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 13:10:32,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 13:10:32,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 13:10:32,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:10:32,164 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 13:10:32,178 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:10:32,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:10:32 BoogieIcfgContainer [2024-10-13 13:10:32,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:10:32,182 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:10:32,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:10:32,182 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:10:32,182 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:10:30" (3/4) ... [2024-10-13 13:10:32,183 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 13:10:32,212 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:10:32,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:10:32,212 INFO L158 Benchmark]: Toolchain (without parser) took 2326.44ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 111.8MB in the end (delta: -15.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:10:32,213 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 128.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:10:32,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.66ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 123.0MB in the end (delta: -26.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:10:32,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:10:32,213 INFO L158 Benchmark]: Boogie Preprocessor took 43.40ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 119.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:10:32,214 INFO L158 Benchmark]: RCFGBuilder took 325.15ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 106.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:10:32,214 INFO L158 Benchmark]: TraceAbstraction took 1531.40ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 113.9MB in the end (delta: -7.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:10:32,214 INFO L158 Benchmark]: Witness Printer took 30.52ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:10:32,215 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.14ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 128.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.66ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 123.0MB in the end (delta: -26.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.40ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 119.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 325.15ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 106.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1531.40ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 113.9MB in the end (delta: -7.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 30.52ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 375]: integer overflow possible integer overflow possible We found a FailurePath: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND TRUE length < 1 [L367] length = 1 VAL [length=1] [L368] int *arr = __builtin_alloca(length*sizeof(int)); VAL [arr={2:0}, length=1] [L369] COND FALSE !(!arr) [L370] i=0 VAL [arr={2:0}, i=0, length=1] [L370] COND TRUE i