./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/a.09_assume.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/termination-restricted-15/a.09_assume.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', 'de9e6a194e0438bd2ca90d674a89a0fc54a4d9f9ed579627c7693dfb10f66ae0'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/a.09_assume.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 de9e6a194e0438bd2ca90d674a89a0fc54a4d9f9ed579627c7693dfb10f66ae0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:58:19,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:58:19,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 19:58:19,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:58:19,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:58:19,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:58:19,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:58:19,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:58:19,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:58:19,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:58:19,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:58:19,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:58:19,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:58:19,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:58:19,745 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:58:19,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:58:19,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 19:58:19,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:58:19,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:58:19,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 19:58:19,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:58:19,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 19:58:19,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:58:19,746 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 19:58:19,746 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:58:19,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 19:58:19,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:58:19,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:58:19,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:58:19,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:58:19,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:58:19,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:58:19,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:58:19,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:58:19,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 19:58:19,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:58:19,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:58:19,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:58:19,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:58:19,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:58:19,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:58:19,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> de9e6a194e0438bd2ca90d674a89a0fc54a4d9f9ed579627c7693dfb10f66ae0 [2024-11-07 19:58:19,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:58:20,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:58:20,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:58:20,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:58:20,004 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:58:20,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/a.09_assume.c [2024-11-07 19:58:21,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:58:21,527 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:58:21,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/a.09_assume.c [2024-11-07 19:58:21,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/333bf74f5/db3469faf87f4e2282652d4756cb2f48/FLAGab992e985 [2024-11-07 19:58:21,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/333bf74f5/db3469faf87f4e2282652d4756cb2f48 [2024-11-07 19:58:21,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:58:21,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:58:21,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:58:21,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:58:21,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:58:21,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa15972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21, skipping insertion in model container [2024-11-07 19:58:21,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:58:21,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:58:21,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:58:21,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:58:21,726 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:58:21,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21 WrapperNode [2024-11-07 19:58:21,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:58:21,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:58:21,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:58:21,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:58:21,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,751 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-11-07 19:58:21,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:58:21,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:58:21,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:58:21,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:58:21,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,764 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 19:58:21,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:58:21,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:58:21,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:58:21,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:58:21,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (1/1) ... [2024-11-07 19:58:21,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:58:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:21,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:58:21,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:58:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:58:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:58:21,912 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:58:21,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:58:21,982 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 19:58:21,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:58:21,989 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:58:21,989 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 19:58:21,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:21 BoogieIcfgContainer [2024-11-07 19:58:21,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:58:21,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:58:21,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:58:21,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:58:21,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:58:21" (1/3) ... [2024-11-07 19:58:21,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbfb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:58:21, skipping insertion in model container [2024-11-07 19:58:21,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:21" (2/3) ... [2024-11-07 19:58:21,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbfb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:58:21, skipping insertion in model container [2024-11-07 19:58:21,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:21" (3/3) ... [2024-11-07 19:58:21,999 INFO L112 eAbstractionObserver]: Analyzing ICFG a.09_assume.c [2024-11-07 19:58:22,012 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:58:22,013 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 19:58:22,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:58:22,075 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;@246d6781, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:58:22,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 19:58:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 19:58:22,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:22,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:58:22,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 19:58:22,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:22,091 INFO L85 PathProgramCache]: Analyzing trace with hash 28695781, now seen corresponding path program 1 times [2024-11-07 19:58:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:22,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949565423] [2024-11-07 19:58:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:22,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949565423] [2024-11-07 19:58:22,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949565423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:22,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:22,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:58:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719477193] [2024-11-07 19:58:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:22,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:22,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:22,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:22,251 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:22,292 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-07 19:58:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 19:58:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:22,300 INFO L225 Difference]: With dead ends: 21 [2024-11-07 19:58:22,300 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 19:58:22,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:22,306 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:22,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 19:58:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 19:58:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 11 states have internal predecessors, (13), 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-11-07 19:58:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-07 19:58:22,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 5 [2024-11-07 19:58:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:22,333 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-07 19:58:22,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-11-07 19:58:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 19:58:22,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:22,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:58:22,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:58:22,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 19:58:22,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash 889575341, now seen corresponding path program 1 times [2024-11-07 19:58:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824054801] [2024-11-07 19:58:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:22,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:22,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824054801] [2024-11-07 19:58:22,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824054801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:22,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:22,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:58:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311971524] [2024-11-07 19:58:22,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:22,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:22,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:22,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:22,362 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:22,372 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-07 19:58:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:22,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 19:58:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:22,372 INFO L225 Difference]: With dead ends: 23 [2024-11-07 19:58:22,373 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 19:58:22,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:22,373 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:22,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 19:58:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 19:58:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 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-11-07 19:58:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 19:58:22,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2024-11-07 19:58:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:22,376 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 19:58:22,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 19:58:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 19:58:22,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:22,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:58:22,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:58:22,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 19:58:22,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash 889569255, now seen corresponding path program 1 times [2024-11-07 19:58:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:22,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294414140] [2024-11-07 19:58:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294414140] [2024-11-07 19:58:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294414140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:22,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:58:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614426963] [2024-11-07 19:58:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:22,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:58:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:22,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:58:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:58:22,449 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. 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-11-07 19:58:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:22,478 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 19:58:22,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:58:22,478 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-11-07 19:58:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:22,479 INFO L225 Difference]: With dead ends: 14 [2024-11-07 19:58:22,479 INFO L226 Difference]: Without dead ends: 13 [2024-11-07 19:58:22,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:58:22,480 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:22,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-07 19:58:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-11-07 19:58:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-11-07 19:58:22,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2024-11-07 19:58:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:22,483 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-11-07 19:58:22,483 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-11-07 19:58:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-11-07 19:58:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 19:58:22,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:22,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:22,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:58:22,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 19:58:22,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash 177563817, now seen corresponding path program 1 times [2024-11-07 19:58:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908900910] [2024-11-07 19:58:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908900910] [2024-11-07 19:58:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908900910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:58:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969816802] [2024-11-07 19:58:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:22,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:58:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:58:22,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:58:22,574 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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-11-07 19:58:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:22,606 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-11-07 19:58:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:58:22,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-11-07 19:58:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:22,608 INFO L225 Difference]: With dead ends: 11 [2024-11-07 19:58:22,608 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 19:58:22,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:58:22,609 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:22,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 19:58:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-07 19:58:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-11-07 19:58:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-07 19:58:22,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2024-11-07 19:58:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:22,615 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-07 19:58:22,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-11-07 19:58:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-07 19:58:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:58:22,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:22,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:22,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:58:22,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 19:58:22,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1209511087, now seen corresponding path program 1 times [2024-11-07 19:58:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:22,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445451184] [2024-11-07 19:58:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:22,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445451184] [2024-11-07 19:58:22,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445451184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:22,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:22,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:58:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390394690] [2024-11-07 19:58:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:22,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:58:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:58:22,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:58:22,692 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-07 19:58:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:22,709 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2024-11-07 19:58:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:58:22,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-07 19:58:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:22,709 INFO L225 Difference]: With dead ends: 10 [2024-11-07 19:58:22,709 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 19:58:22,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:58:22,710 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 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-11-07 19:58:22,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 19:58:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 19:58:22,711 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-11-07 19:58:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 19:58:22,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2024-11-07 19:58:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 19:58:22,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-07 19:58:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 19:58:22,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 19:58:22,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 19:58:22,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 19:58:22,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 19:58:22,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 19:58:22,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:58:22,719 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 19:58:22,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 19:58:22,738 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:58:22,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:58:22 BoogieIcfgContainer [2024-11-07 19:58:22,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:58:22,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:58:22,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:58:22,754 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:58:22,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:21" (3/4) ... [2024-11-07 19:58:22,756 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 19:58:22,763 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 19:58:22,763 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 19:58:22,763 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-07 19:58:22,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 19:58:22,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 19:58:22,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:58:22,833 INFO L158 Benchmark]: Toolchain (without parser) took 1273.51ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 76.6MB in the end (delta: 15.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-07 19:58:22,834 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:58:22,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.76ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 82.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:58:22,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.23ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 81.1MB in the end (delta: 1000.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:58:22,834 INFO L158 Benchmark]: Boogie Preprocessor took 25.14ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 80.1MB in the end (delta: 966.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:58:22,834 INFO L158 Benchmark]: RCFGBuilder took 211.40ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 71.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:58:22,834 INFO L158 Benchmark]: TraceAbstraction took 761.03ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 81.3MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:58:22,835 INFO L158 Benchmark]: Witness Printer took 77.18ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 76.6MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:58:22,837 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.73ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.76ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 82.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.23ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 81.1MB in the end (delta: 1000.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.14ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 80.1MB in the end (delta: 966.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 211.40ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 71.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 761.03ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 81.3MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 77.18ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 76.6MB in the end (delta: 4.7MB). There was no memory consumed. 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: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: 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 1 procedures, 17 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 38 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 86 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 4 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: ((0 <= (z + 2147483648)) && (y <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2024-11-07 19:58:22,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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