./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash de331d1f778f147a4d32c0286c0018cb5b5cf61f2b6c0952b6bed68b0f715eaf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:30:08,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:30:08,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:30:08,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:30:08,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:30:08,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:30:08,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:30:08,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:30:08,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:30:08,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:30:08,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:30:08,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:30:08,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:30:08,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:30:08,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:30:08,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:08,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:08,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:30:08,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:30:08,753 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de331d1f778f147a4d32c0286c0018cb5b5cf61f2b6c0952b6bed68b0f715eaf [2025-01-10 01:30:08,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:30:08,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:30:09,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:30:09,001 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:30:09,002 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:30:09,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c [2025-01-10 01:30:10,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2597c3cf1/2e4e46dba2cd4198a53ad39c270e7441/FLAGb2c3f5303 [2025-01-10 01:30:10,510 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:30:10,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c [2025-01-10 01:30:10,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2597c3cf1/2e4e46dba2cd4198a53ad39c270e7441/FLAGb2c3f5303 [2025-01-10 01:30:10,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2597c3cf1/2e4e46dba2cd4198a53ad39c270e7441 [2025-01-10 01:30:10,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:30:10,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:30:10,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:30:10,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:30:10,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:30:10,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:10,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a51fba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10, skipping insertion in model container [2025-01-10 01:30:10,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:10,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:30:10,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:30:10,961 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:30:10,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:30:10,978 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:30:10,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10 WrapperNode [2025-01-10 01:30:10,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:30:10,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:30:10,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:30:10,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:30:10,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:10,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:10,995 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2025-01-10 01:30:10,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:30:10,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:30:10,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:30:10,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:30:11,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,005 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:30:11,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:30:11,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:30:11,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:30:11,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:30:11,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (1/1) ... [2025-01-10 01:30:11,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:11,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:30:11,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:30:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-01-10 01:30:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-01-10 01:30:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:30:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:30:11,104 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:30:11,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:30:11,199 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-10 01:30:11,199 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:30:11,206 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:30:11,206 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:30:11,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:11 BoogieIcfgContainer [2025-01-10 01:30:11,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:30:11,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:30:11,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:30:11,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:30:11,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:30:10" (1/3) ... [2025-01-10 01:30:11,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303e32e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:30:11, skipping insertion in model container [2025-01-10 01:30:11,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:10" (2/3) ... [2025-01-10 01:30:11,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303e32e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:30:11, skipping insertion in model container [2025-01-10 01:30:11,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:11" (3/3) ... [2025-01-10 01:30:11,214 INFO L128 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig1.c [2025-01-10 01:30:11,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:30:11,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG HarrisLalNoriRajamani-SAS2010-Fig1.c that has 2 procedures, 31 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-01-10 01:30:11,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:30:11,278 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;@62c41594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:30:11,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 01:30:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:30:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:30:11,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:11,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:11,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:11,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1890794831, now seen corresponding path program 1 times [2025-01-10 01:30:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129273416] [2025-01-10 01:30:11,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:11,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:11,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:30:11,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:30:11,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:11,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:11,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129273416] [2025-01-10 01:30:11,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129273416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:11,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:11,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166491909] [2025-01-10 01:30:11,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:11,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:11,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:11,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:11,421 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 01:30:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:11,452 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-01-10 01:30:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2025-01-10 01:30:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:11,460 INFO L225 Difference]: With dead ends: 46 [2025-01-10 01:30:11,460 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:30:11,461 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-01-10 01:30:11,463 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:11,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 50 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:30:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-01-10 01:30:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 30 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-01-10 01:30:11,490 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 8 [2025-01-10 01:30:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:11,490 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-01-10 01:30:11,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 01:30:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-01-10 01:30:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:30:11,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:11,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:11,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:30:11,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:11,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1514902341, now seen corresponding path program 1 times [2025-01-10 01:30:11,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400069639] [2025-01-10 01:30:11,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:11,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:30:11,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:30:11,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:11,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:11,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400069639] [2025-01-10 01:30:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400069639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:11,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517221556] [2025-01-10 01:30:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:11,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:11,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:11,529 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 01:30:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:11,559 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2025-01-10 01:30:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:11,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2025-01-10 01:30:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:11,560 INFO L225 Difference]: With dead ends: 56 [2025-01-10 01:30:11,560 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 01:30:11,561 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-01-10 01:30:11,561 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:11,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 01:30:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-01-10 01:30:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2025-01-10 01:30:11,569 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 9 [2025-01-10 01:30:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:11,569 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-01-10 01:30:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 01:30:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2025-01-10 01:30:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:30:11,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:11,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:30:11,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash 282854803, now seen corresponding path program 1 times [2025-01-10 01:30:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414781581] [2025-01-10 01:30:11,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:11,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:30:11,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:30:11,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:11,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414781581] [2025-01-10 01:30:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414781581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:11,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:11,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:30:11,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392341818] [2025-01-10 01:30:11,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:11,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:30:11,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:11,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:30:11,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:30:11,635 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:11,697 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2025-01-10 01:30:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:30:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:30:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:11,700 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:30:11,700 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 01:30:11,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:30:11,702 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:11,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 01:30:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 01:30:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2025-01-10 01:30:11,712 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 10 [2025-01-10 01:30:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:11,712 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2025-01-10 01:30:11,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2025-01-10 01:30:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:30:11,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:11,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:11,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:30:11,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:11,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash 282854452, now seen corresponding path program 1 times [2025-01-10 01:30:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523058193] [2025-01-10 01:30:11,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:11,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:30:11,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:30:11,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:11,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:11,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523058193] [2025-01-10 01:30:11,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523058193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:11,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:11,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:30:11,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544567826] [2025-01-10 01:30:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:11,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:30:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:11,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:30:11,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:30:11,767 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:11,816 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-01-10 01:30:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:30:11,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:30:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:11,816 INFO L225 Difference]: With dead ends: 53 [2025-01-10 01:30:11,816 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:30:11,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:30:11,821 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:11,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 45 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:30:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2025-01-10 01:30:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 46 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-01-10 01:30:11,826 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 10 [2025-01-10 01:30:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:11,826 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-01-10 01:30:11,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-01-10 01:30:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:30:11,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:11,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:11,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:30:11,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:11,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 178564367, now seen corresponding path program 1 times [2025-01-10 01:30:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062008773] [2025-01-10 01:30:11,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:11,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:30:11,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:30:11,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:11,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062008773] [2025-01-10 01:30:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062008773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036870524] [2025-01-10 01:30:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:11,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:11,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:11,892 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:11,933 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2025-01-10 01:30:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:11,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:30:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:11,934 INFO L225 Difference]: With dead ends: 104 [2025-01-10 01:30:11,936 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 01:30:11,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:30:11,936 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:11,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 63 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 01:30:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2025-01-10 01:30:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 61 states have internal predecessors, (81), 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-01-10 01:30:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2025-01-10 01:30:11,951 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 11 [2025-01-10 01:30:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:11,951 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2025-01-10 01:30:11,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2025-01-10 01:30:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:30:11,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:11,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:11,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:30:11,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:11,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash 178553476, now seen corresponding path program 1 times [2025-01-10 01:30:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:11,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956880000] [2025-01-10 01:30:11,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:11,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:30:11,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:30:11,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:11,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:11,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956880000] [2025-01-10 01:30:11,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956880000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:11,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:11,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626646549] [2025-01-10 01:30:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:11,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:12,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:12,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:12,000 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:12,053 INFO L93 Difference]: Finished difference Result 100 states and 128 transitions. [2025-01-10 01:30:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:12,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:30:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:12,054 INFO L225 Difference]: With dead ends: 100 [2025-01-10 01:30:12,054 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 01:30:12,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:30:12,055 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:12,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 01:30:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2025-01-10 01:30:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 73 states have internal predecessors, (97), 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-01-10 01:30:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2025-01-10 01:30:12,063 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 11 [2025-01-10 01:30:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:12,063 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2025-01-10 01:30:12,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2025-01-10 01:30:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:30:12,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:12,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:12,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:30:12,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2115307086, now seen corresponding path program 1 times [2025-01-10 01:30:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476677455] [2025-01-10 01:30:12,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:12,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:30:12,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:30:12,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:12,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476677455] [2025-01-10 01:30:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476677455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:12,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:12,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128381576] [2025-01-10 01:30:12,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:12,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:12,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:12,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:12,117 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:12,156 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2025-01-10 01:30:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:12,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:30:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:12,157 INFO L225 Difference]: With dead ends: 93 [2025-01-10 01:30:12,157 INFO L226 Difference]: Without dead ends: 92 [2025-01-10 01:30:12,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:30:12,159 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:12,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 35 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-10 01:30:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2025-01-10 01:30:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 81 states have internal predecessors, (107), 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-01-10 01:30:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2025-01-10 01:30:12,175 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 11 [2025-01-10 01:30:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:12,175 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2025-01-10 01:30:12,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2025-01-10 01:30:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:30:12,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:12,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:12,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:30:12,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:12,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2115296195, now seen corresponding path program 1 times [2025-01-10 01:30:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:12,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356681132] [2025-01-10 01:30:12,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:12,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:12,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:30:12,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:30:12,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:12,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356681132] [2025-01-10 01:30:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356681132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:12,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121432209] [2025-01-10 01:30:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:12,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:12,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:12,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:12,236 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:12,272 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2025-01-10 01:30:12,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:12,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:30:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:12,273 INFO L225 Difference]: With dead ends: 85 [2025-01-10 01:30:12,273 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 01:30:12,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:30:12,274 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:12,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 35 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 01:30:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2025-01-10 01:30:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 54 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-01-10 01:30:12,281 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 11 [2025-01-10 01:30:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:12,281 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-01-10 01:30:12,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-01-10 01:30:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:30:12,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:12,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:12,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:30:12,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1060743437, now seen corresponding path program 1 times [2025-01-10 01:30:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369385657] [2025-01-10 01:30:12,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:12,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:30:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:30:12,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:12,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369385657] [2025-01-10 01:30:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369385657] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146361422] [2025-01-10 01:30:12,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:12,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:12,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:12,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:30:12,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:30:12,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:30:12,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:12,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:12,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:30:12,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:12,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146361422] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:12,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:12,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:30:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54384421] [2025-01-10 01:30:12,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:12,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:30:12,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:12,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:30:12,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:12,417 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:12,473 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2025-01-10 01:30:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:30:12,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 01:30:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:12,474 INFO L225 Difference]: With dead ends: 132 [2025-01-10 01:30:12,474 INFO L226 Difference]: Without dead ends: 130 [2025-01-10 01:30:12,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:12,474 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 86 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:12,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 60 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-10 01:30:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 65. [2025-01-10 01:30:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 63 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2025-01-10 01:30:12,484 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 12 [2025-01-10 01:30:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:12,484 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2025-01-10 01:30:12,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2025-01-10 01:30:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:30:12,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:12,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:12,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:12,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:12,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1620029409, now seen corresponding path program 1 times [2025-01-10 01:30:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107137807] [2025-01-10 01:30:12,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:12,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:30:12,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:30:12,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:12,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107137807] [2025-01-10 01:30:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107137807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233437799] [2025-01-10 01:30:12,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:12,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:12,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:12,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:12,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:30:12,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:30:12,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:30:12,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:12,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:12,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:30:12,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:12,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:30:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233437799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:12,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:30:12,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 01:30:12,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656004037] [2025-01-10 01:30:12,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:12,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:30:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:12,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:30:12,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:30:12,829 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-01-10 01:30:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:12,880 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2025-01-10 01:30:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:30:12,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2025-01-10 01:30:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:12,881 INFO L225 Difference]: With dead ends: 141 [2025-01-10 01:30:12,881 INFO L226 Difference]: Without dead ends: 140 [2025-01-10 01:30:12,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:30:12,882 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:12,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 80 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-10 01:30:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2025-01-10 01:30:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 109 states have internal predecessors, (142), 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-01-10 01:30:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2025-01-10 01:30:12,896 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 15 [2025-01-10 01:30:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2025-01-10 01:30:12,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-01-10 01:30:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2025-01-10 01:30:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:30:12,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:12,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:12,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:13,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:13,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:13,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash -997985826, now seen corresponding path program 1 times [2025-01-10 01:30:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600643210] [2025-01-10 01:30:13,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:13,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:30:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:30:13,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:13,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600643210] [2025-01-10 01:30:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600643210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053556482] [2025-01-10 01:30:13,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:13,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:13,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:13,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:13,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:30:13,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:30:13,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:30:13,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:13,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:13,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:30:13,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:30:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053556482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:13,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:30:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 01:30:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157372362] [2025-01-10 01:30:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:13,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:30:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:13,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:30:13,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:30:13,227 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-01-10 01:30:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:13,270 INFO L93 Difference]: Finished difference Result 152 states and 196 transitions. [2025-01-10 01:30:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:30:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2025-01-10 01:30:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:13,271 INFO L225 Difference]: With dead ends: 152 [2025-01-10 01:30:13,271 INFO L226 Difference]: Without dead ends: 151 [2025-01-10 01:30:13,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:30:13,271 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 48 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:13,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 48 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-10 01:30:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 56. [2025-01-10 01:30:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.32) internal successors, (66), 54 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-01-10 01:30:13,277 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 15 [2025-01-10 01:30:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:13,277 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-01-10 01:30:13,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-01-10 01:30:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-01-10 01:30:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:30:13,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:13,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:13,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:13,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:13,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:13,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash 382647755, now seen corresponding path program 1 times [2025-01-10 01:30:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401334244] [2025-01-10 01:30:13,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:13,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:30:13,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:30:13,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:13,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:13,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401334244] [2025-01-10 01:30:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401334244] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:13,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744634624] [2025-01-10 01:30:13,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:13,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:13,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:13,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:30:13,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:30:13,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:30:13,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:13,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:13,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:30:13,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:30:13,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744634624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:13,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:30:13,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 01:30:13,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392873543] [2025-01-10 01:30:13,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:13,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:30:13,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:13,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:30:13,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:30:13,605 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:13,645 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2025-01-10 01:30:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:30:13,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-10 01:30:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:13,646 INFO L225 Difference]: With dead ends: 107 [2025-01-10 01:30:13,646 INFO L226 Difference]: Without dead ends: 106 [2025-01-10 01:30:13,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:30:13,646 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:13,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 79 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-10 01:30:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-01-10 01:30:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 100 states have internal predecessors, (126), 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-01-10 01:30:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2025-01-10 01:30:13,655 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 17 [2025-01-10 01:30:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:13,655 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2025-01-10 01:30:13,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2025-01-10 01:30:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:30:13,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:13,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:13,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:13,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:30:13,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:13,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1166076874, now seen corresponding path program 1 times [2025-01-10 01:30:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:13,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889611347] [2025-01-10 01:30:13,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:13,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:13,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:30:13,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:30:13,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:13,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889611347] [2025-01-10 01:30:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889611347] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142404134] [2025-01-10 01:30:13,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:13,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:13,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:13,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:13,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:30:13,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:30:13,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:30:13,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:13,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:30:13,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:30:13,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142404134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:13,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:30:13,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 01:30:13,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90649481] [2025-01-10 01:30:13,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:13,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:30:13,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:13,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:30:13,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:30:13,967 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:13,999 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2025-01-10 01:30:14,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:30:14,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-10 01:30:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:14,001 INFO L225 Difference]: With dead ends: 103 [2025-01-10 01:30:14,001 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 01:30:14,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:30:14,001 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:14,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 01:30:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 55. [2025-01-10 01:30:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-01-10 01:30:14,006 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 17 [2025-01-10 01:30:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:14,007 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-01-10 01:30:14,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-01-10 01:30:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:30:14,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:14,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:14,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:30:14,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:30:14,208 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:14,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1022821425, now seen corresponding path program 1 times [2025-01-10 01:30:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787529234] [2025-01-10 01:30:14,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:14,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:30:14,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:30:14,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:14,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:14,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787529234] [2025-01-10 01:30:14,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787529234] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902400853] [2025-01-10 01:30:14,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:14,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:14,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:14,234 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:14,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:30:14,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:30:14,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:30:14,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:14,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:14,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:30:14,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:14,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:14,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902400853] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:14,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:14,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:30:14,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309087128] [2025-01-10 01:30:14,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:14,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:30:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:14,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:30:14,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:14,314 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-01-10 01:30:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:14,338 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2025-01-10 01:30:14,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:30:14,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 01:30:14,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:14,339 INFO L225 Difference]: With dead ends: 104 [2025-01-10 01:30:14,340 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 01:30:14,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:14,340 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:14,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 50 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 01:30:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-10 01:30:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 101 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2025-01-10 01:30:14,348 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 18 [2025-01-10 01:30:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:14,348 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2025-01-10 01:30:14,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-01-10 01:30:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2025-01-10 01:30:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:30:14,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:14,350 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:14,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:14,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:30:14,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:14,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -494147013, now seen corresponding path program 2 times [2025-01-10 01:30:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024450798] [2025-01-10 01:30:14,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:14,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:30:14,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-01-10 01:30:14,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:30:14,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:30:14,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:14,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024450798] [2025-01-10 01:30:14,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024450798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:14,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894352471] [2025-01-10 01:30:14,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:14,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:14,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:14,580 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:14,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:30:14,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:30:14,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-01-10 01:30:14,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:30:14,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:14,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:30:14,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:30:14,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:30:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894352471] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:14,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:30:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224006834] [2025-01-10 01:30:14,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:14,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:30:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:14,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:30:14,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:14,643 INFO L87 Difference]: Start difference. First operand 103 states and 123 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, (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-01-10 01:30:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:14,673 INFO L93 Difference]: Finished difference Result 142 states and 168 transitions. [2025-01-10 01:30:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:30:14,673 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-10 01:30:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:14,674 INFO L225 Difference]: With dead ends: 142 [2025-01-10 01:30:14,674 INFO L226 Difference]: Without dead ends: 141 [2025-01-10 01:30:14,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:30:14,674 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:14,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-10 01:30:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2025-01-10 01:30:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 98 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2025-01-10 01:30:14,684 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 21 [2025-01-10 01:30:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:14,684 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2025-01-10 01:30:14,684 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, (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-01-10 01:30:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2025-01-10 01:30:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:30:14,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:14,685 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:14,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:30:14,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:14,886 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:14,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash -714426810, now seen corresponding path program 1 times [2025-01-10 01:30:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589964232] [2025-01-10 01:30:14,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:14,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:30:14,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:30:14,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:14,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:30:14,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:14,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589964232] [2025-01-10 01:30:14,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589964232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:14,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:14,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808422480] [2025-01-10 01:30:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:14,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:14,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:14,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:14,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:14,909 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (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-01-10 01:30:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:14,933 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2025-01-10 01:30:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (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 25 [2025-01-10 01:30:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:14,934 INFO L225 Difference]: With dead ends: 100 [2025-01-10 01:30:14,934 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 01:30:14,934 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-01-10 01:30:14,934 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:14,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 01:30:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 50. [2025-01-10 01:30:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-01-10 01:30:14,940 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 25 [2025-01-10 01:30:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:14,940 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-01-10 01:30:14,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (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-01-10 01:30:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-01-10 01:30:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 01:30:14,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:14,941 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:14,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:30:14,942 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:14,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1134904294, now seen corresponding path program 2 times [2025-01-10 01:30:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:14,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001624431] [2025-01-10 01:30:14,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:14,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 01:30:14,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:30:14,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001624431] [2025-01-10 01:30:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001624431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52976143] [2025-01-10 01:30:15,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:15,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:15,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:15,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:30:15,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 01:30:15,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:30:15,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:15,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:15,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:30:15,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:15,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:15,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52976143] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:15,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:15,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:30:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889338930] [2025-01-10 01:30:15,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:15,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:30:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:15,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:30:15,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:30:15,176 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 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-01-10 01:30:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:15,214 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2025-01-10 01:30:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:30:15,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 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 36 [2025-01-10 01:30:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:15,215 INFO L225 Difference]: With dead ends: 99 [2025-01-10 01:30:15,215 INFO L226 Difference]: Without dead ends: 98 [2025-01-10 01:30:15,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:30:15,216 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:15,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 116 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-10 01:30:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-10 01:30:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 95 states have (on average 1.1473684210526316) internal successors, (109), 96 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-01-10 01:30:15,222 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 36 [2025-01-10 01:30:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:15,222 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-01-10 01:30:15,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 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-01-10 01:30:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-01-10 01:30:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 01:30:15,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:15,223 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:15,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:30:15,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:30:15,427 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:15,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1933825648, now seen corresponding path program 3 times [2025-01-10 01:30:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:15,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862498039] [2025-01-10 01:30:15,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:15,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-01-10 01:30:15,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:30:15,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:30:15,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:15,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862498039] [2025-01-10 01:30:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862498039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327071004] [2025-01-10 01:30:15,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:15,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:15,634 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:15,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:30:15,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-01-10 01:30:15,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:30:15,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:30:15,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:15,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:30:15,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:15,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:15,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327071004] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:15,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:15,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:30:15,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842332537] [2025-01-10 01:30:15,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:15,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:30:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:15,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:30:15,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:30:15,978 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 24 states have internal predecessors, (139), 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-01-10 01:30:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:16,065 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-01-10 01:30:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:30:16,065 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 24 states have internal predecessors, (139), 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 72 [2025-01-10 01:30:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:16,066 INFO L225 Difference]: With dead ends: 195 [2025-01-10 01:30:16,066 INFO L226 Difference]: Without dead ends: 194 [2025-01-10 01:30:16,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:30:16,067 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 220 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:16,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 194 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-10 01:30:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-01-10 01:30:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 191 states have (on average 1.1361256544502618) internal successors, (217), 192 states have internal predecessors, (217), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2025-01-10 01:30:16,079 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 72 [2025-01-10 01:30:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:16,080 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2025-01-10 01:30:16,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 24 states have internal predecessors, (139), 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-01-10 01:30:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2025-01-10 01:30:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-10 01:30:16,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:16,082 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:16,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:30:16,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:30:16,286 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:16,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1491579420, now seen corresponding path program 4 times [2025-01-10 01:30:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:16,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27252447] [2025-01-10 01:30:16,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:30:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:16,295 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 144 statements into 2 equivalence classes. [2025-01-10 01:30:16,314 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 01:30:16,314 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:30:16,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:16,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:16,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27252447] [2025-01-10 01:30:16,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27252447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:16,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019692689] [2025-01-10 01:30:16,849 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:30:16,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:16,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:16,851 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:16,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:30:16,878 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 144 statements into 2 equivalence classes. [2025-01-10 01:30:16,916 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 01:30:16,916 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:30:16,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:16,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:30:16,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:17,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019692689] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:17,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:17,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 01:30:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961520513] [2025-01-10 01:30:17,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:17,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:30:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:17,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:30:17,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:30:17,789 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand has 48 states, 47 states have (on average 6.0212765957446805) internal successors, (283), 48 states have internal predecessors, (283), 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-01-10 01:30:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:17,975 INFO L93 Difference]: Finished difference Result 387 states and 459 transitions. [2025-01-10 01:30:17,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:30:17,975 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.0212765957446805) internal successors, (283), 48 states have internal predecessors, (283), 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 144 [2025-01-10 01:30:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:17,977 INFO L225 Difference]: With dead ends: 387 [2025-01-10 01:30:17,977 INFO L226 Difference]: Without dead ends: 386 [2025-01-10 01:30:17,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:30:17,978 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 440 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:17,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 374 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-01-10 01:30:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-01-10 01:30:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 383 states have (on average 1.1305483028720626) internal successors, (433), 384 states have internal predecessors, (433), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 435 transitions. [2025-01-10 01:30:17,994 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 435 transitions. Word has length 144 [2025-01-10 01:30:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:17,994 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 435 transitions. [2025-01-10 01:30:17,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.0212765957446805) internal successors, (283), 48 states have internal predecessors, (283), 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-01-10 01:30:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 435 transitions. [2025-01-10 01:30:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-10 01:30:17,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:17,996 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:18,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:18,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:18,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1374684532, now seen corresponding path program 5 times [2025-01-10 01:30:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229292308] [2025-01-10 01:30:18,202 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:30:18,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:18,211 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 288 statements into 47 equivalence classes. [2025-01-10 01:30:18,280 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 288 of 288 statements. [2025-01-10 01:30:18,280 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:30:18,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:19,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229292308] [2025-01-10 01:30:19,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229292308] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433121219] [2025-01-10 01:30:19,965 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:30:19,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:19,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:19,967 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:19,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:30:20,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 288 statements into 47 equivalence classes. [2025-01-10 01:30:20,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 288 of 288 statements. [2025-01-10 01:30:20,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:30:20,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:20,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:30:20,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:20,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:22,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433121219] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:22,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:22,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:30:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177802377] [2025-01-10 01:30:22,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:22,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:30:22,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:22,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:30:22,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:30:22,623 INFO L87 Difference]: Start difference. First operand 386 states and 435 transitions. Second operand has 96 states, 95 states have (on average 6.010526315789473) internal successors, (571), 96 states have internal predecessors, (571), 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-01-10 01:30:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:23,540 INFO L93 Difference]: Finished difference Result 771 states and 915 transitions. [2025-01-10 01:30:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:30:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 6.010526315789473) internal successors, (571), 96 states have internal predecessors, (571), 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 288 [2025-01-10 01:30:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:23,543 INFO L225 Difference]: With dead ends: 771 [2025-01-10 01:30:23,543 INFO L226 Difference]: Without dead ends: 770 [2025-01-10 01:30:23,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:30:23,545 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1147 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:23,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 710 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:30:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-01-10 01:30:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2025-01-10 01:30:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 767 states have (on average 1.1277705345501956) internal successors, (865), 768 states have internal predecessors, (865), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 867 transitions. [2025-01-10 01:30:23,595 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 867 transitions. Word has length 288 [2025-01-10 01:30:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:23,595 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 867 transitions. [2025-01-10 01:30:23,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 6.010526315789473) internal successors, (571), 96 states have internal predecessors, (571), 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-01-10 01:30:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 867 transitions. [2025-01-10 01:30:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-10 01:30:23,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:23,600 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:23,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:30:23,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:23,801 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:23,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2027101220, now seen corresponding path program 6 times [2025-01-10 01:30:23,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:23,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188757284] [2025-01-10 01:30:23,802 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:30:23,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:23,818 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 576 statements into 95 equivalence classes. [2025-01-10 01:30:23,957 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 576 of 576 statements. [2025-01-10 01:30:23,957 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:30:23,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:29,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188757284] [2025-01-10 01:30:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188757284] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081564381] [2025-01-10 01:30:29,544 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:30:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:29,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:29,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:30:29,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:30:29,596 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 576 statements into 95 equivalence classes. [2025-01-10 01:30:29,827 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 576 of 576 statements. [2025-01-10 01:30:29,827 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:30:29,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:29,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 01:30:29,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:30,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081564381] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:37,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:37,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 01:30:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540286098] [2025-01-10 01:30:37,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:37,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 01:30:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:37,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 01:30:37,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:30:37,922 INFO L87 Difference]: Start difference. First operand 770 states and 867 transitions. Second operand has 192 states, 191 states have (on average 6.005235602094241) internal successors, (1147), 192 states have internal predecessors, (1147), 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-01-10 01:30:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:48,464 INFO L93 Difference]: Finished difference Result 1539 states and 1827 transitions. [2025-01-10 01:30:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 01:30:48,464 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 6.005235602094241) internal successors, (1147), 192 states have internal predecessors, (1147), 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 576 [2025-01-10 01:30:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:48,469 INFO L225 Difference]: With dead ends: 1539 [2025-01-10 01:30:48,469 INFO L226 Difference]: Without dead ends: 1538 [2025-01-10 01:30:48,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1246 GetRequests, 1056 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:30:48,471 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2752 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:48,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 1382 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:30:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-01-10 01:30:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1538. [2025-01-10 01:30:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1535 states have (on average 1.126384364820847) internal successors, (1729), 1536 states have internal predecessors, (1729), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1731 transitions. [2025-01-10 01:30:48,531 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1731 transitions. Word has length 576 [2025-01-10 01:30:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:48,532 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 1731 transitions. [2025-01-10 01:30:48,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 6.005235602094241) internal successors, (1147), 192 states have internal predecessors, (1147), 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-01-10 01:30:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1731 transitions. [2025-01-10 01:30:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1153 [2025-01-10 01:30:48,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:48,553 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 190, 190, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:48,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:48,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:48,754 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:30:48,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash 677579140, now seen corresponding path program 7 times [2025-01-10 01:30:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:48,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674772440] [2025-01-10 01:30:48,755 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:30:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:48,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1152 statements into 1 equivalence classes. [2025-01-10 01:30:48,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1152 of 1152 statements. [2025-01-10 01:30:48,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:48,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:31:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 108680 backedges. 0 proven. 108680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:31:12,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:31:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674772440] [2025-01-10 01:31:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674772440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:31:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113821413] [2025-01-10 01:31:12,168 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:31:12,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:31:12,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:31:12,170 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:31:12,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:31:12,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1152 statements into 1 equivalence classes. [2025-01-10 01:31:12,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1152 of 1152 statements. [2025-01-10 01:31:12,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:31:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:31:12,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 2885 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-10 01:31:12,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:31:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 108680 backedges. 0 proven. 108680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:31:13,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:31:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 108680 backedges. 0 proven. 108680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:31:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113821413] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:31:42,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:31:42,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-01-10 01:31:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790703350] [2025-01-10 01:31:42,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:31:42,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-01-10 01:31:42,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:31:42,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-01-10 01:31:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 01:31:42,340 INFO L87 Difference]: Start difference. First operand 1538 states and 1731 transitions. Second operand has 384 states, 383 states have (on average 6.002610966057441) internal successors, (2299), 384 states have internal predecessors, (2299), 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)