./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-crafted/xor2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/xor2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 134cd77c565ec0964d690e2c701df7f2f34c79dd30f80feda5f549f6f11dd00c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:39:31,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:39:31,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:39:31,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:39:31,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:39:31,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:39:31,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:39:31,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:39:31,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:39:31,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:39:31,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:39:31,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:39:31,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:39:31,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:39:31,255 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:39:31,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:39:31,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:39:31,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:39:31,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:39:31,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:39:31,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:39:31,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:39:31,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:39:31,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:39:31,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:39:31,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:39:31,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:39:31,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 134cd77c565ec0964d690e2c701df7f2f34c79dd30f80feda5f549f6f11dd00c [2025-03-17 14:39:31,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:39:31,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:39:31,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:39:31,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:39:31,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:39:31,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor2.i [2025-03-17 14:39:32,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6019155b4/8c2e0cdfc79c4e259bdf14622ed11ec5/FLAG54da15999 [2025-03-17 14:39:32,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:39:32,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor2.i [2025-03-17 14:39:32,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6019155b4/8c2e0cdfc79c4e259bdf14622ed11ec5/FLAG54da15999 [2025-03-17 14:39:32,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6019155b4/8c2e0cdfc79c4e259bdf14622ed11ec5 [2025-03-17 14:39:32,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:39:32,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:39:32,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:39:32,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:39:32,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:39:32,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:39:32" (1/1) ... [2025-03-17 14:39:32,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aeb3698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:32, skipping insertion in model container [2025-03-17 14:39:32,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:39:32" (1/1) ... [2025-03-17 14:39:32,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:39:32,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:39:32,993 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:39:33,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:39:33,015 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:39:33,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33 WrapperNode [2025-03-17 14:39:33,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:39:33,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:39:33,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:39:33,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:39:33,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,044 INFO L138 Inliner]: procedures = 16, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-17 14:39:33,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:39:33,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:39:33,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:39:33,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:39:33,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,065 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-17 14:39:33,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,069 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:39:33,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:39:33,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:39:33,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:39:33,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (1/1) ... [2025-03-17 14:39:33,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:39:33,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:33,095 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-17 14:39:33,096 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-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:39:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:39:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:39:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:39:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:39:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:39:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2025-03-17 14:39:33,114 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2025-03-17 14:39:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:39:33,173 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:39:33,174 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:39:33,319 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-17 14:39:33,356 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-17 14:39:33,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:39:33,370 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:39:33,372 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:39:33,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:33 BoogieIcfgContainer [2025-03-17 14:39:33,373 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:39:33,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:39:33,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:39:33,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:39:33,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:39:32" (1/3) ... [2025-03-17 14:39:33,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f46b248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:39:33, skipping insertion in model container [2025-03-17 14:39:33,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:33" (2/3) ... [2025-03-17 14:39:33,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f46b248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:39:33, skipping insertion in model container [2025-03-17 14:39:33,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:33" (3/3) ... [2025-03-17 14:39:33,381 INFO L128 eAbstractionObserver]: Analyzing ICFG xor2.i [2025-03-17 14:39:33,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:39:33,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG xor2.i that has 2 procedures, 41 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-17 14:39:33,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:39:33,436 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;@41cc6c49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:39:33,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:39:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 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-17 14:39:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:39:33,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:33,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:39:33,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:33,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:33,448 INFO L85 PathProgramCache]: Analyzing trace with hash 60541, now seen corresponding path program 1 times [2025-03-17 14:39:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:33,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646362166] [2025-03-17 14:39:33,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:33,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:33,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:39:33,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:39:33,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:33,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:33,607 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-17 14:39:33,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646362166] [2025-03-17 14:39:33,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646362166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:33,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:33,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:39:33,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168040604] [2025-03-17 14:39:33,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:33,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:33,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:33,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:33,628 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 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.0) internal successors, (3), 3 states have internal predecessors, (3), 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-17 14:39:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:33,682 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2025-03-17 14:39:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:33,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-17 14:39:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:33,689 INFO L225 Difference]: With dead ends: 80 [2025-03-17 14:39:33,689 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 14:39:33,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-17 14:39:33,694 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:33,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 14:39:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 14:39:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:39:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-17 14:39:33,720 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 3 [2025-03-17 14:39:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-17 14:39:33,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-17 14:39:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-17 14:39:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:39:33,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:33,721 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:39:33,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:39:33,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:33,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1803573085, now seen corresponding path program 1 times [2025-03-17 14:39:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:33,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180969534] [2025-03-17 14:39:33,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:33,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:39:33,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:39:33,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:33,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:33,827 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-17 14:39:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180969534] [2025-03-17 14:39:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180969534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758524767] [2025-03-17 14:39:33,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:33,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:33,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:33,830 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-17 14:39:33,831 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-17 14:39:33,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:39:33,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:39:33,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:33,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:33,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:39:33,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:33,936 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-17 14:39:33,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:39:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758524767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:39:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:39:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871143276] [2025-03-17 14:39:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:33,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:39:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:33,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:39:33,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:39:33,938 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:33,974 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-03-17 14:39:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:39:33,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:39:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:33,974 INFO L225 Difference]: With dead ends: 36 [2025-03-17 14:39:33,974 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 14:39:33,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-17 14:39:33,975 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:33,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 14:39:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-17 14:39:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 31 states have internal predecessors, (37), 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-17 14:39:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-17 14:39:33,980 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 6 [2025-03-17 14:39:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:33,980 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-17 14:39:33,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-17 14:39:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:39:33,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:33,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 14:39:33,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:39:34,180 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-17 14:39:34,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:34,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash 76190783, now seen corresponding path program 1 times [2025-03-17 14:39:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018588819] [2025-03-17 14:39:34,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:34,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:39:34,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:39:34,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:34,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:39:34,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:34,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018588819] [2025-03-17 14:39:34,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018588819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:34,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:34,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:39:34,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391304600] [2025-03-17 14:39:34,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:34,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:39:34,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:34,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:39:34,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:39:34,229 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:34,243 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-17 14:39:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:39:34,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:39:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:34,244 INFO L225 Difference]: With dead ends: 35 [2025-03-17 14:39:34,244 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 14:39:34,245 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-17 14:39:34,245 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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-17 14:39:34,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 14:39:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-17 14:39:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 28 states have internal predecessors, (34), 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-17 14:39:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-17 14:39:34,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 7 [2025-03-17 14:39:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:34,258 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-17 14:39:34,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-17 14:39:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:39:34,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:34,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:34,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:39:34,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:34,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash -38463796, now seen corresponding path program 1 times [2025-03-17 14:39:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:34,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644372393] [2025-03-17 14:39:34,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:39:34,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:39:34,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:34,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644372393] [2025-03-17 14:39:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644372393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006973164] [2025-03-17 14:39:34,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:34,332 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-17 14:39:34,333 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-17 14:39:34,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:39:34,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:39:34,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:34,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:34,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:39:34,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:34,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006973164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:34,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:34,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:39:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372032435] [2025-03-17 14:39:34,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:34,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:39:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:34,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:39:34,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:39:34,417 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-17 14:39:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:34,441 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2025-03-17 14:39:34,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:39:34,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 11 [2025-03-17 14:39:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:34,442 INFO L225 Difference]: With dead ends: 65 [2025-03-17 14:39:34,442 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 14:39:34,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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-17 14:39:34,443 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:34,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 14:39:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 14:39:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 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-17 14:39:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-03-17 14:39:34,450 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 11 [2025-03-17 14:39:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:34,450 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-03-17 14:39:34,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-17 14:39:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-03-17 14:39:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:39:34,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:34,450 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:34,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:39:34,650 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-17 14:39:34,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:34,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1793676596, now seen corresponding path program 2 times [2025-03-17 14:39:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392824921] [2025-03-17 14:39:34,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:34,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 14:39:34,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 17 statements. [2025-03-17 14:39:34,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:34,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:39:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:34,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392824921] [2025-03-17 14:39:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392824921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:34,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:34,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:34,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585675687] [2025-03-17 14:39:34,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:34,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:34,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:34,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:34,701 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-17 14:39:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:34,735 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2025-03-17 14:39:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:34,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 17 [2025-03-17 14:39:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:34,738 INFO L225 Difference]: With dead ends: 72 [2025-03-17 14:39:34,739 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 14:39:34,739 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-17 14:39:34,740 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 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-17 14:39:34,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 14:39:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-03-17 14:39:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 41 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-17 14:39:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2025-03-17 14:39:34,748 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 17 [2025-03-17 14:39:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:34,749 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-03-17 14:39:34,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-17 14:39:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2025-03-17 14:39:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:39:34,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:34,750 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:39:34,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 230600376, now seen corresponding path program 1 times [2025-03-17 14:39:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053530087] [2025-03-17 14:39:34,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:34,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:39:34,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:39:34,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:34,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:39:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:34,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053530087] [2025-03-17 14:39:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053530087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:34,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:34,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773836816] [2025-03-17 14:39:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:34,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:34,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:34,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:34,808 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:34,830 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-03-17 14:39:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 14:39:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:34,834 INFO L225 Difference]: With dead ends: 47 [2025-03-17 14:39:34,834 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 14:39:34,835 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-17 14:39:34,835 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:34,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 95 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 14:39:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 14:39:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 42 states have internal predecessors, (51), 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-17 14:39:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-03-17 14:39:34,842 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 18 [2025-03-17 14:39:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:34,842 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-17 14:39:34,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-03-17 14:39:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:39:34,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:34,843 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:34,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:39:34,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:34,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1663012914, now seen corresponding path program 1 times [2025-03-17 14:39:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136221645] [2025-03-17 14:39:34,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:34,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:39:34,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:39:34,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:34,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:39:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136221645] [2025-03-17 14:39:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136221645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732920835] [2025-03-17 14:39:34,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:34,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:34,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:34,935 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-17 14:39:34,936 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-17 14:39:34,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:39:34,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:39:34,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:34,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:34,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:39:34,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:39:35,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:39:35,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732920835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:35,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:35,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 14:39:35,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372659321] [2025-03-17 14:39:35,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:35,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 14:39:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:35,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 14:39:35,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 14:39:35,108 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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-17 14:39:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:35,152 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2025-03-17 14:39:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 14:39:35,152 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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 22 [2025-03-17 14:39:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:35,153 INFO L225 Difference]: With dead ends: 93 [2025-03-17 14:39:35,153 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 14:39:35,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 14:39:35,154 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:35,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 14:39:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 14:39:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3125) internal successors, (63), 54 states have internal predecessors, (63), 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-17 14:39:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-17 14:39:35,161 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 22 [2025-03-17 14:39:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:35,161 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-17 14:39:35,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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-17 14:39:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-17 14:39:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 14:39:35,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:35,162 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:35,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:39:35,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:35,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:35,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1341343694, now seen corresponding path program 2 times [2025-03-17 14:39:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:35,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766216355] [2025-03-17 14:39:35,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:35,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 14:39:35,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:39:35,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:39:35,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 14:39:35,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766216355] [2025-03-17 14:39:35,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766216355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701519464] [2025-03-17 14:39:35,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:35,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:35,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:35,442 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-17 14:39:35,444 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-17 14:39:35,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 14:39:35,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:39:35,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:39:35,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:35,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:39:35,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:39:35,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:39:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701519464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:35,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 16] total 36 [2025-03-17 14:39:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106939298] [2025-03-17 14:39:35,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:35,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 14:39:35,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:35,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 14:39:35,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 14:39:35,982 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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-17 14:39:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:36,117 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2025-03-17 14:39:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 14:39:36,118 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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 34 [2025-03-17 14:39:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:36,118 INFO L225 Difference]: With dead ends: 116 [2025-03-17 14:39:36,119 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 14:39:36,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 14:39:36,121 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:36,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 371 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 14:39:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 14:39:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 77 states have internal predecessors, (86), 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-17 14:39:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2025-03-17 14:39:36,127 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 34 [2025-03-17 14:39:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:36,127 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-03-17 14:39:36,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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-17 14:39:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2025-03-17 14:39:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 14:39:36,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:36,128 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:36,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:36,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:36,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:36,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:36,333 INFO L85 PathProgramCache]: Analyzing trace with hash 236061174, now seen corresponding path program 1 times [2025-03-17 14:39:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033423952] [2025-03-17 14:39:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:36,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:36,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 14:39:36,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 14:39:36,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:36,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-17 14:39:36,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:36,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033423952] [2025-03-17 14:39:36,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033423952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:36,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:36,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:36,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050060715] [2025-03-17 14:39:36,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:36,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:36,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:36,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:36,404 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-17 14:39:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:36,417 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-03-17 14:39:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:36,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 59 [2025-03-17 14:39:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:36,419 INFO L225 Difference]: With dead ends: 81 [2025-03-17 14:39:36,419 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 14:39:36,420 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-17 14:39:36,421 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:36,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 14:39:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2025-03-17 14:39:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:39:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-03-17 14:39:36,428 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 59 [2025-03-17 14:39:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:36,430 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-03-17 14:39:36,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-17 14:39:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-03-17 14:39:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 14:39:36,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:36,431 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:36,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:39:36,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:36,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash -764865608, now seen corresponding path program 1 times [2025-03-17 14:39:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486308010] [2025-03-17 14:39:36,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:36,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:36,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 14:39:36,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 14:39:36,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:36,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-17 14:39:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486308010] [2025-03-17 14:39:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486308010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595523667] [2025-03-17 14:39:36,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:36,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:36,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:36,567 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-17 14:39:36,569 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-17 14:39:36,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 14:39:36,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 14:39:36,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:36,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:36,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:39:36,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 14:39:36,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:39:36,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595523667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:36,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:39:36,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-17 14:39:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655166158] [2025-03-17 14:39:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:36,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:39:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:36,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:39:36,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:39:36,673 INFO L87 Difference]: Start difference. First operand 72 states and 78 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-17 14:39:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:36,693 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2025-03-17 14:39:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:39:36,694 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 71 [2025-03-17 14:39:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:36,694 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:39:36,694 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:39:36,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:39:36,695 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:36,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:39:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-17 14:39:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:39:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-03-17 14:39:36,699 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 71 [2025-03-17 14:39:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:36,700 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-03-17 14:39:36,700 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-17 14:39:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-03-17 14:39:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 14:39:36,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:36,701 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:36,707 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-17 14:39:36,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:39:36,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:36,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2058969914, now seen corresponding path program 1 times [2025-03-17 14:39:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:36,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333865493] [2025-03-17 14:39:36,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:36,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:36,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 14:39:36,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 14:39:36,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:36,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-17 14:39:37,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333865493] [2025-03-17 14:39:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333865493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635431222] [2025-03-17 14:39:37,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:37,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:37,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:37,017 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-17 14:39:37,019 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-17 14:39:37,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 14:39:37,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 14:39:37,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:37,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:37,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:39:37,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 14:39:37,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:39:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635431222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:37,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:39:37,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-17 14:39:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739859] [2025-03-17 14:39:37,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:37,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:39:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:37,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:39:37,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:39:37,114 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:39:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:37,126 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-17 14:39:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:39:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2025-03-17 14:39:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:37,127 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:39:37,127 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:39:37,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:39:37,127 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:37,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:39:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 14:39:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:39:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-03-17 14:39:37,134 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 72 [2025-03-17 14:39:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:37,134 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-03-17 14:39:37,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:39:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-03-17 14:39:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 14:39:37,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:37,135 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:37,142 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-17 14:39:37,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:37,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:37,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash -596442122, now seen corresponding path program 1 times [2025-03-17 14:39:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:37,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737690261] [2025-03-17 14:39:37,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:37,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:37,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 14:39:37,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 14:39:37,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:37,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-17 14:39:37,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:37,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737690261] [2025-03-17 14:39:37,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737690261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:37,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529331258] [2025-03-17 14:39:37,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:37,456 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-17 14:39:37,457 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-17 14:39:37,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 14:39:37,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 14:39:37,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:37,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:37,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 14:39:37,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 14:39:38,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 14:39:38,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529331258] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:38,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 32, 33] total 67 [2025-03-17 14:39:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725368150] [2025-03-17 14:39:38,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:38,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-17 14:39:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:38,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-17 14:39:38,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-03-17 14:39:38,862 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 67 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 67 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 14:39:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:39,012 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2025-03-17 14:39:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-17 14:39:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 67 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-03-17 14:39:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:39,014 INFO L225 Difference]: With dead ends: 164 [2025-03-17 14:39:39,014 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 14:39:39,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-03-17 14:39:39,016 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:39,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 352 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 14:39:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2025-03-17 14:39:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 124 states have (on average 1.096774193548387) internal successors, (136), 127 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:39:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-03-17 14:39:39,023 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 73 [2025-03-17 14:39:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:39,024 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-03-17 14:39:39,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 67 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 14:39:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-03-17 14:39:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 14:39:39,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:39,028 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:39,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:39:39,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:39,229 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:39,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash 217312398, now seen corresponding path program 2 times [2025-03-17 14:39:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854849895] [2025-03-17 14:39:39,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:39,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-03-17 14:39:39,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 131 statements. [2025-03-17 14:39:39,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:39,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-03-17 14:39:39,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854849895] [2025-03-17 14:39:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854849895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:39,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:39,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:39,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722783158] [2025-03-17 14:39:39,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:39,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:39,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:39,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:39,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:39,290 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:39:39,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:39,308 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-03-17 14:39:39,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:39,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2025-03-17 14:39:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:39,309 INFO L225 Difference]: With dead ends: 131 [2025-03-17 14:39:39,309 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 14:39:39,309 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-17 14:39:39,309 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 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-17 14:39:39,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 14:39:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-17 14:39:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0806451612903225) internal successors, (134), 125 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:39:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2025-03-17 14:39:39,318 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 131 [2025-03-17 14:39:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:39,318 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2025-03-17 14:39:39,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:39:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2025-03-17 14:39:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 14:39:39,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:39,321 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:39,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:39:39,321 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:39,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1853250272, now seen corresponding path program 1 times [2025-03-17 14:39:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:39,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15502622] [2025-03-17 14:39:39,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:39,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 14:39:39,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 14:39:39,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:39,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-03-17 14:39:39,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:39,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15502622] [2025-03-17 14:39:39,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15502622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:39,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:39,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:39,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885765691] [2025-03-17 14:39:39,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:39,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:39,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:39,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:39,451 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:39:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:39,467 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-03-17 14:39:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:39,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 132 [2025-03-17 14:39:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:39,469 INFO L225 Difference]: With dead ends: 132 [2025-03-17 14:39:39,469 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 14:39:39,469 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-17 14:39:39,470 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:39,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 14:39:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 14:39:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0793650793650793) internal successors, (136), 127 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:39:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-03-17 14:39:39,476 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 132 [2025-03-17 14:39:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:39,476 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-03-17 14:39:39,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:39:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-03-17 14:39:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 14:39:39,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:39,477 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:39,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:39:39,477 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1625726932, now seen corresponding path program 1 times [2025-03-17 14:39:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542783359] [2025-03-17 14:39:39,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:39,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 14:39:39,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 14:39:39,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:39,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-03-17 14:39:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542783359] [2025-03-17 14:39:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542783359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:39,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:39,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:39:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785488201] [2025-03-17 14:39:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:39,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:39:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:39,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:39:39,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:39:39,573 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-17 14:39:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:39,582 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-03-17 14:39:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:39:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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 135 [2025-03-17 14:39:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:39,583 INFO L225 Difference]: With dead ends: 131 [2025-03-17 14:39:39,583 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 14:39:39,583 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-17 14:39:39,584 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:39,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 14:39:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-17 14:39:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 126 states have (on average 1.0714285714285714) internal successors, (135), 126 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:39:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-03-17 14:39:39,588 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 135 [2025-03-17 14:39:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:39,588 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-03-17 14:39:39,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-17 14:39:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-03-17 14:39:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 14:39:39,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:39,589 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:39,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:39:39,589 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:39:39,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:39,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1044514606, now seen corresponding path program 1 times [2025-03-17 14:39:39,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:39,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478409999] [2025-03-17 14:39:39,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 14:39:39,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 14:39:39,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:39,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-03-17 14:39:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478409999] [2025-03-17 14:39:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478409999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212125638] [2025-03-17 14:39:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:39,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:39,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:39,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:39,717 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:39:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:39,731 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2025-03-17 14:39:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:39,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 137 [2025-03-17 14:39:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:39,732 INFO L225 Difference]: With dead ends: 130 [2025-03-17 14:39:39,732 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:39:39,733 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-17 14:39:39,734 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:39,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:39:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:39:39,734 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-17 14:39:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:39:39,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2025-03-17 14:39:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:39,735 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:39:39,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:39:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:39:39,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:39:39,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 14:39:39,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 14:39:39,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 14:39:39,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 14:39:39,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 14:39:39,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 14:39:39,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 14:39:39,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 14:39:39,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:39:39,740 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:39,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:39:39,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:39:39,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:39:39 BoogieIcfgContainer [2025-03-17 14:39:39,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:39:39,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:39:39,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:39:39,792 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:39:39,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:33" (3/4) ... [2025-03-17 14:39:39,794 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:39:39,798 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xor [2025-03-17 14:39:39,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-17 14:39:39,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 14:39:39,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:39:39,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:39:39,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:39:39,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:39:39,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:39:39,868 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:39:39,869 INFO L158 Benchmark]: Toolchain (without parser) took 7012.57ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 90.4MB in the end (delta: 23.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2025-03-17 14:39:39,869 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 226.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:39:39,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.49ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:39:39,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.41ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:39:39,870 INFO L158 Benchmark]: Boogie Preprocessor took 26.18ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:39:39,870 INFO L158 Benchmark]: IcfgBuilder took 300.71ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 84.1MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:39:39,870 INFO L158 Benchmark]: TraceAbstraction took 6417.03ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 96.2MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:39:39,870 INFO L158 Benchmark]: Witness Printer took 76.58ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 90.4MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:39:39,871 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.55ms. Allocated memory is still 226.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.49ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.41ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.18ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 300.71ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 84.1MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6417.03ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 96.2MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 76.58ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 90.4MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 53 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 16, TraceHistogramMax: 31, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 1981 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1487 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 494 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 478 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=12, InterpolantAutomatonStates: 169, 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, 16 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1217 NumberOfCodeBlocks, 1089 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1330 ConstructedInterpolants, 0 QuantifiedInterpolants, 1834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1465 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 8042/8920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((i == 1) || (1 < i)) - InvariantResult [Line: 46]: Location Invariant Derived location invariant: (0 < (2147483650 + i)) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:39:39,885 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