./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-crafted/xor2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/xor2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 134cd77c565ec0964d690e2c701df7f2f34c79dd30f80feda5f549f6f11dd00c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:23:52,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:23:52,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:23:52,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:23:52,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:23:52,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:23:52,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:23:52,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:23:52,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:23:52,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:23:52,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:23:52,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:23:52,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:23:52,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:23:52,307 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:23:52,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:23:52,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:23:52,307 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:23:52,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:23:52,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:23:52,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:23:52,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:23:52,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:23:52,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:23:52,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:23:52,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:23:52,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:23:52,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:23:52,310 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 134cd77c565ec0964d690e2c701df7f2f34c79dd30f80feda5f549f6f11dd00c [2025-03-04 10:23:52,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:23:52,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:23:52,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:23:52,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:23:52,543 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:23:52,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor2.i [2025-03-04 10:23:53,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9505876a2/1bf3e8562c8a436fab79cdefcae6407f/FLAG7ab43958c [2025-03-04 10:23:53,876 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:23:53,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor2.i [2025-03-04 10:23:53,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9505876a2/1bf3e8562c8a436fab79cdefcae6407f/FLAG7ab43958c [2025-03-04 10:23:53,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9505876a2/1bf3e8562c8a436fab79cdefcae6407f [2025-03-04 10:23:53,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:23:53,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:23:53,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:23:53,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:23:53,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:23:53,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:23:53" (1/1) ... [2025-03-04 10:23:53,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad69ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:53, skipping insertion in model container [2025-03-04 10:23:53,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:23:53" (1/1) ... [2025-03-04 10:23:53,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:23:54,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:23:54,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:23:54,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:23:54,097 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:23:54,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54 WrapperNode [2025-03-04 10:23:54,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:23:54,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:23:54,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:23:54,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:23:54,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,124 INFO L138 Inliner]: procedures = 16, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-04 10:23:54,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:23:54,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:23:54,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:23:54,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:23:54,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,150 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-04 10:23:54,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,156 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:23:54,166 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:23:54,166 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:23:54,166 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:23:54,166 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (1/1) ... [2025-03-04 10:23:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:23:54,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:54,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:23:54,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:23:54,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:23:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:23:54,215 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2025-03-04 10:23:54,215 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2025-03-04 10:23:54,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:23:54,259 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:23:54,261 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:23:54,364 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-04 10:23:54,407 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-04 10:23:54,407 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:23:54,417 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:23:54,417 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:23:54,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:23:54 BoogieIcfgContainer [2025-03-04 10:23:54,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:23:54,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:23:54,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:23:54,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:23:54,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:23:53" (1/3) ... [2025-03-04 10:23:54,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b720a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:23:54, skipping insertion in model container [2025-03-04 10:23:54,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:54" (2/3) ... [2025-03-04 10:23:54,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b720a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:23:54, skipping insertion in model container [2025-03-04 10:23:54,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:23:54" (3/3) ... [2025-03-04 10:23:54,426 INFO L128 eAbstractionObserver]: Analyzing ICFG xor2.i [2025-03-04 10:23:54,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:23:54,439 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG xor2.i that has 2 procedures, 42 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 10:23:54,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:23:54,491 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;@6df87149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:23:54,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:23:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:23:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:23:54,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:54,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:23:54,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:54,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1907583, now seen corresponding path program 1 times [2025-03-04 10:23:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:54,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371117692] [2025-03-04 10:23:54,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:54,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:23:54,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:23:54,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:23:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371117692] [2025-03-04 10:23:54,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371117692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:54,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:54,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:23:54,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981388088] [2025-03-04 10:23:54,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:54,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:23:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:54,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:23:54,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:54,707 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2025-03-04 10:23:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:54,750 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2025-03-04 10:23:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:23:54,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-03-04 10:23:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:54,756 INFO L225 Difference]: With dead ends: 81 [2025-03-04 10:23:54,758 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:23:54,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:54,763 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:54,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 125 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:23:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 10:23:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.56) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-04 10:23:54,789 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 4 [2025-03-04 10:23:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:54,789 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-04 10:23:54,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2025-03-04 10:23:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-04 10:23:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:23:54,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:54,790 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:23:54,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:23:54,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:54,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 994226459, now seen corresponding path program 1 times [2025-03-04 10:23:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:54,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176510298] [2025-03-04 10:23:54,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:54,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:23:54,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:23:54,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:23:54,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176510298] [2025-03-04 10:23:54,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176510298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:54,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246321533] [2025-03-04 10:23:54,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:54,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:54,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:54,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:23:54,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:23:54,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:23:55,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:23:55,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:55,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:55,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:23:55,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:23:55,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:23:55,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246321533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:55,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:23:55,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:23:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362263620] [2025-03-04 10:23:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:55,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:23:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:55,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:23:55,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:23:55,050 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:55,082 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-03-04 10:23:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:23:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:23:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:55,084 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:23:55,084 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:23:55,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:23:55,085 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:55,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:23:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:23:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.52) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-04 10:23:55,089 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2025-03-04 10:23:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:55,089 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-04 10:23:55,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-04 10:23:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:23:55,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:55,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 10:23:55,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:23:55,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:55,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:55,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash 756249153, now seen corresponding path program 1 times [2025-03-04 10:23:55,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:55,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806969324] [2025-03-04 10:23:55,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:55,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:23:55,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:23:55,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:55,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:23:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806969324] [2025-03-04 10:23:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806969324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:23:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930399740] [2025-03-04 10:23:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:55,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:23:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:55,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:23:55,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:23:55,332 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2025-03-04 10:23:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:55,362 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-03-04 10:23:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:23:55,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2025-03-04 10:23:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:55,363 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:23:55,363 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:23:55,363 INFO L434 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 [2025-03-04 10:23:55,364 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:55,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:23:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-04 10:23:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-04 10:23:55,368 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 8 [2025-03-04 10:23:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:55,368 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-04 10:23:55,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2025-03-04 10:23:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-04 10:23:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:23:55,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:55,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:55,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:23:55,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:55,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -595686354, now seen corresponding path program 1 times [2025-03-04 10:23:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:55,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286077045] [2025-03-04 10:23:55,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:55,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:55,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:23:55,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:23:55,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:55,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:23:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286077045] [2025-03-04 10:23:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286077045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340628497] [2025-03-04 10:23:55,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:55,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:55,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:55,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:23:55,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:23:55,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:23:55,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:23:55,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:55,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:55,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:23:55,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:23:55,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:23:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:23:55,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340628497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:23:55,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:23:55,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:23:55,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399596232] [2025-03-04 10:23:55,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:23:55,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:23:55,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:55,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:23:55,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:23:55,578 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:55,601 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-03-04 10:23:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:23:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:23:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:55,603 INFO L225 Difference]: With dead ends: 66 [2025-03-04 10:23:55,603 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 10:23:55,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:23:55,605 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:55,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 10:23:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 10:23:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-03-04 10:23:55,612 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 12 [2025-03-04 10:23:55,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:55,612 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-04 10:23:55,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:55,612 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-03-04 10:23:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:23:55,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:55,612 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:55,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:23:55,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:23:55,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash 841930414, now seen corresponding path program 2 times [2025-03-04 10:23:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:55,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377462494] [2025-03-04 10:23:55,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:23:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:55,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:23:55,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 18 statements. [2025-03-04 10:23:55,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:23:55,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:23:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377462494] [2025-03-04 10:23:55,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377462494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:55,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:55,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:23:55,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997346777] [2025-03-04 10:23:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:55,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:23:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:55,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:23:55,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:55,853 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:55,883 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2025-03-04 10:23:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:23:55,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 10:23:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:55,884 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:23:55,884 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 10:23:55,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:55,885 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:55,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 98 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 10:23:55,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 10:23:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 43 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-03-04 10:23:55,889 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 18 [2025-03-04 10:23:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:55,889 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-03-04 10:23:55,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-03-04 10:23:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:23:55,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:55,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:55,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:23:55,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:55,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1356919021, now seen corresponding path program 1 times [2025-03-04 10:23:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911061073] [2025-03-04 10:23:55,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:55,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:23:55,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:23:55,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:55,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:23:55,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911061073] [2025-03-04 10:23:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911061073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606861394] [2025-03-04 10:23:55,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:55,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:55,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:55,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:23:55,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:23:56,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:23:56,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:23:56,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:56,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:23:56,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:23:56,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:23:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:23:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606861394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:23:56,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:23:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 10:23:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19033392] [2025-03-04 10:23:56,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:23:56,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:23:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:56,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:23:56,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:23:56,144 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:56,188 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2025-03-04 10:23:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:23:56,190 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 10:23:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:56,191 INFO L225 Difference]: With dead ends: 94 [2025-03-04 10:23:56,191 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 10:23:56,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:23:56,192 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:56,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 10:23:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 10:23:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-03-04 10:23:56,196 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 23 [2025-03-04 10:23:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:56,196 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-03-04 10:23:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-03-04 10:23:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:23:56,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:56,196 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:56,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:23:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:56,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:56,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash -194044947, now seen corresponding path program 2 times [2025-03-04 10:23:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386514839] [2025-03-04 10:23:56,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:23:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:56,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:23:56,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:23:56,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:23:56,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 10:23:56,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:56,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386514839] [2025-03-04 10:23:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386514839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:56,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81423080] [2025-03-04 10:23:56,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:23:56,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:56,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:56,526 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:23:56,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:23:56,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:23:56,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:23:56,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:23:56,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:56,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:23:56,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:23:56,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:23:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:23:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81423080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:23:57,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:23:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 36 [2025-03-04 10:23:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103432469] [2025-03-04 10:23:57,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:23:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:23:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:57,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:23:57,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:23:57,040 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:57,147 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2025-03-04 10:23:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:23:57,148 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-04 10:23:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:57,148 INFO L225 Difference]: With dead ends: 117 [2025-03-04 10:23:57,148 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 10:23:57,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:23:57,150 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:57,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 286 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:23:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 10:23:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 10:23:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 78 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-03-04 10:23:57,154 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 35 [2025-03-04 10:23:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:57,155 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-03-04 10:23:57,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-03-04 10:23:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:23:57,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:57,156 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:57,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:23:57,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:57,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:57,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:57,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1185696696, now seen corresponding path program 1 times [2025-03-04 10:23:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948874655] [2025-03-04 10:23:57,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:57,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:57,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:23:57,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:23:57,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:57,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-04 10:23:57,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:57,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948874655] [2025-03-04 10:23:57,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948874655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:57,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:57,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:23:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168564434] [2025-03-04 10:23:57,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:57,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:23:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:57,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:23:57,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:57,437 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:57,448 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-03-04 10:23:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:23:57,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-04 10:23:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:57,449 INFO L225 Difference]: With dead ends: 82 [2025-03-04 10:23:57,449 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 10:23:57,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:57,449 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 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 [2025-03-04 10:23:57,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 10:23:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-03-04 10:23:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-03-04 10:23:57,461 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 60 [2025-03-04 10:23:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:57,461 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-03-04 10:23:57,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:23:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-03-04 10:23:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:23:57,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:57,462 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:23:57,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -235272774, now seen corresponding path program 1 times [2025-03-04 10:23:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381556403] [2025-03-04 10:23:57,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:57,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:23:57,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:23:57,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:57,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-04 10:23:57,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:57,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381556403] [2025-03-04 10:23:57,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381556403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:57,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498448572] [2025-03-04 10:23:57,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:57,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:57,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:57,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:23:57,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:23:57,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:23:57,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:23:57,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:57,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:57,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:23:57,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-04 10:23:57,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:23:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498448572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:23:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:23:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489258893] [2025-03-04 10:23:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:57,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:23:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:57,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:23:57,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:23:57,680 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2025-03-04 10:23:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:57,692 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-03-04 10:23:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:23:57,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 72 [2025-03-04 10:23:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:57,693 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:23:57,696 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:23:57,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:23:57,696 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:57,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:23:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-04 10:23:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-03-04 10:23:57,703 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 72 [2025-03-04 10:23:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:57,705 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-03-04 10:23:57,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2025-03-04 10:23:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-03-04 10:23:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 10:23:57,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:57,706 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:57,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:23:57,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:57,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:57,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1296478584, now seen corresponding path program 1 times [2025-03-04 10:23:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:57,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274127419] [2025-03-04 10:23:57,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:57,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 10:23:57,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:23:57,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:57,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-04 10:23:58,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274127419] [2025-03-04 10:23:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274127419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100442506] [2025-03-04 10:23:58,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:58,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:58,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:23:58,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:23:58,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 10:23:58,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:23:58,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:58,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:58,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:23:58,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-04 10:23:58,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:23:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100442506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:58,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:23:58,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:23:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545883211] [2025-03-04 10:23:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:23:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:58,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:23:58,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:23:58,126 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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) [2025-03-04 10:23:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:58,139 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-03-04 10:23:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:23:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 73 [2025-03-04 10:23:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:58,140 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:23:58,140 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:23:58,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:23:58,141 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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 [2025-03-04 10:23:58,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:23:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 10:23:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:23:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-03-04 10:23:58,145 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 73 [2025-03-04 10:23:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:58,146 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-03-04 10:23:58,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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) [2025-03-04 10:23:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-03-04 10:23:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 10:23:58,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:58,146 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:58,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:23:58,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:58,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:23:58,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1536130424, now seen corresponding path program 1 times [2025-03-04 10:23:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:58,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141310985] [2025-03-04 10:23:58,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:58,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 10:23:58,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 10:23:58,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:58,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-04 10:23:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141310985] [2025-03-04 10:23:58,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141310985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998150466] [2025-03-04 10:23:58,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:58,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:58,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:58,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:23:58,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:23:58,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 10:23:58,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 10:23:58,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:58,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:58,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:23:58,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:23:58,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:23:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:23:59,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998150466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:23:59,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:23:59,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2025-03-04 10:23:59,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025525640] [2025-03-04 10:23:59,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:23:59,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-04 10:23:59,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:59,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-04 10:23:59,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 10:23:59,864 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:24:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:00,032 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2025-03-04 10:24:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-04 10:24:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-03-04 10:24:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:00,035 INFO L225 Difference]: With dead ends: 165 [2025-03-04 10:24:00,035 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 10:24:00,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 10:24:00,039 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:00,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 385 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 10:24:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2025-03-04 10:24:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.096) internal successors, (137), 128 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:24:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-03-04 10:24:00,049 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 74 [2025-03-04 10:24:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:00,049 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-03-04 10:24:00,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:24:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-03-04 10:24:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 10:24:00,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:00,053 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:00,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:24:00,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:00,254 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:24:00,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1768017778, now seen corresponding path program 2 times [2025-03-04 10:24:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251232548] [2025-03-04 10:24:00,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:00,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 132 statements into 2 equivalence classes. [2025-03-04 10:24:00,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 132 statements. [2025-03-04 10:24:00,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:00,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-03-04 10:24:00,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:00,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251232548] [2025-03-04 10:24:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251232548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:00,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308225816] [2025-03-04 10:24:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:00,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:00,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:00,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:00,303 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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) [2025-03-04 10:24:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:00,324 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-03-04 10:24:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:00,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 132 [2025-03-04 10:24:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:00,325 INFO L225 Difference]: With dead ends: 132 [2025-03-04 10:24:00,325 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 10:24:00,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:00,325 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:00,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 10:24:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-04 10:24:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.08) internal successors, (135), 126 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:24:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-03-04 10:24:00,335 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 132 [2025-03-04 10:24:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:00,336 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-03-04 10:24:00,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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) [2025-03-04 10:24:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-03-04 10:24:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 10:24:00,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:00,337 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:00,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:24:00,337 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:24:00,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1026023712, now seen corresponding path program 1 times [2025-03-04 10:24:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904094422] [2025-03-04 10:24:00,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:00,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 10:24:00,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 10:24:00,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:00,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-03-04 10:24:00,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:00,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904094422] [2025-03-04 10:24:00,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904094422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:00,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:00,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:00,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087869157] [2025-03-04 10:24:00,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:00,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:00,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:00,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:00,499 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2025-03-04 10:24:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:00,516 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2025-03-04 10:24:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 133 [2025-03-04 10:24:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:00,517 INFO L225 Difference]: With dead ends: 133 [2025-03-04 10:24:00,517 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 10:24:00,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:00,517 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:00,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 10:24:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-04 10:24:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.078740157480315) internal successors, (137), 128 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:24:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-03-04 10:24:00,526 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 133 [2025-03-04 10:24:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:00,526 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-03-04 10:24:00,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2025-03-04 10:24:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-03-04 10:24:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 10:24:00,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:00,528 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:00,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:24:00,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:24:00,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1009851436, now seen corresponding path program 1 times [2025-03-04 10:24:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:00,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388071058] [2025-03-04 10:24:00,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:00,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 10:24:00,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 10:24:00,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:00,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-03-04 10:24:00,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388071058] [2025-03-04 10:24:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388071058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:00,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:00,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:24:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519194308] [2025-03-04 10:24:00,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:00,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:00,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:00,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:00,640 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-04 10:24:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:00,650 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-03-04 10:24:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:00,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 136 [2025-03-04 10:24:00,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:00,652 INFO L225 Difference]: With dead ends: 132 [2025-03-04 10:24:00,652 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 10:24:00,652 INFO L434 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 [2025-03-04 10:24:00,652 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:00,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 10:24:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-04 10:24:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:24:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-03-04 10:24:00,659 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 136 [2025-03-04 10:24:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:00,659 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-03-04 10:24:00,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-04 10:24:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-03-04 10:24:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 10:24:00,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:00,660 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:24:00,660 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:24:00,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 195378386, now seen corresponding path program 1 times [2025-03-04 10:24:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006311136] [2025-03-04 10:24:00,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:00,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 10:24:00,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 10:24:00,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:00,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-03-04 10:24:00,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:00,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006311136] [2025-03-04 10:24:00,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006311136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:00,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:00,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874059285] [2025-03-04 10:24:00,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:00,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:00,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:00,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:00,756 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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) [2025-03-04 10:24:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:00,772 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-03-04 10:24:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:00,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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 138 [2025-03-04 10:24:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:00,773 INFO L225 Difference]: With dead ends: 131 [2025-03-04 10:24:00,773 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:24:00,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:00,774 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:00,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:24:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:24:00,774 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) [2025-03-04 10:24:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:24:00,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2025-03-04 10:24:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:00,774 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:24:00,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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) [2025-03-04 10:24:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:24:00,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:24:00,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 10:24:00,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 10:24:00,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 10:24:00,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 10:24:00,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 10:24:00,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 10:24:00,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 10:24:00,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 10:24:00,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:24:00,779 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:00,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:24:00,815 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:24:00,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:24:00 BoogieIcfgContainer [2025-03-04 10:24:00,827 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:24:00,828 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:24:00,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:24:00,828 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:24:00,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:23:54" (3/4) ... [2025-03-04 10:24:00,830 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:24:00,834 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xor [2025-03-04 10:24:00,836 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-04 10:24:00,837 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 10:24:00,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:24:00,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:24:00,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:24:00,902 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:24:00,903 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:24:00,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:24:00,904 INFO L158 Benchmark]: Toolchain (without parser) took 6975.72ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 113.4MB in the beginning and 279.5MB in the end (delta: -166.1MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2025-03-04 10:24:00,904 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:24:00,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.02ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 102.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:24:00,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.14ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:24:00,905 INFO L158 Benchmark]: Boogie Preprocessor took 40.57ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:24:00,905 INFO L158 Benchmark]: IcfgBuilder took 252.37ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 84.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:24:00,905 INFO L158 Benchmark]: TraceAbstraction took 6407.89ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 83.4MB in the beginning and 287.9MB in the end (delta: -204.4MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2025-03-04 10:24:00,906 INFO L158 Benchmark]: Witness Printer took 75.57ms. Allocated memory is still 402.7MB. Free memory was 287.9MB in the beginning and 279.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:24:00,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.02ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 102.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.14ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.57ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 252.37ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 84.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6407.89ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 83.4MB in the beginning and 287.9MB in the end (delta: -204.4MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. * Witness Printer took 75.57ms. Allocated memory is still 402.7MB. Free memory was 287.9MB in the beginning and 279.5MB in the end (delta: 8.4MB). 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: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: 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 2 procedures, 42 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 15, TraceHistogramMax: 31, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 1875 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1398 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 477 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=11, InterpolantAutomatonStates: 165, 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, 15 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1221 NumberOfCodeBlocks, 1093 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 1833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1465 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 8030/8908 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((i == 1) || (1 < i)) - InvariantResult [Line: 46]: Location Invariant Derived location invariant: (0 < (2147483650 + i)) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:24:00,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE