./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/b.10-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:56:39,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:56:39,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:56:39,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:56:39,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:56:39,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:56:39,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:56:39,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:56:39,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:56:39,659 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:56:39,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:56:39,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:56:39,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:56:39,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:56:39,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:56:39,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:56:39,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:56:39,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:56:39,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:56:39,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:56:39,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:56:39,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:56:39,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:56:39,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:56:39,662 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b [2025-03-17 14:56:39,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:56:39,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:56:39,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:56:39,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:56:39,927 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:56:39,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2025-03-17 14:56:41,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5656238/9473288802ba44b19b82eabc0e18d9af/FLAG995708954 [2025-03-17 14:56:41,308 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:56:41,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2025-03-17 14:56:41,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5656238/9473288802ba44b19b82eabc0e18d9af/FLAG995708954 [2025-03-17 14:56:41,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5656238/9473288802ba44b19b82eabc0e18d9af [2025-03-17 14:56:41,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:56:41,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:56:41,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:56:41,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:56:41,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:56:41,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41, skipping insertion in model container [2025-03-17 14:56:41,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:56:41,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:56:41,868 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:56:41,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:56:41,910 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:56:41,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41 WrapperNode [2025-03-17 14:56:41,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:56:41,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:56:41,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:56:41,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:56:41,916 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:56:41" (1/1) ... [2025-03-17 14:56:41,924 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:56:41" (1/1) ... [2025-03-17 14:56:41,942 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 117 [2025-03-17 14:56:41,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:56:41,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:56:41,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:56:41,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:56:41,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,956 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [7, 2, 9]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 1, 2]. [2025-03-17 14:56:41,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:56:41,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:56:41,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:56:41,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:56:41,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (1/1) ... [2025-03-17 14:56:41,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:56:41,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:56:41,990 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:56:41,992 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:56:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:56:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:56:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:56:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:56:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:56:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:56:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:56:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:56:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:56:42,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:56:42,093 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:56:42,095 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:56:42,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;havoc main_#t~ret24#1; [2025-03-17 14:56:42,224 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc test_fun_#t~mem21#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-03-17 14:56:42,233 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-17 14:56:42,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:56:42,239 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:56:42,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:56:42,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:42 BoogieIcfgContainer [2025-03-17 14:56:42,240 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:56:42,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:56:42,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:56:42,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:56:42,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:56:41" (1/3) ... [2025-03-17 14:56:42,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a46f5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:42, skipping insertion in model container [2025-03-17 14:56:42,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:41" (2/3) ... [2025-03-17 14:56:42,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a46f5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:42, skipping insertion in model container [2025-03-17 14:56:42,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:42" (3/3) ... [2025-03-17 14:56:42,248 INFO L128 eAbstractionObserver]: Analyzing ICFG b.10-alloca.i [2025-03-17 14:56:42,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:56:42,258 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.10-alloca.i that has 1 procedures, 37 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-17 14:56:42,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:56:42,305 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;@75212d4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:56:42,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 14:56:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 36 states have internal predecessors, (44), 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:56:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:56:42,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:42,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:56:42,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:42,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2399102, now seen corresponding path program 1 times [2025-03-17 14:56:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:42,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671577563] [2025-03-17 14:56:42,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:42,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:56:42,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:56:42,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:42,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:42,628 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:56:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:42,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671577563] [2025-03-17 14:56:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671577563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:42,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:42,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:56:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292824613] [2025-03-17 14:56:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:42,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:56:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:42,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:56:42,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:56:42,652 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:42,710 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-03-17 14:56:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:56:42,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 14:56:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:42,717 INFO L225 Difference]: With dead ends: 42 [2025-03-17 14:56:42,717 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 14:56:42,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:42,722 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:42,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 14:56:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 14:56:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 30 states have internal predecessors, (37), 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:56:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-17 14:56:42,753 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 4 [2025-03-17 14:56:42,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:42,754 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-17 14:56:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-17 14:56:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:56:42,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:42,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:56:42,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:56:42,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:42,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash 74372172, now seen corresponding path program 1 times [2025-03-17 14:56:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962170628] [2025-03-17 14:56:42,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:42,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:56:42,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:56:42,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:42,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:42,903 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:56:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:42,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962170628] [2025-03-17 14:56:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962170628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:42,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:56:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930283971] [2025-03-17 14:56:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:42,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:56:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:42,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:56:42,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:56:42,906 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:42,941 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-17 14:56:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:56:42,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 14:56:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:42,942 INFO L225 Difference]: With dead ends: 32 [2025-03-17 14:56:42,943 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 14:56:42,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:42,944 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:42,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 14:56:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-17 14:56:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 29 states have internal predecessors, (36), 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:56:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-17 14:56:42,948 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 5 [2025-03-17 14:56:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:42,948 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-17 14:56:42,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-17 14:56:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:56:42,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:42,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:56:42,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1541955317, now seen corresponding path program 1 times [2025-03-17 14:56:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097934983] [2025-03-17 14:56:42,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:42,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:56:42,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:56:42,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:42,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:43,033 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:56:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:43,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097934983] [2025-03-17 14:56:43,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097934983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:43,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:43,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:56:43,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715937709] [2025-03-17 14:56:43,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:43,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:56:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:43,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:56:43,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:43,035 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:56:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:43,075 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-03-17 14:56:43,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:56:43,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:56:43,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:43,076 INFO L225 Difference]: With dead ends: 59 [2025-03-17 14:56:43,076 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 14:56:43,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:56:43,076 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 60 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:43,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 78 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 14:56:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2025-03-17 14:56:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 48 states have internal predecessors, (66), 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:56:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2025-03-17 14:56:43,080 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 7 [2025-03-17 14:56:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:43,081 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2025-03-17 14:56:43,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:56:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2025-03-17 14:56:43,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:56:43,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:43,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:43,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:56:43,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:43,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:43,082 INFO L85 PathProgramCache]: Analyzing trace with hash -555974570, now seen corresponding path program 1 times [2025-03-17 14:56:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558201008] [2025-03-17 14:56:43,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:43,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:56:43,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:56:43,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:43,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:43,151 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:56:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:43,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558201008] [2025-03-17 14:56:43,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558201008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:43,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:43,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:56:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188275760] [2025-03-17 14:56:43,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:43,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:56:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:43,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:56:43,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:56:43,152 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:43,199 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2025-03-17 14:56:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:56:43,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 14:56:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:43,200 INFO L225 Difference]: With dead ends: 97 [2025-03-17 14:56:43,201 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 14:56:43,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:43,202 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:43,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 14:56:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2025-03-17 14:56:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 86 states have internal predecessors, (125), 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:56:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-03-17 14:56:43,213 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 8 [2025-03-17 14:56:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:43,213 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-03-17 14:56:43,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-03-17 14:56:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:56:43,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:43,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:56:43,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:43,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:43,215 INFO L85 PathProgramCache]: Analyzing trace with hash -555950737, now seen corresponding path program 1 times [2025-03-17 14:56:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018688285] [2025-03-17 14:56:43,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:43,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:56:43,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:56:43,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:43,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:43,248 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:56:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018688285] [2025-03-17 14:56:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018688285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:43,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:43,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:56:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79408090] [2025-03-17 14:56:43,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:56:43,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:43,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:56:43,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:56:43,251 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:43,281 INFO L93 Difference]: Finished difference Result 158 states and 225 transitions. [2025-03-17 14:56:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:56:43,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 14:56:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:43,289 INFO L225 Difference]: With dead ends: 158 [2025-03-17 14:56:43,289 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 14:56:43,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:56:43,289 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:43,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 14:56:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 14:56:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 90 states have internal predecessors, (129), 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:56:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-03-17 14:56:43,300 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 8 [2025-03-17 14:56:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:43,302 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-03-17 14:56:43,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-03-17 14:56:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:56:43,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:43,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:56:43,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:43,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash -854065016, now seen corresponding path program 1 times [2025-03-17 14:56:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959660932] [2025-03-17 14:56:43,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:43,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:56:43,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:56:43,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:43,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:43,417 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:56:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959660932] [2025-03-17 14:56:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959660932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:43,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:56:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888247275] [2025-03-17 14:56:43,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:43,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:56:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:43,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:56:43,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:43,421 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:43,465 INFO L93 Difference]: Finished difference Result 220 states and 310 transitions. [2025-03-17 14:56:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:56:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 14:56:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:43,466 INFO L225 Difference]: With dead ends: 220 [2025-03-17 14:56:43,467 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 14:56:43,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:56:43,467 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 49 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:43,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 73 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 14:56:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 63. [2025-03-17 14:56:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 62 states have internal predecessors, (86), 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:56:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-17 14:56:43,478 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 9 [2025-03-17 14:56:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:43,478 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-17 14:56:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-17 14:56:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:56:43,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:43,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:43,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:56:43,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:43,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:43,481 INFO L85 PathProgramCache]: Analyzing trace with hash -706187886, now seen corresponding path program 1 times [2025-03-17 14:56:43,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:43,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25466598] [2025-03-17 14:56:43,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:43,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:43,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:56:43,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:56:43,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:43,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:43,608 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:56:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25466598] [2025-03-17 14:56:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25466598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:43,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:43,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:56:43,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4211254] [2025-03-17 14:56:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:43,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:56:43,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:43,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:56:43,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:56:43,610 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:43,722 INFO L93 Difference]: Finished difference Result 133 states and 175 transitions. [2025-03-17 14:56:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:56:43,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 14:56:43,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:43,723 INFO L225 Difference]: With dead ends: 133 [2025-03-17 14:56:43,723 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 14:56:43,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:56:43,723 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 74 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:43,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:56:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 14:56:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2025-03-17 14:56:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 111 states have internal predecessors, (158), 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:56:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2025-03-17 14:56:43,730 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 10 [2025-03-17 14:56:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:43,730 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2025-03-17 14:56:43,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2025-03-17 14:56:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:56:43,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:43,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:43,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:56:43,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:43,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1714784938, now seen corresponding path program 1 times [2025-03-17 14:56:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667967184] [2025-03-17 14:56:43,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:43,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:56:43,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:56:43,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:43,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:43,772 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:56:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667967184] [2025-03-17 14:56:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667967184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:43,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:43,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:56:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205664827] [2025-03-17 14:56:43,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:43,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:56:43,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:43,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:56:43,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:43,773 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:43,798 INFO L93 Difference]: Finished difference Result 245 states and 343 transitions. [2025-03-17 14:56:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:56:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 14:56:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:43,801 INFO L225 Difference]: With dead ends: 245 [2025-03-17 14:56:43,801 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 14:56:43,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:43,802 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:43,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 14:56:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 14:56:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.402061855670103) internal successors, (136), 103 states have internal predecessors, (136), 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:56:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2025-03-17 14:56:43,808 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 10 [2025-03-17 14:56:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:43,811 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2025-03-17 14:56:43,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2025-03-17 14:56:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:56:43,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:43,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:43,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:56:43,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:43,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash -416987993, now seen corresponding path program 1 times [2025-03-17 14:56:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:43,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984186561] [2025-03-17 14:56:43,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:43,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:56:43,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:56:43,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:43,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:43,962 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:56:43,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:43,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984186561] [2025-03-17 14:56:43,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984186561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:43,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:43,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:56:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30952040] [2025-03-17 14:56:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:43,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:56:43,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:43,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:56:43,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:56:43,963 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:44,039 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2025-03-17 14:56:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:56:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:56:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:44,040 INFO L225 Difference]: With dead ends: 124 [2025-03-17 14:56:44,040 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 14:56:44,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:56:44,040 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:44,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 88 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:56:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 14:56:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2025-03-17 14:56:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 103 states have internal predecessors, (134), 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:56:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2025-03-17 14:56:44,048 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 11 [2025-03-17 14:56:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:44,048 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2025-03-17 14:56:44,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2025-03-17 14:56:44,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:56:44,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:44,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:44,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:56:44,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:44,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash 559440179, now seen corresponding path program 1 times [2025-03-17 14:56:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096483986] [2025-03-17 14:56:44,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:44,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:56:44,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:56:44,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:44,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:44,231 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:56:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:44,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096483986] [2025-03-17 14:56:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096483986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:44,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:44,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:56:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531511066] [2025-03-17 14:56:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:44,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:56:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:44,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:56:44,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:56:44,232 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:44,337 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2025-03-17 14:56:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:56:44,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:56:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:44,338 INFO L225 Difference]: With dead ends: 105 [2025-03-17 14:56:44,338 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 14:56:44,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:56:44,339 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:44,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:56:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 14:56:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 14:56:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 103 states have internal predecessors, (130), 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:56:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2025-03-17 14:56:44,343 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 12 [2025-03-17 14:56:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:44,343 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2025-03-17 14:56:44,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2025-03-17 14:56:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:56:44,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:44,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:44,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:56:44,344 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:44,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash 162776358, now seen corresponding path program 1 times [2025-03-17 14:56:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376507443] [2025-03-17 14:56:44,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:44,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:56:44,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:56:44,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:44,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:44,465 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:56:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376507443] [2025-03-17 14:56:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376507443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:44,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:56:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871804480] [2025-03-17 14:56:44,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:44,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:56:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:44,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:56:44,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:56:44,467 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:44,531 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2025-03-17 14:56:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:56:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 14:56:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:44,535 INFO L225 Difference]: With dead ends: 149 [2025-03-17 14:56:44,535 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 14:56:44,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:56:44,536 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:44,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 14:56:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 103. [2025-03-17 14:56:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 102 states have internal predecessors, (126), 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:56:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2025-03-17 14:56:44,542 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2025-03-17 14:56:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:44,542 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2025-03-17 14:56:44,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:56:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2025-03-17 14:56:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:56:44,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:44,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:44,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:56:44,543 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1443887729, now seen corresponding path program 1 times [2025-03-17 14:56:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288923329] [2025-03-17 14:56:44,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:44,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:56:44,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:56:44,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:44,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:44,615 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:56:44,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288923329] [2025-03-17 14:56:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288923329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:44,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:44,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:56:44,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709185849] [2025-03-17 14:56:44,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:44,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:56:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:44,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:56:44,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:44,616 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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:56:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:44,661 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2025-03-17 14:56:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:56:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2025-03-17 14:56:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:44,663 INFO L225 Difference]: With dead ends: 111 [2025-03-17 14:56:44,663 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 14:56:44,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:56:44,663 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:44,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 14:56:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2025-03-17 14:56:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 99 states have (on average 1.292929292929293) internal successors, (128), 104 states have internal predecessors, (128), 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:56:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2025-03-17 14:56:44,668 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2025-03-17 14:56:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:44,669 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2025-03-17 14:56:44,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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:56:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2025-03-17 14:56:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:56:44,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:44,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:44,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:56:44,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:44,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1810839711, now seen corresponding path program 1 times [2025-03-17 14:56:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:44,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859053970] [2025-03-17 14:56:44,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:44,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:56:44,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:56:44,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:44,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:44,807 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:56:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859053970] [2025-03-17 14:56:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859053970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:56:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870112498] [2025-03-17 14:56:44,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:56:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:44,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:56:44,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:56:44,808 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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:56:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:44,946 INFO L93 Difference]: Finished difference Result 222 states and 261 transitions. [2025-03-17 14:56:44,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:56:44,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2025-03-17 14:56:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:44,947 INFO L225 Difference]: With dead ends: 222 [2025-03-17 14:56:44,947 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 14:56:44,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:56:44,948 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 64 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:44,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 158 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:56:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 14:56:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 104. [2025-03-17 14:56:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 103 states have internal predecessors, (125), 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:56:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-03-17 14:56:44,953 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 15 [2025-03-17 14:56:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:44,953 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-03-17 14:56:44,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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:56:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-03-17 14:56:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:56:44,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:44,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:44,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:56:44,954 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1810846662, now seen corresponding path program 1 times [2025-03-17 14:56:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944720176] [2025-03-17 14:56:44,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:44,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:56:44,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:56:44,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:45,005 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:56:45,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:45,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944720176] [2025-03-17 14:56:45,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944720176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:45,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:45,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:56:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439943369] [2025-03-17 14:56:45,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:45,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:56:45,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:45,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:56:45,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:56:45,007 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:56:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:45,027 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2025-03-17 14:56:45,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:56:45,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2025-03-17 14:56:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:45,028 INFO L225 Difference]: With dead ends: 104 [2025-03-17 14:56:45,028 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 14:56:45,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:45,029 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:45,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 14:56:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 14:56:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 102 states have internal predecessors, (123), 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:56:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2025-03-17 14:56:45,032 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 15 [2025-03-17 14:56:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:45,033 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2025-03-17 14:56:45,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:56:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2025-03-17 14:56:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:56:45,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:45,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:45,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:56:45,033 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:45,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash -301456211, now seen corresponding path program 1 times [2025-03-17 14:56:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:45,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597467362] [2025-03-17 14:56:45,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:45,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:45,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:56:45,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:56:45,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:45,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:45,113 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:56:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597467362] [2025-03-17 14:56:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597467362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:45,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:56:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868062172] [2025-03-17 14:56:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:45,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:56:45,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:45,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:56:45,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:56:45,114 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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:56:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:45,170 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2025-03-17 14:56:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:56:45,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 16 [2025-03-17 14:56:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:45,171 INFO L225 Difference]: With dead ends: 150 [2025-03-17 14:56:45,171 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 14:56:45,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:56:45,172 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 57 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:45,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 14:56:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2025-03-17 14:56:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 138 states have internal predecessors, (168), 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:56:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2025-03-17 14:56:45,182 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 16 [2025-03-17 14:56:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2025-03-17 14:56:45,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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:56:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2025-03-17 14:56:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:56:45,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:45,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:45,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:56:45,183 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:45,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:45,183 INFO L85 PathProgramCache]: Analyzing trace with hash 252395696, now seen corresponding path program 1 times [2025-03-17 14:56:45,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859073173] [2025-03-17 14:56:45,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:45,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:56:45,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:56:45,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:45,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:45,257 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:56:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859073173] [2025-03-17 14:56:45,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859073173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:45,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:56:45,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457050782] [2025-03-17 14:56:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:45,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:56:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:45,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:56:45,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:45,259 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:56:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:45,293 INFO L93 Difference]: Finished difference Result 241 states and 287 transitions. [2025-03-17 14:56:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:56:45,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2025-03-17 14:56:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:45,297 INFO L225 Difference]: With dead ends: 241 [2025-03-17 14:56:45,297 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 14:56:45,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:56:45,297 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:45,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 14:56:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2025-03-17 14:56:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 131 states have (on average 1.16793893129771) internal successors, (153), 133 states have internal predecessors, (153), 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:56:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2025-03-17 14:56:45,306 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 16 [2025-03-17 14:56:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:45,306 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2025-03-17 14:56:45,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:56:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2025-03-17 14:56:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:56:45,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:45,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:45,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:56:45,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:45,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:45,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2034310030, now seen corresponding path program 1 times [2025-03-17 14:56:45,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:45,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84023250] [2025-03-17 14:56:45,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:45,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:45,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:56:45,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:56:45,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:45,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:45,349 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:56:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84023250] [2025-03-17 14:56:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84023250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:56:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067831064] [2025-03-17 14:56:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:45,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:56:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:45,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:56:45,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:56:45,351 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:56:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:45,367 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2025-03-17 14:56:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:56:45,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 14:56:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:45,369 INFO L225 Difference]: With dead ends: 134 [2025-03-17 14:56:45,369 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 14:56:45,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:56:45,369 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:45,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 14:56:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 14:56:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 1.1603053435114503) internal successors, (152), 132 states have internal predecessors, (152), 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:56:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2025-03-17 14:56:45,374 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 18 [2025-03-17 14:56:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:45,375 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2025-03-17 14:56:45,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:56:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2025-03-17 14:56:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:56:45,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:45,375 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:45,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:56:45,375 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -174556884, now seen corresponding path program 1 times [2025-03-17 14:56:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629993174] [2025-03-17 14:56:45,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:45,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:56:45,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:56:45,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:45,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:56:45,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:45,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629993174] [2025-03-17 14:56:45,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629993174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:56:45,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:56:45,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:56:45,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634347918] [2025-03-17 14:56:45,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:56:45,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:56:45,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:45,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:56:45,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:56:45,470 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:56:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:45,531 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2025-03-17 14:56:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:56:45,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2025-03-17 14:56:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:45,533 INFO L225 Difference]: With dead ends: 190 [2025-03-17 14:56:45,533 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 14:56:45,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:56:45,534 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:45,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 151 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 14:56:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98. [2025-03-17 14:56:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 97 states have internal predecessors, (111), 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:56:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-03-17 14:56:45,540 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 22 [2025-03-17 14:56:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:45,540 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-03-17 14:56:45,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:56:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-03-17 14:56:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 14:56:45,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:45,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:45,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:56:45,542 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:45,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1131864533, now seen corresponding path program 1 times [2025-03-17 14:56:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029522607] [2025-03-17 14:56:45,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:45,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:56:45,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:56:45,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:45,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:56:45,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:45,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029522607] [2025-03-17 14:56:45,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029522607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:56:45,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633017658] [2025-03-17 14:56:45,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:56:45,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:56:45,712 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:56:45,714 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:56:45,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:56:45,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:56:45,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:45,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:45,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:56:45,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:56:45,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-03-17 14:56:45,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-17 14:56:45,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 14:56:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:56:45,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:56:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:56:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633017658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:56:46,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:56:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-17 14:56:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833391909] [2025-03-17 14:56:46,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:56:46,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 14:56:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:46,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 14:56:46,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:56:46,038 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 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:56:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:46,227 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2025-03-17 14:56:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:56:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 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 25 [2025-03-17 14:56:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:46,228 INFO L225 Difference]: With dead ends: 174 [2025-03-17 14:56:46,228 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 14:56:46,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:56:46,229 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:46,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:56:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 14:56:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2025-03-17 14:56:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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:56:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-17 14:56:46,232 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2025-03-17 14:56:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:46,232 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-17 14:56:46,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 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:56:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-17 14:56:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 14:56:46,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:56:46,233 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:46,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:56:46,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:56:46,434 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:56:46,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:56:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1154888725, now seen corresponding path program 1 times [2025-03-17 14:56:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:56:46,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625501377] [2025-03-17 14:56:46,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:56:46,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:56:46,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:56:46,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:46,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:56:46,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:56:46,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625501377] [2025-03-17 14:56:46,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625501377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:56:46,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409221970] [2025-03-17 14:56:46,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:56:46,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:56:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:56:46,526 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:56:46,528 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:56:46,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:56:46,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:56:46,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:56:46,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:56:46,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:56:46,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:56:46,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:56:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:56:46,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:56:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:56:46,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409221970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:56:46,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:56:46,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-17 14:56:46,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711429857] [2025-03-17 14:56:46,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:56:46,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:56:46,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:56:46,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:56:46,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:56:46,670 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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:56:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:56:46,698 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2025-03-17 14:56:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:56:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 39 [2025-03-17 14:56:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:56:46,699 INFO L225 Difference]: With dead ends: 85 [2025-03-17 14:56:46,699 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:56:46,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:56:46,700 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:56:46,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:56:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:56:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:56:46,702 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:56:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:56:46,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2025-03-17 14:56:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:56:46,702 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:56:46,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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:56:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:56:46,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:56:46,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-17 14:56:46,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-17 14:56:46,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-17 14:56:46,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-17 14:56:46,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-17 14:56:46,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-17 14:56:46,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-17 14:56:46,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-17 14:56:46,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-17 14:56:46,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-17 14:56:46,714 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:56:46,908 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,SelfDestructingSolverStorable19 [2025-03-17 14:56:46,910 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:56:46,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:56:47,105 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:56:47,111 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 14:56:47,111 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 14:56:47,111 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 14:56:47,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-17 14:56:47,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:56:47 BoogieIcfgContainer [2025-03-17 14:56:47,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:56:47,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:56:47,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:56:47,114 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:56:47,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:42" (3/4) ... [2025-03-17 14:56:47,116 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:56:47,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 14:56:47,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:56:47,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 14:56:47,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:56:47,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:56:47,184 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:56:47,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:56:47,185 INFO L158 Benchmark]: Toolchain (without parser) took 5544.29ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 108.6MB in the beginning and 90.3MB in the end (delta: 18.3MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2025-03-17 14:56:47,185 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:56:47,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.42ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 92.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:56:47,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.41ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:56:47,185 INFO L158 Benchmark]: Boogie Preprocessor took 18.99ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:56:47,185 INFO L158 Benchmark]: IcfgBuilder took 277.11ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 73.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:56:47,186 INFO L158 Benchmark]: TraceAbstraction took 4871.57ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 73.3MB in the beginning and 96.7MB in the end (delta: -23.5MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2025-03-17 14:56:47,186 INFO L158 Benchmark]: Witness Printer took 70.16ms. Allocated memory is still 218.1MB. Free memory was 96.7MB in the beginning and 90.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:56:47,188 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.29ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.42ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 92.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.41ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.99ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 277.11ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 73.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4871.57ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 73.3MB in the beginning and 96.7MB in the end (delta: -23.5MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * Witness Printer took 70.16ms. Allocated memory is still 218.1MB. Free memory was 96.7MB in the beginning and 90.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * 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: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 44 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 640 mSDsluCounter, 1873 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1297 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1097 IncrementalHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 576 mSDtfsCounter, 1097 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=15, InterpolantAutomatonStates: 125, 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, 20 MinimizatonAttempts, 418 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 2344 SizeOfPredicates, 9 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 115/121 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 14:56:47,203 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