./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_02_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_02_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c711921b1c30eb9c30b50365263bbeab75ad6f55ea7e7ccf25ab387cd5e70414 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:33:07,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:33:08,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:33:08,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:33:08,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:33:08,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:33:08,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:33:08,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:33:08,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:33:08,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:33:08,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:33:08,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:33:08,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:33:08,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:33:08,041 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:33:08,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:33:08,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:33:08,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:33:08,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:33:08,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:33:08,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:33:08,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:33:08,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:33:08,046 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:33:08,046 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:33:08,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:33:08,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:33:08,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:33:08,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:33:08,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:33:08,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:33:08,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:33:08,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:33:08,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:33:08,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:33:08,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:33:08,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:33:08,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:33:08,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:33:08,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:33:08,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:33:08,051 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-clean/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-clean/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 -> c711921b1c30eb9c30b50365263bbeab75ad6f55ea7e7ccf25ab387cd5e70414 [2024-10-11 22:33:08,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:33:08,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:33:08,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:33:08,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:33:08,355 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:33:08,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_02_good.i [2024-10-11 22:33:09,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:33:10,127 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:33:10,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_02_good.i [2024-10-11 22:33:10,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c8ff19e8b/e9069249482749219a34e27fa45ee41c/FLAGa54733ca8 [2024-10-11 22:33:10,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c8ff19e8b/e9069249482749219a34e27fa45ee41c [2024-10-11 22:33:10,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:33:10,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:33:10,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:33:10,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:33:10,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:33:10,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:33:10" (1/1) ... [2024-10-11 22:33:10,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4422df2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:10, skipping insertion in model container [2024-10-11 22:33:10,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:33:10" (1/1) ... [2024-10-11 22:33:10,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:33:11,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:33:11,242 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:33:11,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:33:11,513 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:33:11,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11 WrapperNode [2024-10-11 22:33:11,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:33:11,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:33:11,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:33:11,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:33:11,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,587 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 217 [2024-10-11 22:33:11,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:33:11,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:33:11,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:33:11,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:33:11,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,618 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:33:11,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:33:11,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:33:11,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:33:11,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:33:11,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (1/1) ... [2024-10-11 22:33:11,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:33:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:33:11,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:33:11,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:33:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:33:11,740 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:33:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:33:11,740 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:33:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:33:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:33:11,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:33:11,898 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:33:11,900 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:33:12,249 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-11 22:33:12,250 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:33:12,282 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:33:12,282 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 22:33:12,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:12 BoogieIcfgContainer [2024-10-11 22:33:12,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:33:12,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:33:12,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:33:12,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:33:12,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:33:10" (1/3) ... [2024-10-11 22:33:12,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15154ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:33:12, skipping insertion in model container [2024-10-11 22:33:12,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:11" (2/3) ... [2024-10-11 22:33:12,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15154ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:33:12, skipping insertion in model container [2024-10-11 22:33:12,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:12" (3/3) ... [2024-10-11 22:33:12,290 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_02_good.i [2024-10-11 22:33:12,301 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:33:12,301 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 22:33:12,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:33:12,359 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;@ebcca26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:33:12,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 22:33:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 80 states have (on average 1.5625) internal successors, (125), 88 states have internal predecessors, (125), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 22:33:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:33:12,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:12,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:12,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:12,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1353455199, now seen corresponding path program 1 times [2024-10-11 22:33:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157248986] [2024-10-11 22:33:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:12,616 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-11 22:33:12,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157248986] [2024-10-11 22:33:12,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157248986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:12,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:33:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076191272] [2024-10-11 22:33:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:12,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 22:33:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:12,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 22:33:12,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:33:12,651 INFO L87 Difference]: Start difference. First operand has 101 states, 80 states have (on average 1.5625) internal successors, (125), 88 states have internal predecessors, (125), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:12,694 INFO L93 Difference]: Finished difference Result 172 states and 243 transitions. [2024-10-11 22:33:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 22:33:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:33:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:12,710 INFO L225 Difference]: With dead ends: 172 [2024-10-11 22:33:12,711 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 22:33:12,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:33:12,719 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:12,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 22:33:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 22:33:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.48) internal successors, (111), 82 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-10-11 22:33:12,757 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 11 [2024-10-11 22:33:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:12,759 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-10-11 22:33:12,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-10-11 22:33:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 22:33:12,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:12,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:12,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:33:12,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash -221456990, now seen corresponding path program 1 times [2024-10-11 22:33:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468076903] [2024-10-11 22:33:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,051 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-11 22:33:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468076903] [2024-10-11 22:33:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468076903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:13,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:13,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786796162] [2024-10-11 22:33:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:13,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:13,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:13,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:13,055 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:13,100 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2024-10-11 22:33:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:13,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 22:33:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:13,102 INFO L225 Difference]: With dead ends: 91 [2024-10-11 22:33:13,102 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 22:33:13,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11 22:33:13,104 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 36 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:13,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 304 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 22:33:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 22:33:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 81 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-10-11 22:33:13,119 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 17 [2024-10-11 22:33:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:13,119 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-10-11 22:33:13,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-10-11 22:33:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 22:33:13,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:13,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:33:13,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1724768045, now seen corresponding path program 1 times [2024-10-11 22:33:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541373385] [2024-10-11 22:33:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,215 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-11 22:33:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541373385] [2024-10-11 22:33:13,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541373385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:13,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:13,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:33:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444395673] [2024-10-11 22:33:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:13,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:13,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:13,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:13,221 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:13,250 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2024-10-11 22:33:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:13,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 22:33:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:13,253 INFO L225 Difference]: With dead ends: 90 [2024-10-11 22:33:13,255 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 22:33:13,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 22:33:13,256 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:13,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 22:33:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 22:33:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 80 states have internal predecessors, (109), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-10-11 22:33:13,270 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 18 [2024-10-11 22:33:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:13,270 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-10-11 22:33:13,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-10-11 22:33:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 22:33:13,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:13,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:13,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:33:13,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:13,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash 289196682, now seen corresponding path program 1 times [2024-10-11 22:33:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:13,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114312754] [2024-10-11 22:33:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:13,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:33:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114312754] [2024-10-11 22:33:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114312754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:13,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:13,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842843080] [2024-10-11 22:33:13,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:13,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:13,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:13,464 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:13,494 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2024-10-11 22:33:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:13,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 22:33:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:13,495 INFO L225 Difference]: With dead ends: 89 [2024-10-11 22:33:13,496 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 22:33:13,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11 22:33:13,497 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 36 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:13,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 299 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 22:33:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 22:33:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.44) internal successors, (108), 79 states have internal predecessors, (108), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-10-11 22:33:13,511 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 32 [2024-10-11 22:33:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:13,512 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-10-11 22:33:13,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-10-11 22:33:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 22:33:13,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:13,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:13,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:33:13,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:13,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash 375162795, now seen corresponding path program 1 times [2024-10-11 22:33:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:13,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884112721] [2024-10-11 22:33:13,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:33:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884112721] [2024-10-11 22:33:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884112721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:13,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:33:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498563538] [2024-10-11 22:33:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:13,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:13,628 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:13,650 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2024-10-11 22:33:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:13,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-10-11 22:33:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:13,652 INFO L225 Difference]: With dead ends: 88 [2024-10-11 22:33:13,652 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 22:33:13,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11 22:33:13,653 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:13,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 22:33:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 22:33:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 78 states have internal predecessors, (107), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-10-11 22:33:13,665 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 33 [2024-10-11 22:33:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:13,666 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-10-11 22:33:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-10-11 22:33:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 22:33:13,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:13,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:33:13,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash -862241218, now seen corresponding path program 1 times [2024-10-11 22:33:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665834724] [2024-10-11 22:33:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:33:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 22:33:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665834724] [2024-10-11 22:33:13,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665834724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:13,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:13,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65109295] [2024-10-11 22:33:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:13,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:13,791 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:33:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:13,814 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2024-10-11 22:33:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:13,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-10-11 22:33:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:13,816 INFO L225 Difference]: With dead ends: 87 [2024-10-11 22:33:13,816 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 22:33:13,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11 22:33:13,817 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:13,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 22:33:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 22:33:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.4) internal successors, (105), 76 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-10-11 22:33:13,824 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 41 [2024-10-11 22:33:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:13,824 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-10-11 22:33:13,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:33:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-10-11 22:33:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 22:33:13,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:13,826 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:13,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 22:33:13,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:13,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:13,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1180781870, now seen corresponding path program 1 times [2024-10-11 22:33:13,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:13,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718963371] [2024-10-11 22:33:13,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:33:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 22:33:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 22:33:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 22:33:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:13,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718963371] [2024-10-11 22:33:13,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718963371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:13,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:13,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924263597] [2024-10-11 22:33:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:13,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:13,925 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 22:33:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:13,945 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2024-10-11 22:33:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2024-10-11 22:33:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:13,946 INFO L225 Difference]: With dead ends: 85 [2024-10-11 22:33:13,946 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:33:13,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-11 22:33:13,947 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:13,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 330 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:33:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:33:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11 22:33:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:33:13,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-10-11 22:33:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:13,949 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:33:13,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 22:33:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:33:13,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:33:13,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 22:33:13,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 22:33:13,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 22:33:13,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 22:33:13,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 22:33:13,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 22:33:13,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 22:33:13,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 22:33:13,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 22:33:13,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:13,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:33:13,987 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:33:14,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:33:14 BoogieIcfgContainer [2024-10-11 22:33:14,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:33:14,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:33:14,003 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:33:14,003 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:33:14,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:12" (3/4) ... [2024-10-11 22:33:14,005 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:33:14,008 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:33:14,008 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:33:14,016 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 22:33:14,016 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 22:33:14,017 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:33:14,017 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:33:14,124 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:33:14,124 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:33:14,124 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:33:14,125 INFO L158 Benchmark]: Toolchain (without parser) took 3759.20ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 154.2MB in the beginning and 135.9MB in the end (delta: 18.3MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2024-10-11 22:33:14,125 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 88.6MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:33:14,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1145.68ms. Allocated memory is still 186.6MB. Free memory was 154.2MB in the beginning and 142.1MB in the end (delta: 12.1MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-11 22:33:14,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.92ms. Allocated memory is still 186.6MB. Free memory was 142.1MB in the beginning and 139.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:33:14,126 INFO L158 Benchmark]: Boogie Preprocessor took 59.21ms. Allocated memory is still 186.6MB. Free memory was 139.0MB in the beginning and 135.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:33:14,126 INFO L158 Benchmark]: RCFGBuilder took 635.20ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 109.6MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 22:33:14,126 INFO L158 Benchmark]: TraceAbstraction took 1716.99ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 109.6MB in the beginning and 143.2MB in the end (delta: -33.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-10-11 22:33:14,126 INFO L158 Benchmark]: Witness Printer took 122.23ms. Allocated memory is still 224.4MB. Free memory was 143.2MB in the beginning and 135.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 22:33:14,128 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.18ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 88.6MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1145.68ms. Allocated memory is still 186.6MB. Free memory was 154.2MB in the beginning and 142.1MB in the end (delta: 12.1MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.92ms. Allocated memory is still 186.6MB. Free memory was 142.1MB in the beginning and 139.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.21ms. Allocated memory is still 186.6MB. Free memory was 139.0MB in the beginning and 135.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 635.20ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 109.6MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1716.99ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 109.6MB in the beginning and 143.2MB in the end (delta: -33.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 122.23ms. Allocated memory is still 224.4MB. Free memory was 143.2MB in the beginning and 135.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 1849 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1039 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 810 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=0, InterpolantAutomatonStates: 24, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 18/18 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 22:33:14,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Result: TRUE