./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-crafted/xor5.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/xor5.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 a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:23:57,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:23:57,623 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:57,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:23:57,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:23:57,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:23:57,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:23:57,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:23:57,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:23:57,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:23:57,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:23:57,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:23:57,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:23:57,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:23:57,654 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:23:57,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:23:57,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:23:57,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:23:57,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:23:57,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:23:57,656 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:23:57,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:23:57,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:23:57,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:23:57,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:23:57,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:23:57,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:23:57,657 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 -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2025-03-04 10:23:57,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:23:57,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:23:57,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:23:57,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:23:57,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:23:57,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2025-03-04 10:23:59,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437562fd8/67bdead070914d1598e4a92c5cd15cf5/FLAG889a6bbec [2025-03-04 10:23:59,275 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:23:59,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2025-03-04 10:23:59,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437562fd8/67bdead070914d1598e4a92c5cd15cf5/FLAG889a6bbec [2025-03-04 10:23:59,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437562fd8/67bdead070914d1598e4a92c5cd15cf5 [2025-03-04 10:23:59,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:23:59,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:23:59,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:23:59,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:23:59,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:23:59,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:23:59" (1/1) ... [2025-03-04 10:23:59,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5989a0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:59, skipping insertion in model container [2025-03-04 10:23:59,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:23:59" (1/1) ... [2025-03-04 10:23:59,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:23:59,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:23:59,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:23:59,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:23:59,454 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:23:59,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:59 WrapperNode [2025-03-04 10:23:59,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:23:59,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:23:59,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:23:59,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:23:59,461 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:59" (1/1) ... [2025-03-04 10:23:59,465 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:59" (1/1) ... [2025-03-04 10:23:59,482 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-03-04 10:23:59,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:23:59,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:23:59,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:23:59,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:23:59,491 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:59" (1/1) ... [2025-03-04 10:23:59,491 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:59" (1/1) ... [2025-03-04 10:23:59,493 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:59" (1/1) ... [2025-03-04 10:23:59,506 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:59,506 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:59" (1/1) ... [2025-03-04 10:23:59,507 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:59" (1/1) ... [2025-03-04 10:23:59,514 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:59" (1/1) ... [2025-03-04 10:23:59,518 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:59" (1/1) ... [2025-03-04 10:23:59,519 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:59" (1/1) ... [2025-03-04 10:23:59,520 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:59" (1/1) ... [2025-03-04 10:23:59,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:23:59,521 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:23:59,521 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:23:59,521 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:23:59,522 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:59" (1/1) ... [2025-03-04 10:23:59,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:23:59,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:59,555 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:59,557 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:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:23:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:23:59,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2025-03-04 10:23:59,576 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2025-03-04 10:23:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:23:59,627 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:23:59,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:23:59,814 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-04 10:23:59,814 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:23:59,834 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:23:59,835 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:23:59,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:23:59 BoogieIcfgContainer [2025-03-04 10:23:59,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:23:59,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:23:59,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:23:59,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:23:59,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:23:59" (1/3) ... [2025-03-04 10:23:59,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c4f040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:23:59, skipping insertion in model container [2025-03-04 10:23:59,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:59" (2/3) ... [2025-03-04 10:23:59,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c4f040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:23:59, skipping insertion in model container [2025-03-04 10:23:59,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:23:59" (3/3) ... [2025-03-04 10:23:59,842 INFO L128 eAbstractionObserver]: Analyzing ICFG xor5.i [2025-03-04 10:23:59,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:23:59,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG xor5.i that has 2 procedures, 53 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-03-04 10:23:59,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:23:59,905 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;@3cb4a295, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:23:59,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 10:23:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 48 states have internal predecessors, (58), 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:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:23:59,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:59,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:23:59,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:23:59,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash 70585768, now seen corresponding path program 1 times [2025-03-04 10:23:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:59,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16499742] [2025-03-04 10:23:59,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:59,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:23:59,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:23:59,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,097 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:24:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16499742] [2025-03-04 10:24:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16499742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:00,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:00,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133717920] [2025-03-04 10:24:00,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:00,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:00,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:00,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:00,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:00,116 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 48 states have internal predecessors, (58), 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.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:00,156 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2025-03-04 10:24:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:24:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:00,164 INFO L225 Difference]: With dead ends: 85 [2025-03-04 10:24:00,164 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 10:24:00,166 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,168 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:00,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 158 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 10:24:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 10:24:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 43 states have internal predecessors, (50), 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:24:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-04 10:24:00,199 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 5 [2025-03-04 10:24:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:00,200 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-04 10:24:00,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-04 10:24:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:24:00,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:00,201 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:00,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:24:00,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:00,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1713354468, now seen corresponding path program 1 times [2025-03-04 10:24:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:00,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78991669] [2025-03-04 10:24:00,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:00,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:24:00,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:24:00,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:00,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,334 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:24:00,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:00,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78991669] [2025-03-04 10:24:00,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78991669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:00,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406433002] [2025-03-04 10:24:00,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:00,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:00,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:00,338 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:24:00,340 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:24:00,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:24:00,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:24:00,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:00,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:24:00,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:00,453 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:24:00,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:00,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406433002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:00,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:00,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:24:00,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369333919] [2025-03-04 10:24:00,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:00,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:24:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:00,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:24:00,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:24:00,457 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:24:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:00,499 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-03-04 10:24:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:24:00,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:24:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:00,501 INFO L225 Difference]: With dead ends: 47 [2025-03-04 10:24:00,501 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 10:24:00,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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:24:00,502 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:00,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 171 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 10:24:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-04 10:24:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 42 states have internal predecessors, (49), 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:24:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-03-04 10:24:00,518 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 8 [2025-03-04 10:24:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:00,518 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-04 10:24:00,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:24:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-03-04 10:24:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:24:00,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:00,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:00,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:00,724 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:24:00,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:00,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -849777141, now seen corresponding path program 1 times [2025-03-04 10:24:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129858460] [2025-03-04 10:24:00,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:00,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:24:00,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:24:00,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:00,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,791 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:24:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:00,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129858460] [2025-03-04 10:24:00,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129858460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:00,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:00,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:00,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777811798] [2025-03-04 10:24:00,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:00,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:00,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:00,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:00,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:00,793 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:24:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:00,832 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-03-04 10:24:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:00,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2025-03-04 10:24:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:00,834 INFO L225 Difference]: With dead ends: 82 [2025-03-04 10:24:00,834 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 10:24:00,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:00,835 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:00,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 10:24:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-04 10:24:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 42 states have internal predecessors, (48), 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:24:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-04 10:24:00,841 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 10 [2025-03-04 10:24:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:00,841 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-04 10:24:00,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:24:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-04 10:24:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:24:00,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:00,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:24:00,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:24:00,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:00,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1574380950, now seen corresponding path program 1 times [2025-03-04 10:24:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:00,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691038950] [2025-03-04 10:24:00,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:00,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:24:00,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:24:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:00,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:00,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691038950] [2025-03-04 10:24:00,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691038950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:00,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037346674] [2025-03-04 10:24:00,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:00,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:00,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:00,950 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:24:00,951 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:24:00,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:24:00,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:24:00,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:00,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:00,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:24:00,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:01,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037346674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:01,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:24:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540549883] [2025-03-04 10:24:01,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:01,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:24:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:01,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:24:01,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:24:01,061 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 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:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:01,099 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2025-03-04 10:24:01,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:24:01,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:24:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:01,101 INFO L225 Difference]: With dead ends: 56 [2025-03-04 10:24:01,101 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 10:24:01,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:24:01,101 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:01,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 10:24:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 10:24:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.5) internal successors, (60), 51 states have internal predecessors, (60), 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:24:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-03-04 10:24:01,105 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 9 [2025-03-04 10:24:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:01,106 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-03-04 10:24:01,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 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:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-03-04 10:24:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:24:01,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:01,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:01,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:01,311 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:24:01,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:01,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:01,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2121087767, now seen corresponding path program 1 times [2025-03-04 10:24:01,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:01,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550253757] [2025-03-04 10:24:01,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:01,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:01,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:24:01,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:24:01,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:01,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:01,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550253757] [2025-03-04 10:24:01,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550253757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:01,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:01,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:01,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275275771] [2025-03-04 10:24:01,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:01,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:01,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:01,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:01,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:01,353 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:24:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:01,374 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-03-04 10:24:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:01,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2025-03-04 10:24:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:01,376 INFO L225 Difference]: With dead ends: 65 [2025-03-04 10:24:01,376 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 10:24:01,376 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:01,376 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:01,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 129 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 10:24:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 10:24:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5) internal successors, (72), 59 states have internal predecessors, (72), 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:24:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-03-04 10:24:01,381 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 13 [2025-03-04 10:24:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:01,381 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-03-04 10:24:01,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:24:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-03-04 10:24:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:24:01,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:01,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:01,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:24:01,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:01,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1406968624, now seen corresponding path program 1 times [2025-03-04 10:24:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115564331] [2025-03-04 10:24:01,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:01,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:24:01,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:24:01,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:01,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:24:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115564331] [2025-03-04 10:24:01,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115564331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60372753] [2025-03-04 10:24:01,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:01,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:01,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:01,460 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:24:01,461 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:24:01,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:24:01,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:24:01,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:01,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:01,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:24:01,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:24:01,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:24:01,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60372753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:01,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:01,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:24:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129811291] [2025-03-04 10:24:01,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:01,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:24:01,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:01,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:24:01,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:24:01,600 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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:24:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:01,656 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2025-03-04 10:24:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:24:01,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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:24:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:01,657 INFO L225 Difference]: With dead ends: 107 [2025-03-04 10:24:01,657 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 10:24:01,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:24:01,658 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:01,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 10:24:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 10:24:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 59 states have internal predecessors, (71), 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:24:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2025-03-04 10:24:01,664 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 18 [2025-03-04 10:24:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:01,664 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2025-03-04 10:24:01,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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:24:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2025-03-04 10:24:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:24:01,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:01,665 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-04 10:24:01,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:01,865 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:24:01,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:01,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1412722782, now seen corresponding path program 2 times [2025-03-04 10:24:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379420341] [2025-03-04 10:24:01,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:01,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:24:01,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 10:24:01,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:01,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:24:01,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:01,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379420341] [2025-03-04 10:24:01,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379420341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:01,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098093403] [2025-03-04 10:24:01,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:01,921 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:24:01,922 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:24:01,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:24:01,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 10:24:01,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:01,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:01,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:24:01,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:24:01,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:24:02,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098093403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:02,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:02,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 10:24:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483218784] [2025-03-04 10:24:02,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:02,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:02,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:02,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:02,021 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:02,053 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-03-04 10:24:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:02,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 10:24:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:02,054 INFO L225 Difference]: With dead ends: 63 [2025-03-04 10:24:02,054 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 10:24:02,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:02,055 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:02,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 10:24:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2025-03-04 10:24:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.45) internal successors, (58), 48 states have internal predecessors, (58), 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:24:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-04 10:24:02,063 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 18 [2025-03-04 10:24:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:02,063 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-04 10:24:02,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-03-04 10:24:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:24:02,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:02,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:02,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:24:02,263 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:24:02,264 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:02,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash 34120764, now seen corresponding path program 2 times [2025-03-04 10:24:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124100459] [2025-03-04 10:24:02,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:02,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:24:02,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:24:02,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:02,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:24:02,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124100459] [2025-03-04 10:24:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124100459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:24:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008873610] [2025-03-04 10:24:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:24:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:02,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:24:02,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:02,312 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:24:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:02,328 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-03-04 10:24:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:02,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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 21 [2025-03-04 10:24:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:02,329 INFO L225 Difference]: With dead ends: 52 [2025-03-04 10:24:02,329 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 10:24:02,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:02,329 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:02,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 10:24:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-04 10:24:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.425) internal successors, (57), 47 states have internal predecessors, (57), 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:24:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-03-04 10:24:02,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 21 [2025-03-04 10:24:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:02,333 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-03-04 10:24:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:24:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-03-04 10:24:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:24:02,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:02,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:02,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:24:02,334 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1057743701, now seen corresponding path program 1 times [2025-03-04 10:24:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246281625] [2025-03-04 10:24:02,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:02,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:24:02,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:24:02,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:24:02,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246281625] [2025-03-04 10:24:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246281625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982419115] [2025-03-04 10:24:02,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:02,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:02,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:02,384 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:24:02,385 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:24:02,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:24:02,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:24:02,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:02,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:02,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:24:02,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:02,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982419115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:02,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:02,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 18 [2025-03-04 10:24:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690543867] [2025-03-04 10:24:02,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:02,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:24:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:02,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:24:02,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:24:02,618 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 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:24:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:02,778 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2025-03-04 10:24:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:24:02,778 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 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 22 [2025-03-04 10:24:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:02,779 INFO L225 Difference]: With dead ends: 133 [2025-03-04 10:24:02,780 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 10:24:02,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:24:02,780 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 58 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:02,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 283 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:02,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 10:24:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2025-03-04 10:24:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 80 states have internal predecessors, (105), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2025-03-04 10:24:02,786 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 22 [2025-03-04 10:24:02,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:02,786 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2025-03-04 10:24:02,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 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:24:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2025-03-04 10:24:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:24:02,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:02,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:02,792 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:24:02,987 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:24:02,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:02,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash 484143411, now seen corresponding path program 1 times [2025-03-04 10:24:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985356097] [2025-03-04 10:24:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:02,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:24:02,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:24:02,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:24:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985356097] [2025-03-04 10:24:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985356097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297840382] [2025-03-04 10:24:03,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:03,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:03,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:03,040 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:24:03,043 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:24:03,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:24:03,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:24:03,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:03,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:03,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:24:03,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:24:03,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297840382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:03,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:03,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-04 10:24:03,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803758862] [2025-03-04 10:24:03,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:03,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:03,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:03,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:03,133 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:03,151 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2025-03-04 10:24:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:03,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 23 [2025-03-04 10:24:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:03,152 INFO L225 Difference]: With dead ends: 87 [2025-03-04 10:24:03,152 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 10:24:03,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:03,153 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:03,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 10:24:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 10:24:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 76 states have internal predecessors, (99), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2025-03-04 10:24:03,158 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 23 [2025-03-04 10:24:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:03,158 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2025-03-04 10:24:03,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2025-03-04 10:24:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:24:03,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:03,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:03,165 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:24:03,359 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:24:03,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:03,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 616173095, now seen corresponding path program 1 times [2025-03-04 10:24:03,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:03,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708557044] [2025-03-04 10:24:03,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:03,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:24:03,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:24:03,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:03,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:24:03,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:03,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708557044] [2025-03-04 10:24:03,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708557044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:03,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541219162] [2025-03-04 10:24:03,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:03,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:03,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:03,417 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:24:03,418 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:24:03,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:24:03,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:24:03,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:03,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:03,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:24:03,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:24:03,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:03,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541219162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:03,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:03,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:24:03,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108945168] [2025-03-04 10:24:03,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:03,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:03,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:03,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:03,481 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (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:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:03,499 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2025-03-04 10:24:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (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 26 [2025-03-04 10:24:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:03,500 INFO L225 Difference]: With dead ends: 94 [2025-03-04 10:24:03,500 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 10:24:03,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:03,501 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:03,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 10:24:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-03-04 10:24:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 84 states have internal predecessors, (108), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 119 transitions. [2025-03-04 10:24:03,512 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 119 transitions. Word has length 26 [2025-03-04 10:24:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:03,513 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 119 transitions. [2025-03-04 10:24:03,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (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:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 119 transitions. [2025-03-04 10:24:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:24:03,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:03,514 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:03,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:03,714 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:03,715 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:03,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:03,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1921496751, now seen corresponding path program 1 times [2025-03-04 10:24:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:03,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49464005] [2025-03-04 10:24:03,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:03,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:24:03,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:24:03,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:03,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:24:03,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:03,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49464005] [2025-03-04 10:24:03,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49464005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:03,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400860130] [2025-03-04 10:24:03,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:03,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:03,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:03,760 INFO L229 MonitoredProcess]: Starting monitored process 9 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:24:03,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:24:03,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:24:03,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:24:03,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:03,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:03,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:24:03,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:24:03,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400860130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:03,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:03,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:24:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948313281] [2025-03-04 10:24:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:03,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:03,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:03,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:03,820 INFO L87 Difference]: Start difference. First operand 91 states and 119 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:03,835 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2025-03-04 10:24:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:03,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 27 [2025-03-04 10:24:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:03,836 INFO L225 Difference]: With dead ends: 94 [2025-03-04 10:24:03,837 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 10:24:03,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:03,837 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:03,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 10:24:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 10:24:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 86 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2025-03-04 10:24:03,860 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 27 [2025-03-04 10:24:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:03,860 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2025-03-04 10:24:03,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2025-03-04 10:24:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:24:03,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:03,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:03,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:04,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:24:04,067 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:04,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash -563142875, now seen corresponding path program 1 times [2025-03-04 10:24:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129912106] [2025-03-04 10:24:04,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:04,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:24:04,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:24:04,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:04,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:24:04,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:04,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129912106] [2025-03-04 10:24:04,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129912106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:04,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289744323] [2025-03-04 10:24:04,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:04,114 INFO L229 MonitoredProcess]: Starting monitored process 10 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:24:04,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:24:04,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:24:04,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:24:04,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:04,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:04,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:24:04,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:24:04,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289744323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:04,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-03-04 10:24:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162665499] [2025-03-04 10:24:04,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:04,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:04,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:04,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:04,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:04,184 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:24:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:04,212 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2025-03-04 10:24:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:04,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-04 10:24:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:04,213 INFO L225 Difference]: With dead ends: 124 [2025-03-04 10:24:04,213 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 10:24:04,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:04,215 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:04,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 54 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 10:24:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 10:24:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 86 states have internal predecessors, (108), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2025-03-04 10:24:04,219 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 28 [2025-03-04 10:24:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:04,220 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2025-03-04 10:24:04,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:24:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2025-03-04 10:24:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:24:04,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:04,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:04,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:24:04,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:24:04,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:04,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1629656902, now seen corresponding path program 2 times [2025-03-04 10:24:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667705494] [2025-03-04 10:24:04,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:04,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:24:04,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 30 statements. [2025-03-04 10:24:04,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:04,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:24:04,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:04,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667705494] [2025-03-04 10:24:04,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667705494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:04,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593374264] [2025-03-04 10:24:04,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:04,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:04,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:04,465 INFO L229 MonitoredProcess]: Starting monitored process 11 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:24:04,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:24:04,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:24:04,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 30 statements. [2025-03-04 10:24:04,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:04,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:04,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:24:04,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:24:04,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:24:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593374264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:04,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 10:24:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24093527] [2025-03-04 10:24:04,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:24:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:04,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:24:04,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:04,579 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:24:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:04,615 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2025-03-04 10:24:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:24:04,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 30 [2025-03-04 10:24:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:04,617 INFO L225 Difference]: With dead ends: 93 [2025-03-04 10:24:04,617 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 10:24:04,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:04,617 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 10:24:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2025-03-04 10:24:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.293103448275862) internal successors, (75), 62 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-03-04 10:24:04,623 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 30 [2025-03-04 10:24:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-03-04 10:24:04,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:24:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-03-04 10:24:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:24:04,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:04,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:04,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:04,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:24:04,829 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:04,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2047109779, now seen corresponding path program 1 times [2025-03-04 10:24:04,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:04,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519255470] [2025-03-04 10:24:04,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:04,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:24:04,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:24:04,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:04,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:24:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519255470] [2025-03-04 10:24:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519255470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:04,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381177154] [2025-03-04 10:24:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:04,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:04,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:04,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:04,882 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:04,904 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2025-03-04 10:24:04,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:04,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 38 [2025-03-04 10:24:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:04,905 INFO L225 Difference]: With dead ends: 72 [2025-03-04 10:24:04,905 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 10:24:04,905 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:04,906 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:04,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 10:24:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-04 10:24:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 64 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-04 10:24:04,910 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 38 [2025-03-04 10:24:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:04,910 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-04 10:24:04,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-04 10:24:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:24:04,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:04,911 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:04,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:24:04,911 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:04,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash 71301051, now seen corresponding path program 1 times [2025-03-04 10:24:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243604742] [2025-03-04 10:24:04,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:04,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:24:04,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:24:04,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:04,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:24:04,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:04,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243604742] [2025-03-04 10:24:04,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243604742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:04,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472776049] [2025-03-04 10:24:04,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:04,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:04,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:04,985 INFO L229 MonitoredProcess]: Starting monitored process 12 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:24:04,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:24:05,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:24:05,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:24:05,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:05,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:05,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:24:05,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:24:05,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472776049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:05,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 10:24:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173540034] [2025-03-04 10:24:05,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:05,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:05,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:05,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:05,062 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:05,079 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2025-03-04 10:24:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:05,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 43 [2025-03-04 10:24:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:05,081 INFO L225 Difference]: With dead ends: 70 [2025-03-04 10:24:05,081 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 10:24:05,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:05,081 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 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:05,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 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:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 10:24:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-04 10:24:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 62 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-03-04 10:24:05,086 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 43 [2025-03-04 10:24:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:05,086 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-03-04 10:24:05,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-03-04 10:24:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:24:05,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:05,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:05,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:24:05,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:24:05,287 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:05,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2084634725, now seen corresponding path program 1 times [2025-03-04 10:24:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618661072] [2025-03-04 10:24:05,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:05,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:24:05,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:24:05,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:05,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:24:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:05,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618661072] [2025-03-04 10:24:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618661072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:05,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741519331] [2025-03-04 10:24:05,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:05,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:05,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:05,359 INFO L229 MonitoredProcess]: Starting monitored process 13 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:24:05,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:24:05,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:24:05,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:24:05,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:05,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:05,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:24:05,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:24:05,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:24:05,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741519331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:05,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:05,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:24:05,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367807599] [2025-03-04 10:24:05,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:05,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:24:05,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:05,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:24:05,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:24:05,492 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 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:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:05,524 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2025-03-04 10:24:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:24:05,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 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 44 [2025-03-04 10:24:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:05,525 INFO L225 Difference]: With dead ends: 82 [2025-03-04 10:24:05,525 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 10:24:05,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 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:24:05,525 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:05,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 10:24:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 10:24:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2025-03-04 10:24:05,530 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 44 [2025-03-04 10:24:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:05,530 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2025-03-04 10:24:05,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 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:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2025-03-04 10:24:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:24:05,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:05,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:05,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:24:05,734 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:05,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash -810973569, now seen corresponding path program 1 times [2025-03-04 10:24:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293346052] [2025-03-04 10:24:05,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:05,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:24:05,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:24:05,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:05,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 10:24:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293346052] [2025-03-04 10:24:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293346052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:24:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38576837] [2025-03-04 10:24:05,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:05,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:05,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:05,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:05,796 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:05,804 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2025-03-04 10:24:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 53 [2025-03-04 10:24:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:05,805 INFO L225 Difference]: With dead ends: 80 [2025-03-04 10:24:05,805 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 10:24:05,805 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:05,806 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 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:24:05,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 10:24:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-04 10:24:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 73 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:24:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2025-03-04 10:24:05,810 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 53 [2025-03-04 10:24:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:05,810 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2025-03-04 10:24:05,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2025-03-04 10:24:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:24:05,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:05,811 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:05,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:24:05,811 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:24:05,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:05,811 INFO L85 PathProgramCache]: Analyzing trace with hash 334731483, now seen corresponding path program 2 times [2025-03-04 10:24:05,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585247454] [2025-03-04 10:24:05,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:05,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-04 10:24:05,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 58 statements. [2025-03-04 10:24:05,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:05,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 10:24:05,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:05,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585247454] [2025-03-04 10:24:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585247454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:05,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740023880] [2025-03-04 10:24:05,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:05,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:05,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:05,843 INFO L229 MonitoredProcess]: Starting monitored process 14 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:24:05,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:24:05,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-04 10:24:05,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 58 statements. [2025-03-04 10:24:05,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:05,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:05,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:24:05,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 10:24:05,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 10:24:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740023880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:06,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:06,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:24:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852165855] [2025-03-04 10:24:06,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:06,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:24:06,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:06,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:24:06,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:06,012 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:24:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:06,039 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2025-03-04 10:24:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:06,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2025-03-04 10:24:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:06,040 INFO L225 Difference]: With dead ends: 79 [2025-03-04 10:24:06,040 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:24:06,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:06,040 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:06,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:24:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:24:06,041 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:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:24:06,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2025-03-04 10:24:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:06,041 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:24:06,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:24:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:24:06,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:24:06,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 10:24:06,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 10:24:06,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 10:24:06,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 10:24:06,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 10:24:06,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 10:24:06,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 10:24:06,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 10:24:06,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 10:24:06,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 10:24:06,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 10:24:06,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 10:24:06,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:24:06,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:06,250 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:06,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:24:06,409 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:24:06,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:24:06 BoogieIcfgContainer [2025-03-04 10:24:06,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:24:06,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:24:06,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:24:06,423 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:24:06,424 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:59" (3/4) ... [2025-03-04 10:24:06,425 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:24:06,429 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xor [2025-03-04 10:24:06,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-04 10:24:06,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 10:24:06,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:24:06,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:24:06,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:24:06,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:24:06,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:24:06,493 INFO L158 Benchmark]: Toolchain (without parser) took 7201.37ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 50.4MB in the end (delta: 62.3MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2025-03-04 10:24:06,493 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:24:06,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.07ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:24:06,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.83ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:24:06,493 INFO L158 Benchmark]: Boogie Preprocessor took 35.79ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:24:06,493 INFO L158 Benchmark]: IcfgBuilder took 314.19ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 82.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:24:06,493 INFO L158 Benchmark]: TraceAbstraction took 6585.54ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 56.9MB in the end (delta: 24.9MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2025-03-04 10:24:06,494 INFO L158 Benchmark]: Witness Printer took 69.26ms. Allocated memory is still 142.6MB. Free memory was 56.9MB in the beginning and 50.4MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:24:06,494 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.07ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.83ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.79ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 314.19ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 82.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6585.54ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 56.9MB in the end (delta: 24.9MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Witness Printer took 69.26ms. Allocated memory is still 142.6MB. Free memory was 56.9MB in the beginning and 50.4MB in the end (delta: 6.5MB). 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: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: 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, 53 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 2267 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1572 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 785 IncrementalHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 695 mSDtfsCounter, 785 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 509 SyntacticMatches, 12 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=12, InterpolantAutomatonStates: 95, 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, 19 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 848 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1008 ConstructedInterpolants, 0 QuantifiedInterpolants, 2106 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1537 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 517/643 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 12 specifications checked. All of them hold - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((N <= 2147483647) && (0 <= (2147483648 + i))) && (((i == 1) || (2 == i)) || (2 < N))) - InvariantResult [Line: 50]: Location Invariant Derived location invariant: (((N <= 2147483647) && (0 <= (i + 2147483648))) && (2 <= N)) - InvariantResult [Line: 40]: Location Invariant Derived location invariant: ((((N <= 2147483647) && (i == 0)) && (2 <= N)) || (((N <= 2147483647) && (1 <= i)) && (2 <= N))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:24:06,505 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