./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:45:59,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:45:59,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:45:59,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:45:59,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:45:59,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:45:59,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:45:59,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:45:59,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:45:59,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:45:59,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:45:59,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:45:59,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:45:59,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:45:59,201 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:45:59,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:45:59,202 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:45:59,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:45:59,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:45:59,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:45:59,204 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 [2025-03-17 15:45:59,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:45:59,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:45:59,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:45:59,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:45:59,441 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:45:59,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2025-03-17 15:46:00,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ec6dfa4/b82dc6f6cf084636b7386040e1d9027e/FLAG7bda42326 [2025-03-17 15:46:00,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:46:00,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2025-03-17 15:46:00,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ec6dfa4/b82dc6f6cf084636b7386040e1d9027e/FLAG7bda42326 [2025-03-17 15:46:00,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ec6dfa4/b82dc6f6cf084636b7386040e1d9027e [2025-03-17 15:46:00,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:46:00,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:46:00,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:46:00,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:46:00,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:46:00,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:46:00" (1/1) ... [2025-03-17 15:46:00,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:00, skipping insertion in model container [2025-03-17 15:46:00,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:46:00" (1/1) ... [2025-03-17 15:46:00,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:46:00,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:46:00,996 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:46:01,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:46:01,018 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:46:01,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01 WrapperNode [2025-03-17 15:46:01,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:46:01,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:46:01,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:46:01,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:46:01,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,035 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2025-03-17 15:46:01,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:46:01,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:46:01,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:46:01,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:46:01,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:46:01,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,060 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:46:01,065 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:46:01,066 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:46:01,066 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:46:01,067 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (1/1) ... [2025-03-17 15:46:01,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:46:01,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:01,093 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 15:46:01,098 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 15:46:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:46:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:46:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2025-03-17 15:46:01,116 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2025-03-17 15:46:01,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:46:01,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:46:01,116 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-17 15:46:01,116 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-17 15:46:01,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:46:01,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:46:01,239 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc #t~ret5; [2025-03-17 15:46:01,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: havoc #t~ret4; [2025-03-17 15:46:01,278 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 15:46:01,278 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:46:01,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:46:01,287 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:46:01,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:01 BoogieIcfgContainer [2025-03-17 15:46:01,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:46:01,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:46:01,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:46:01,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:46:01,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:46:00" (1/3) ... [2025-03-17 15:46:01,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42533663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:01, skipping insertion in model container [2025-03-17 15:46:01,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:01" (2/3) ... [2025-03-17 15:46:01,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42533663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:01, skipping insertion in model container [2025-03-17 15:46:01,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:01" (3/3) ... [2025-03-17 15:46:01,296 INFO L128 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2025-03-17 15:46:01,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:46:01,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id2_i5_o5-2.c that has 3 procedures, 35 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-17 15:46:01,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:46:01,357 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;@80ffb67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:46:01,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 15:46:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:46:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:46:01,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:01,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:46:01,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:01,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash 48296141, now seen corresponding path program 1 times [2025-03-17 15:46:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:01,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37324577] [2025-03-17 15:46:01,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:01,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:01,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:46:01,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:46:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:01,531 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 15:46:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:01,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37324577] [2025-03-17 15:46:01,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37324577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:01,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:01,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:46:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694637137] [2025-03-17 15:46:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:01,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:46:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:01,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:46:01,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:46:01,554 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:01,642 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-03-17 15:46:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:46:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 15:46:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:01,649 INFO L225 Difference]: With dead ends: 56 [2025-03-17 15:46:01,649 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 15:46:01,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:01,653 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:01,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 120 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:46:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 15:46:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-03-17 15:46:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.5) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:46:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-17 15:46:01,690 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 5 [2025-03-17 15:46:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:01,691 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-17 15:46:01,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-17 15:46:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:46:01,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:01,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:46:01,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:46:01,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:01,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1497180370, now seen corresponding path program 1 times [2025-03-17 15:46:01,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:01,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100763023] [2025-03-17 15:46:01,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:01,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:46:01,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:46:01,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:01,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:01,751 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 15:46:01,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:01,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100763023] [2025-03-17 15:46:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100763023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:01,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:01,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:46:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969228022] [2025-03-17 15:46:01,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:01,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:46:01,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:01,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:46:01,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:46:01,753 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:01,789 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-03-17 15:46:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:46:01,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:46:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:01,791 INFO L225 Difference]: With dead ends: 41 [2025-03-17 15:46:01,791 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 15:46:01,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:01,792 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:01,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 109 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 15:46:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-17 15:46:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:46:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-17 15:46:01,801 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 6 [2025-03-17 15:46:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:01,801 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-17 15:46:01,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-17 15:46:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 15:46:01,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:01,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:01,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:46:01,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:01,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:01,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1308807725, now seen corresponding path program 1 times [2025-03-17 15:46:01,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:01,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446614428] [2025-03-17 15:46:01,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:01,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:01,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:46:01,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:46:01,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:01,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:01,874 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 15:46:01,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:01,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446614428] [2025-03-17 15:46:01,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446614428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:01,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:01,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:46:01,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025422671] [2025-03-17 15:46:01,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:01,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:46:01,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:01,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:46:01,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:46:01,877 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:01,961 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-03-17 15:46:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:46:01,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 15:46:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:01,963 INFO L225 Difference]: With dead ends: 61 [2025-03-17 15:46:01,963 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 15:46:01,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:46:01,964 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:01,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 132 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:46:01,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 15:46:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2025-03-17 15:46:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.4375) internal successors, (46), 39 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 15:46:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-03-17 15:46:01,976 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 10 [2025-03-17 15:46:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:01,976 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-03-17 15:46:01,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-03-17 15:46:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 15:46:01,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:01,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:01,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:46:01,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:01,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1918333834, now seen corresponding path program 1 times [2025-03-17 15:46:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538887662] [2025-03-17 15:46:01,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:01,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:46:01,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:46:01,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:01,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:02,069 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 15:46:02,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538887662] [2025-03-17 15:46:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538887662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:02,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:02,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:46:02,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308880720] [2025-03-17 15:46:02,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:02,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:46:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:02,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:46:02,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:46:02,071 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:02,147 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-03-17 15:46:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:46:02,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 15:46:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:02,150 INFO L225 Difference]: With dead ends: 52 [2025-03-17 15:46:02,150 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 15:46:02,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:46:02,150 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:02,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:46:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 15:46:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-03-17 15:46:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.34375) internal successors, (43), 37 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 15:46:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-03-17 15:46:02,162 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 11 [2025-03-17 15:46:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:02,162 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-03-17 15:46:02,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-03-17 15:46:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:46:02,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:02,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:02,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:46:02,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:02,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash 889496401, now seen corresponding path program 1 times [2025-03-17 15:46:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477516] [2025-03-17 15:46:02,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:02,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:46:02,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:46:02,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:02,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:02,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:02,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477516] [2025-03-17 15:46:02,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:02,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562890586] [2025-03-17 15:46:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:02,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:02,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:02,273 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 15:46:02,274 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 15:46:02,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:46:02,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:46:02,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:02,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:46:02,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:02,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:02,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562890586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:02,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:02,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-17 15:46:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274594535] [2025-03-17 15:46:02,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:02,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:46:02,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:02,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:46:02,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:46:02,477 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:02,639 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-03-17 15:46:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:46:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 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 15:46:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:02,640 INFO L225 Difference]: With dead ends: 108 [2025-03-17 15:46:02,640 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 15:46:02,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:46:02,641 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 132 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:02,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 200 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:46:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 15:46:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2025-03-17 15:46:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 61 states have internal predecessors, (75), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:46:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-17 15:46:02,648 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 15 [2025-03-17 15:46:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:02,649 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-17 15:46:02,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-03-17 15:46:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 15:46:02,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:02,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:02,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:46:02,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:02,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:02,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash 759621333, now seen corresponding path program 1 times [2025-03-17 15:46:02,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:02,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305814731] [2025-03-17 15:46:02,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:02,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:46:02,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:46:02,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:02,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:46:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305814731] [2025-03-17 15:46:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305814731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:02,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:02,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:46:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219923764] [2025-03-17 15:46:02,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:02,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:46:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:02,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:46:02,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:46:02,921 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:46:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:02,940 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-03-17 15:46:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:46:02,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-17 15:46:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:02,943 INFO L225 Difference]: With dead ends: 91 [2025-03-17 15:46:02,943 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 15:46:02,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:46:02,943 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:02,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 15:46:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 15:46:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 71 states have internal predecessors, (86), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-17 15:46:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2025-03-17 15:46:02,954 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 23 [2025-03-17 15:46:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:02,955 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2025-03-17 15:46:02,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:46:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2025-03-17 15:46:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 15:46:02,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:02,955 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:02,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:46:02,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:02,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 301407307, now seen corresponding path program 1 times [2025-03-17 15:46:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:02,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126348453] [2025-03-17 15:46:02,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:02,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:46:02,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:46:02,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:02,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 15:46:03,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:03,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126348453] [2025-03-17 15:46:03,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126348453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:03,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:03,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:46:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205598134] [2025-03-17 15:46:03,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:03,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:46:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:03,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:46:03,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:46:03,008 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:46:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:03,029 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2025-03-17 15:46:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:46:03,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-17 15:46:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:03,032 INFO L225 Difference]: With dead ends: 101 [2025-03-17 15:46:03,032 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 15:46:03,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:46:03,033 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 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 15:46:03,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 15:46:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 15:46:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 79 states have internal predecessors, (94), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-17 15:46:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2025-03-17 15:46:03,049 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 28 [2025-03-17 15:46:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:03,049 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2025-03-17 15:46:03,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:46:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2025-03-17 15:46:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 15:46:03,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:03,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:03,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:46:03,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:03,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:03,052 INFO L85 PathProgramCache]: Analyzing trace with hash 338773732, now seen corresponding path program 1 times [2025-03-17 15:46:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:03,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949134082] [2025-03-17 15:46:03,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:03,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:03,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:46:03,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:46:03,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:03,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:46:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949134082] [2025-03-17 15:46:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949134082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:46:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403167002] [2025-03-17 15:46:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:03,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:46:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:03,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:46:03,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:46:03,076 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:46:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:03,083 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-03-17 15:46:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:46:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-17 15:46:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:03,084 INFO L225 Difference]: With dead ends: 99 [2025-03-17 15:46:03,084 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 15:46:03,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:46:03,085 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:03,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 15:46:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 15:46:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 78 states have internal predecessors, (91), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-17 15:46:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-03-17 15:46:03,097 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 28 [2025-03-17 15:46:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:03,097 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-03-17 15:46:03,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:46:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-03-17 15:46:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 15:46:03,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:03,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-03-17 15:46:03,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:46:03,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1668226357, now seen corresponding path program 1 times [2025-03-17 15:46:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:03,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526346865] [2025-03-17 15:46:03,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:03,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:03,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:46:03,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:46:03,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:03,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526346865] [2025-03-17 15:46:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526346865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7764257] [2025-03-17 15:46:03,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:03,252 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 15:46:03,253 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 15:46:03,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:46:03,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:46:03,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:03,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:03,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:46:03,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:03,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7764257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:03,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-03-17 15:46:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991055804] [2025-03-17 15:46:03,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 15:46:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:03,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 15:46:03,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-03-17 15:46:03,550 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 28 states, 25 states have (on average 1.92) internal successors, (48), 15 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:03,882 INFO L93 Difference]: Finished difference Result 241 states and 259 transitions. [2025-03-17 15:46:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 15:46:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.92) internal successors, (48), 15 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 15:46:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:03,884 INFO L225 Difference]: With dead ends: 241 [2025-03-17 15:46:03,884 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 15:46:03,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 15:46:03,885 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 275 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:03,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 438 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:46:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 15:46:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2025-03-17 15:46:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.205298013245033) internal successors, (182), 154 states have internal predecessors, (182), 15 states have call successors, (15), 14 states have call predecessors, (15), 22 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2025-03-17 15:46:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 221 transitions. [2025-03-17 15:46:03,904 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 221 transitions. Word has length 30 [2025-03-17 15:46:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:03,904 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 221 transitions. [2025-03-17 15:46:03,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.92) internal successors, (48), 15 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 221 transitions. [2025-03-17 15:46:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 15:46:03,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:03,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:03,910 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 15:46:04,105 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,SelfDestructingSolverStorable8 [2025-03-17 15:46:04,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -376636413, now seen corresponding path program 1 times [2025-03-17 15:46:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941243838] [2025-03-17 15:46:04,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:04,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:46:04,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:46:04,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:04,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:46:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941243838] [2025-03-17 15:46:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941243838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:04,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:46:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830362381] [2025-03-17 15:46:04,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:04,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:46:04,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:04,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:46:04,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:04,172 INFO L87 Difference]: Start difference. First operand 193 states and 221 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:46:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:04,198 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2025-03-17 15:46:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:46:04,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-03-17 15:46:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:04,201 INFO L225 Difference]: With dead ends: 222 [2025-03-17 15:46:04,202 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 15:46:04,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:04,203 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:04,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 15:46:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 198. [2025-03-17 15:46:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.2) internal successors, (186), 158 states have internal predecessors, (186), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2025-03-17 15:46:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2025-03-17 15:46:04,214 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 39 [2025-03-17 15:46:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:04,214 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2025-03-17 15:46:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:46:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2025-03-17 15:46:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 15:46:04,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:04,215 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:04,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:46:04,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:04,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash 539794486, now seen corresponding path program 1 times [2025-03-17 15:46:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053939416] [2025-03-17 15:46:04,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:04,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:46:04,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:46:04,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:04,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:46:04,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:04,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053939416] [2025-03-17 15:46:04,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053939416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:04,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:46:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805492233] [2025-03-17 15:46:04,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:04,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:46:04,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:04,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:46:04,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:46:04,246 INFO L87 Difference]: Start difference. First operand 198 states and 226 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:46:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:04,256 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2025-03-17 15:46:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:46:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-03-17 15:46:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:04,258 INFO L225 Difference]: With dead ends: 198 [2025-03-17 15:46:04,258 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 15:46:04,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:46:04,259 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:04,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 15:46:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-17 15:46:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.1548387096774193) internal successors, (179), 157 states have internal predecessors, (179), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2025-03-17 15:46:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2025-03-17 15:46:04,270 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 43 [2025-03-17 15:46:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:04,272 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2025-03-17 15:46:04,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:46:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2025-03-17 15:46:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:46:04,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:04,273 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:04,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:46:04,273 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash -446240125, now seen corresponding path program 1 times [2025-03-17 15:46:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751651785] [2025-03-17 15:46:04,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:04,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:46:04,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:46:04,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:04,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:46:04,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:04,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751651785] [2025-03-17 15:46:04,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751651785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:04,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:04,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:46:04,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952782839] [2025-03-17 15:46:04,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:04,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:46:04,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:04,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:46:04,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:04,323 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:46:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:04,346 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2025-03-17 15:46:04,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:46:04,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-17 15:46:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:04,348 INFO L225 Difference]: With dead ends: 246 [2025-03-17 15:46:04,348 INFO L226 Difference]: Without dead ends: 245 [2025-03-17 15:46:04,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:04,348 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:04,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-17 15:46:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-03-17 15:46:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.1237113402061856) internal successors, (218), 195 states have internal predecessors, (218), 15 states have call successors, (15), 14 states have call predecessors, (15), 32 states have return successors, (35), 35 states have call predecessors, (35), 14 states have call successors, (35) [2025-03-17 15:46:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 268 transitions. [2025-03-17 15:46:04,358 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 268 transitions. Word has length 44 [2025-03-17 15:46:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:04,358 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 268 transitions. [2025-03-17 15:46:04,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:46:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 268 transitions. [2025-03-17 15:46:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:46:04,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:04,359 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:04,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:46:04,359 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:04,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash 930283100, now seen corresponding path program 1 times [2025-03-17 15:46:04,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:04,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420455584] [2025-03-17 15:46:04,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:04,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:04,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:46:04,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:46:04,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:04,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:46:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420455584] [2025-03-17 15:46:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420455584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104289350] [2025-03-17 15:46:04,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:04,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:04,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:04,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:46:04,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:46:04,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:46:04,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:46:04,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:04,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:04,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:46:04,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:46:04,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:46:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104289350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:04,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:04,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-17 15:46:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773026037] [2025-03-17 15:46:04,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:04,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:46:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:04,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:46:04,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:46:04,660 INFO L87 Difference]: Start difference. First operand 245 states and 268 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 15:46:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:04,711 INFO L93 Difference]: Finished difference Result 345 states and 386 transitions. [2025-03-17 15:46:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:46:04,711 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 44 [2025-03-17 15:46:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:04,712 INFO L225 Difference]: With dead ends: 345 [2025-03-17 15:46:04,713 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 15:46:04,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:46:04,714 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:04,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 15:46:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 270. [2025-03-17 15:46:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 215 states have internal predecessors, (237), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2025-03-17 15:46:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 292 transitions. [2025-03-17 15:46:04,731 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 292 transitions. Word has length 44 [2025-03-17 15:46:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:04,731 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 292 transitions. [2025-03-17 15:46:04,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 15:46:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 292 transitions. [2025-03-17 15:46:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 15:46:04,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:04,734 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 15:46:04,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:46:04,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:04,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:04,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:04,937 INFO L85 PathProgramCache]: Analyzing trace with hash 953166788, now seen corresponding path program 1 times [2025-03-17 15:46:04,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:04,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23480874] [2025-03-17 15:46:04,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:04,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:04,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 15:46:04,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 15:46:04,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:04,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 15:46:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23480874] [2025-03-17 15:46:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23480874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585900346] [2025-03-17 15:46:05,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:05,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:05,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:46:05,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:46:05,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 15:46:05,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 15:46:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:05,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:46:05,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 15:46:05,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:46:05,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585900346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:05,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:05,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 17] total 19 [2025-03-17 15:46:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018637762] [2025-03-17 15:46:05,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:05,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:46:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:05,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:46:05,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:46:05,867 INFO L87 Difference]: Start difference. First operand 270 states and 292 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-17 15:46:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:06,008 INFO L93 Difference]: Finished difference Result 458 states and 495 transitions. [2025-03-17 15:46:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:46:06,009 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 59 [2025-03-17 15:46:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:06,010 INFO L225 Difference]: With dead ends: 458 [2025-03-17 15:46:06,010 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 15:46:06,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:46:06,011 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 85 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:06,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 192 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:46:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 15:46:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-17 15:46:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.088785046728972) internal successors, (233), 215 states have internal predecessors, (233), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2025-03-17 15:46:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 288 transitions. [2025-03-17 15:46:06,022 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 288 transitions. Word has length 59 [2025-03-17 15:46:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:06,022 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 288 transitions. [2025-03-17 15:46:06,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-17 15:46:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 288 transitions. [2025-03-17 15:46:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:46:06,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:06,023 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2025-03-17 15:46:06,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:46:06,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:06,224 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1184291611, now seen corresponding path program 2 times [2025-03-17 15:46:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:06,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612042417] [2025-03-17 15:46:06,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:46:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:06,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-17 15:46:06,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:46:06,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:46:06,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612042417] [2025-03-17 15:46:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612042417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980943574] [2025-03-17 15:46:06,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:46:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:06,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:46:06,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:46:06,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-17 15:46:06,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:46:06,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:46:06,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:06,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 15:46:06,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:06,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980943574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:07,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:07,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2025-03-17 15:46:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730622643] [2025-03-17 15:46:07,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-17 15:46:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:07,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-17 15:46:07,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2025-03-17 15:46:07,314 INFO L87 Difference]: Start difference. First operand 270 states and 288 transitions. Second operand has 56 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 29 states have internal predecessors, (104), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:08,044 INFO L93 Difference]: Finished difference Result 590 states and 614 transitions. [2025-03-17 15:46:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-17 15:46:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 29 states have internal predecessors, (104), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 15:46:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:08,046 INFO L225 Difference]: With dead ends: 590 [2025-03-17 15:46:08,046 INFO L226 Difference]: Without dead ends: 588 [2025-03-17 15:46:08,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2025-03-17 15:46:08,050 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 703 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:08,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 618 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:46:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-17 15:46:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 563. [2025-03-17 15:46:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 449 states have (on average 1.0846325167037862) internal successors, (487), 449 states have internal predecessors, (487), 28 states have call successors, (28), 27 states have call predecessors, (28), 82 states have return successors, (86), 86 states have call predecessors, (86), 27 states have call successors, (86) [2025-03-17 15:46:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 601 transitions. [2025-03-17 15:46:08,080 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 601 transitions. Word has length 65 [2025-03-17 15:46:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:08,080 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 601 transitions. [2025-03-17 15:46:08,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 29 states have internal predecessors, (104), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 601 transitions. [2025-03-17 15:46:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 15:46:08,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:08,081 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-17 15:46:08,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:46:08,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 15:46:08,282 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:08,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1644622415, now seen corresponding path program 1 times [2025-03-17 15:46:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:08,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649537126] [2025-03-17 15:46:08,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:08,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 15:46:08,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:46:08,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:08,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 15:46:08,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:08,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649537126] [2025-03-17 15:46:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649537126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:08,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768802026] [2025-03-17 15:46:08,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:08,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:08,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:08,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:46:08,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:46:08,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 15:46:08,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:46:08,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:08,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:08,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:46:08,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:46:08,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:46:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768802026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:09,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 38 [2025-03-17 15:46:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019774421] [2025-03-17 15:46:09,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:09,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 15:46:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:09,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 15:46:09,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 15:46:09,635 INFO L87 Difference]: Start difference. First operand 563 states and 601 transitions. Second operand has 38 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 15:46:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:09,968 INFO L93 Difference]: Finished difference Result 589 states and 627 transitions. [2025-03-17 15:46:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 15:46:09,968 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Word has length 69 [2025-03-17 15:46:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:09,969 INFO L225 Difference]: With dead ends: 589 [2025-03-17 15:46:09,969 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 15:46:09,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=2255, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 15:46:09,971 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 128 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:09,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 165 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:46:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 15:46:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2025-03-17 15:46:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 109 states have internal predecessors, (110), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2025-03-17 15:46:09,977 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 69 [2025-03-17 15:46:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:09,977 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2025-03-17 15:46:09,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 15:46:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2025-03-17 15:46:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 15:46:09,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:09,978 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1] [2025-03-17 15:46:09,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:46:10,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 15:46:10,179 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:10,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1409493085, now seen corresponding path program 2 times [2025-03-17 15:46:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:10,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-17 15:46:10,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:46:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:10,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-03-17 15:46:10,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 15:46:10,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:46:10,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-17 15:46:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465913524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062076935] [2025-03-17 15:46:11,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:46:11,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:11,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:11,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:46:11,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:46:11,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-03-17 15:46:11,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 15:46:11,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:46:11,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:11,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 15:46:11,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:11,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:12,716 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062076935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:12,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:12,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 106 [2025-03-17 15:46:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875240644] [2025-03-17 15:46:12,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:12,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2025-03-17 15:46:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:12,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2025-03-17 15:46:12,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2025-03-17 15:46:12,721 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand has 108 states, 105 states have (on average 1.980952380952381) internal successors, (208), 55 states have internal predecessors, (208), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:14,076 INFO L93 Difference]: Finished difference Result 276 states and 301 transitions. [2025-03-17 15:46:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-17 15:46:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 1.980952380952381) internal successors, (208), 55 states have internal predecessors, (208), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-17 15:46:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:14,077 INFO L225 Difference]: With dead ends: 276 [2025-03-17 15:46:14,077 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 15:46:14,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2025-03-17 15:46:14,083 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 581 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:14,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 97 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:46:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 15:46:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2025-03-17 15:46:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 216 states have (on average 1.0092592592592593) internal successors, (218), 217 states have internal predecessors, (218), 54 states have call successors, (54), 54 states have call predecessors, (54), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2025-03-17 15:46:14,094 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 130 [2025-03-17 15:46:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:14,094 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2025-03-17 15:46:14,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 1.980952380952381) internal successors, (208), 55 states have internal predecessors, (208), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2025-03-17 15:46:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-17 15:46:14,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:14,098 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1] [2025-03-17 15:46:14,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:46:14,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:14,299 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:14,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash -8574667, now seen corresponding path program 3 times [2025-03-17 15:46:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:14,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701546515] [2025-03-17 15:46:14,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:46:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:14,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 265 statements into 27 equivalence classes. [2025-03-17 15:46:14,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 265 of 265 statements. [2025-03-17 15:46:14,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-03-17 15:46:14,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701546515] [2025-03-17 15:46:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701546515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596458626] [2025-03-17 15:46:17,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:46:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:17,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:46:17,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:46:17,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 265 statements into 27 equivalence classes. [2025-03-17 15:46:17,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 265 of 265 statements. [2025-03-17 15:46:17,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-03-17 15:46:17,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:17,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-17 15:46:17,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:18,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:22,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596458626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:22,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:22,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 214 [2025-03-17 15:46:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729601047] [2025-03-17 15:46:22,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:22,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2025-03-17 15:46:22,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:22,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2025-03-17 15:46:22,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2025-03-17 15:46:22,927 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand has 216 states, 213 states have (on average 1.9906103286384977) internal successors, (424), 109 states have internal predecessors, (424), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:27,568 INFO L93 Difference]: Finished difference Result 541 states and 592 transitions. [2025-03-17 15:46:27,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-03-17 15:46:27,569 INFO L78 Accepts]: Start accepts. Automaton has has 216 states, 213 states have (on average 1.9906103286384977) internal successors, (424), 109 states have internal predecessors, (424), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-03-17 15:46:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:27,571 INFO L225 Difference]: With dead ends: 541 [2025-03-17 15:46:27,571 INFO L226 Difference]: Without dead ends: 539 [2025-03-17 15:46:27,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2025-03-17 15:46:27,575 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1377 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:27,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 113 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:46:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-17 15:46:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2025-03-17 15:46:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 428 states have (on average 1.0046728971962617) internal successors, (430), 429 states have internal predecessors, (430), 107 states have call successors, (107), 107 states have call predecessors, (107), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 537 transitions. [2025-03-17 15:46:27,593 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 537 transitions. Word has length 265 [2025-03-17 15:46:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:27,594 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 537 transitions. [2025-03-17 15:46:27,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 213 states have (on average 1.9906103286384977) internal successors, (424), 109 states have internal predecessors, (424), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 537 transitions. [2025-03-17 15:46:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 15:46:27,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:27,599 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1] [2025-03-17 15:46:27,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 15:46:27,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 15:46:27,799 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:27,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1267617021, now seen corresponding path program 3 times [2025-03-17 15:46:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:27,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408609820] [2025-03-17 15:46:27,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:46:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:27,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 530 statements into 53 equivalence classes. [2025-03-17 15:46:27,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 280 of 530 statements. [2025-03-17 15:46:27,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-03-17 15:46:27,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-03-17 15:46:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408609820] [2025-03-17 15:46:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408609820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687802690] [2025-03-17 15:46:28,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:46:28,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:28,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:28,122 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:46:28,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:46:28,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 530 statements into 53 equivalence classes. [2025-03-17 15:46:28,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 280 of 530 statements. [2025-03-17 15:46:28,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-03-17 15:46:28,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:28,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 15:46:28,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-03-17 15:46:28,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-03-17 15:46:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687802690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:28,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2025-03-17 15:46:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661629718] [2025-03-17 15:46:28,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 15:46:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:28,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 15:46:28,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:46:28,348 INFO L87 Difference]: Start difference. First operand 537 states and 537 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 8 states have internal predecessors, (32), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:28,474 INFO L93 Difference]: Finished difference Result 537 states and 537 transitions. [2025-03-17 15:46:28,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 15:46:28,475 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 8 states have internal predecessors, (32), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 530 [2025-03-17 15:46:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:28,475 INFO L225 Difference]: With dead ends: 537 [2025-03-17 15:46:28,475 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:46:28,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 1059 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:46:28,476 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:28,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 79 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:46:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:46:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:46:28,477 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 15:46:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:46:28,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 530 [2025-03-17 15:46:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:28,478 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:46:28,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 8 states have internal predecessors, (32), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:46:28,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:46:28,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 15:46:28,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 15:46:28,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 15:46:28,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 15:46:28,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 15:46:28,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 15:46:28,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 15:46:28,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 15:46:28,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 15:46:28,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:28,688 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:28,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:46:29,315 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:46:29,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:46:29 BoogieIcfgContainer [2025-03-17 15:46:29,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:46:29,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:46:29,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:46:29,321 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:46:29,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:01" (3/4) ... [2025-03-17 15:46:29,323 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:46:29,327 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id2 [2025-03-17 15:46:29,328 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id [2025-03-17 15:46:29,330 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:46:29,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:46:29,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:46:29,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:46:29,378 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:46:29,378 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:46:29,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:46:29,378 INFO L158 Benchmark]: Toolchain (without parser) took 28520.02ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 132.4MB in the beginning and 410.4MB in the end (delta: -278.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2025-03-17 15:46:29,378 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:46:29,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.79ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 121.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:46:29,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.40ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 120.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:46:29,379 INFO L158 Benchmark]: Boogie Preprocessor took 28.32ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 119.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:46:29,379 INFO L158 Benchmark]: IcfgBuilder took 222.61ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 108.2MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:46:29,379 INFO L158 Benchmark]: TraceAbstraction took 28030.57ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 107.7MB in the beginning and 418.6MB in the end (delta: -310.9MB). Peak memory consumption was 262.8MB. Max. memory is 16.1GB. [2025-03-17 15:46:29,379 INFO L158 Benchmark]: Witness Printer took 57.45ms. Allocated memory is still 469.8MB. Free memory was 418.6MB in the beginning and 410.4MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:46:29,380 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.40ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.79ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 121.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.40ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 120.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.32ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 119.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 222.61ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 108.2MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28030.57ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 107.7MB in the beginning and 418.6MB in the end (delta: -310.9MB). Peak memory consumption was 262.8MB. Max. memory is 16.1GB. * Witness Printer took 57.45ms. Allocated memory is still 469.8MB. Free memory was 418.6MB in the beginning and 410.4MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 41 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 19, TraceHistogramMax: 53, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3413 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3409 mSDsluCounter, 2986 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2565 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3725 IncrementalHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 421 mSDtfsCounter, 3725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2921 GetRequests, 2150 SyntacticMatches, 16 SemanticMatches, 755 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42848 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=15, InterpolantAutomatonStates: 525, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 150 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 2651 NumberOfCodeBlocks, 2151 NumberOfCodeBlocksAsserted, 138 NumberOfCheckSat, 3821 ConstructedInterpolants, 0 QuantifiedInterpolants, 10407 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1926 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 41385/54493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 15:46:29,391 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