./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/Log.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-restricted-15/Log.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 08d23a4fccc00925380f274033d6bce2f9ea0cd5a54ce734e93b963eb060b109 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:32:58,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:32:58,437 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:32:58,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:32:58,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:32:58,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:32:58,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:32:58,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:32:58,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:32:58,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:32:58,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:32:58,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:32:58,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:32:58,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:32:58,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:32:58,458 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:32:58,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:58,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:32:58,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:58,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:32:58,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:32:58,461 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 -> 08d23a4fccc00925380f274033d6bce2f9ea0cd5a54ce734e93b963eb060b109 [2025-01-10 01:32:58,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:32:58,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:32:58,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:32:58,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:32:58,689 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:32:58,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Log.c [2025-01-10 01:33:00,011 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59ec77bf9/b287a02d12594d8bb7dd967a4eb1b550/FLAG19406cd37 [2025-01-10 01:33:00,297 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:33:00,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Log.c [2025-01-10 01:33:00,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59ec77bf9/b287a02d12594d8bb7dd967a4eb1b550/FLAG19406cd37 [2025-01-10 01:33:00,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59ec77bf9/b287a02d12594d8bb7dd967a4eb1b550 [2025-01-10 01:33:00,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:33:00,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:33:00,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:33:00,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:33:00,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:33:00,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1208f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00, skipping insertion in model container [2025-01-10 01:33:00,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:33:00,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:33:00,810 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:33:00,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:33:00,846 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:33:00,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00 WrapperNode [2025-01-10 01:33:00,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:33:00,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:33:00,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:33:00,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:33:00,856 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:33:00" (1/1) ... [2025-01-10 01:33:00,862 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:33:00" (1/1) ... [2025-01-10 01:33:00,882 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2025-01-10 01:33:00,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:33:00,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:33:00,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:33:00,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:33:00,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,904 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:33:00,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:33:00,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:33:00,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:33:00,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:33:00,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:33:00,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:00,970 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:33:00,984 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:33:01,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:33:01,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:33:01,045 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:33:01,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:33:01,115 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-10 01:33:01,117 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:33:01,123 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:33:01,126 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:33:01,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:33:01 BoogieIcfgContainer [2025-01-10 01:33:01,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:33:01,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:33:01,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:33:01,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:33:01,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:33:00" (1/3) ... [2025-01-10 01:33:01,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d642f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:33:01, skipping insertion in model container [2025-01-10 01:33:01,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (2/3) ... [2025-01-10 01:33:01,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d642f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:33:01, skipping insertion in model container [2025-01-10 01:33:01,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:33:01" (3/3) ... [2025-01-10 01:33:01,136 INFO L128 eAbstractionObserver]: Analyzing ICFG Log.c [2025-01-10 01:33:01,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:33:01,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Log.c that has 1 procedures, 19 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-01-10 01:33:01,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:33:01,202 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;@5e967cf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:33:01,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:33:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:33:01,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:33:01,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:01,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash 28695140, now seen corresponding path program 1 times [2025-01-10 01:33:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871483372] [2025-01-10 01:33:01,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:33:01,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:33:01,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,373 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:33:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871483372] [2025-01-10 01:33:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871483372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:01,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:01,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:33:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237249591] [2025-01-10 01:33:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:01,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:01,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,410 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,451 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-01-10 01:33:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:01,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:33:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,460 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:33:01,461 INFO L226 Difference]: Without dead ends: 16 [2025-01-10 01:33:01,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,468 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-10 01:33:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-10 01:33:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-01-10 01:33:01,501 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 5 [2025-01-10 01:33:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,501 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-10 01:33:01,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-01-10 01:33:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:33:01,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:33:01,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:01,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash 889539464, now seen corresponding path program 1 times [2025-01-10 01:33:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122613633] [2025-01-10 01:33:01,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:33:01,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:33:01,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,562 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:33:01,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122613633] [2025-01-10 01:33:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122613633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:01,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:33:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889026520] [2025-01-10 01:33:01,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:33:01,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:33:01,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:01,564 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,587 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-01-10 01:33:01,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:33:01,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:33:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,588 INFO L225 Difference]: With dead ends: 16 [2025-01-10 01:33:01,588 INFO L226 Difference]: Without dead ends: 15 [2025-01-10 01:33:01,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:01,589 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-10 01:33:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-10 01:33:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-01-10 01:33:01,597 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 6 [2025-01-10 01:33:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,597 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-01-10 01:33:01,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-01-10 01:33:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:33:01,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:33:01,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:01,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1805919654, now seen corresponding path program 1 times [2025-01-10 01:33:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985870396] [2025-01-10 01:33:01,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:33:01,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:33:01,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,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:33:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985870396] [2025-01-10 01:33:01,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985870396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:01,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:01,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:01,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107195942] [2025-01-10 01:33:01,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:01,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:01,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,637 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,654 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-01-10 01:33:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:01,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:33:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,655 INFO L225 Difference]: With dead ends: 16 [2025-01-10 01:33:01,655 INFO L226 Difference]: Without dead ends: 15 [2025-01-10 01:33:01,656 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:33:01,656 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-10 01:33:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-10 01:33:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-01-10 01:33:01,663 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 7 [2025-01-10 01:33:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,663 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-10 01:33:01,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-01-10 01:33:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:33:01,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:33:01,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,667 INFO L85 PathProgramCache]: Analyzing trace with hash 148934474, now seen corresponding path program 1 times [2025-01-10 01:33:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560107485] [2025-01-10 01:33:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:33:01,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:33:01,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,707 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:33:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560107485] [2025-01-10 01:33:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560107485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734755318] [2025-01-10 01:33:01,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:01,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,714 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,723 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-01-10 01:33:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:01,723 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:33:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,724 INFO L225 Difference]: With dead ends: 19 [2025-01-10 01:33:01,724 INFO L226 Difference]: Without dead ends: 18 [2025-01-10 01:33:01,724 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:33:01,724 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-10 01:33:01,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-10 01:33:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-01-10 01:33:01,727 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2025-01-10 01:33:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,728 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-01-10 01:33:01,728 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-01-10 01:33:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:33:01,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:33:01,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:01,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1392110348, now seen corresponding path program 1 times [2025-01-10 01:33:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127385927] [2025-01-10 01:33:01,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:33:01,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:33:01,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:33:01,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127385927] [2025-01-10 01:33:01,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127385927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:01,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:01,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:01,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222997737] [2025-01-10 01:33:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:01,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,778 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,787 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-01-10 01:33:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:01,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:33:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,788 INFO L225 Difference]: With dead ends: 18 [2025-01-10 01:33:01,788 INFO L226 Difference]: Without dead ends: 17 [2025-01-10 01:33:01,793 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:33:01,793 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-10 01:33:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-10 01:33:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-01-10 01:33:01,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2025-01-10 01:33:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,797 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-01-10 01:33:01,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-01-10 01:33:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:33:01,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:33:01,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:01,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash 205747882, now seen corresponding path program 1 times [2025-01-10 01:33:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788609545] [2025-01-10 01:33:01,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:33:01,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:33:01,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:33:01,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788609545] [2025-01-10 01:33:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788609545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:01,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:01,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012149185] [2025-01-10 01:33:01,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:01,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:01,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,849 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,864 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-01-10 01:33:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:01,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:33:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,865 INFO L225 Difference]: With dead ends: 32 [2025-01-10 01:33:01,865 INFO L226 Difference]: Without dead ends: 31 [2025-01-10 01:33:01,866 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:33:01,866 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-10 01:33:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-01-10 01:33:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-01-10 01:33:01,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2025-01-10 01:33:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,875 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-01-10 01:33:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-01-10 01:33:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:33:01,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:33:01,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:01,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash 145677730, now seen corresponding path program 1 times [2025-01-10 01:33:01,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353180973] [2025-01-10 01:33:01,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:33:01,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:33:01,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,970 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:33:01,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353180973] [2025-01-10 01:33:01,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353180973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:01,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856922512] [2025-01-10 01:33:01,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:01,973 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:33:01,975 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:33:01,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:33:02,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:33:02,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:02,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:02,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:33:02,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:02,067 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:33:02,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:02,116 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:33:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856922512] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:02,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:02,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:33:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957795966] [2025-01-10 01:33:02,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:02,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:33:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:02,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:33:02,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:33:02,121 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:02,161 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2025-01-10 01:33:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:33:02,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:33:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:02,163 INFO L225 Difference]: With dead ends: 79 [2025-01-10 01:33:02,163 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:33:02,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:33:02,167 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 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:33:02,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:33:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2025-01-10 01:33:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2025-01-10 01:33:02,182 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 13 [2025-01-10 01:33:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:02,182 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2025-01-10 01:33:02,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2025-01-10 01:33:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:33:02,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:02,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:33:02,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:33:02,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:02,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:02,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash 844024002, now seen corresponding path program 1 times [2025-01-10 01:33:02,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:02,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136921821] [2025-01-10 01:33:02,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:02,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:02,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:33:02,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:33:02,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:02,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:33:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136921821] [2025-01-10 01:33:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136921821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:02,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:33:02,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24722023] [2025-01-10 01:33:02,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:02,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:02,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:02,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:02,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:02,448 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:02,453 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2025-01-10 01:33:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 01:33:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:02,454 INFO L225 Difference]: With dead ends: 62 [2025-01-10 01:33:02,454 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 01:33:02,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:02,454 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:02,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 01:33:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 01:33:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-01-10 01:33:02,457 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 20 [2025-01-10 01:33:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:02,457 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-01-10 01:33:02,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-01-10 01:33:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:33:02,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:02,457 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-01-10 01:33:02,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:33:02,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:02,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash 56507722, now seen corresponding path program 2 times [2025-01-10 01:33:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:02,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414818515] [2025-01-10 01:33:02,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:02,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:33:02,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:33:02,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:02,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414818515] [2025-01-10 01:33:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414818515] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510871917] [2025-01-10 01:33:02,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:02,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:02,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:02,532 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:33:02,533 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:33:02,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:33:02,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:33:02,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:02,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:02,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:33:02,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:02,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510871917] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:02,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:02,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:33:02,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883952244] [2025-01-10 01:33:02,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:02,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:33:02,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:02,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:33:02,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:33:02,674 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:02,712 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2025-01-10 01:33:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:33:02,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-10 01:33:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:02,713 INFO L225 Difference]: With dead ends: 60 [2025-01-10 01:33:02,713 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 01:33:02,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 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:33:02,714 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:02,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 01:33:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-10 01:33:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2025-01-10 01:33:02,718 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 28 [2025-01-10 01:33:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:02,718 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2025-01-10 01:33:02,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2025-01-10 01:33:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 01:33:02,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:02,719 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1] [2025-01-10 01:33:02,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:33:02,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:02,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:02,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash 392241738, now seen corresponding path program 3 times [2025-01-10 01:33:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:02,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004949810] [2025-01-10 01:33:02,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:33:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:02,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-01-10 01:33:02,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:33:02,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:33:02,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:03,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004949810] [2025-01-10 01:33:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004949810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766424149] [2025-01-10 01:33:03,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:33:03,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:03,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:03,092 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:33:03,096 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:33:03,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-01-10 01:33:03,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:33:03,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:33:03,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:03,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:33:03,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:03,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766424149] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:03,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:03,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:33:03,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490945561] [2025-01-10 01:33:03,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:03,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:33:03,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:03,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:33:03,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:33:03,442 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:03,511 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2025-01-10 01:33:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:33:03,511 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-10 01:33:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:03,512 INFO L225 Difference]: With dead ends: 120 [2025-01-10 01:33:03,512 INFO L226 Difference]: Without dead ends: 119 [2025-01-10 01:33:03,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 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:33:03,512 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:03,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:33:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-10 01:33:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-10 01:33:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0084745762711864) internal successors, (119), 118 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2025-01-10 01:33:03,524 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 58 [2025-01-10 01:33:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:03,524 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2025-01-10 01:33:03,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2025-01-10 01:33:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-10 01:33:03,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:03,529 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 1, 1, 1, 1] [2025-01-10 01:33:03,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:33:03,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:03,730 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:03,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:03,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2070238134, now seen corresponding path program 4 times [2025-01-10 01:33:03,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:03,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490001648] [2025-01-10 01:33:03,731 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:33:03,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:03,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 118 statements into 2 equivalence classes. [2025-01-10 01:33:03,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 01:33:03,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:33:03,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490001648] [2025-01-10 01:33:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490001648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627843353] [2025-01-10 01:33:04,377 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:33:04,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:04,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:04,380 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:33:04,381 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:33:04,407 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 118 statements into 2 equivalence classes. [2025-01-10 01:33:04,430 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 01:33:04,430 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:33:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:33:04,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:04,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627843353] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:05,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:05,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 01:33:05,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269374088] [2025-01-10 01:33:05,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:05,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:33:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:05,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:33:05,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:33:05,595 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand has 48 states, 47 states have (on average 4.9787234042553195) internal successors, (234), 48 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:05,739 INFO L93 Difference]: Finished difference Result 240 states and 263 transitions. [2025-01-10 01:33:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:33:05,739 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.9787234042553195) internal successors, (234), 48 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-01-10 01:33:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:05,741 INFO L225 Difference]: With dead ends: 240 [2025-01-10 01:33:05,741 INFO L226 Difference]: Without dead ends: 239 [2025-01-10 01:33:05,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:33:05,742 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:05,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:33:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-10 01:33:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-01-10 01:33:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.004201680672269) internal successors, (239), 238 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2025-01-10 01:33:05,755 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 118 [2025-01-10 01:33:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:05,755 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2025-01-10 01:33:05,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.9787234042553195) internal successors, (234), 48 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2025-01-10 01:33:05,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-10 01:33:05,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:05,758 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 1, 1, 1, 1] [2025-01-10 01:33:05,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:33:05,958 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,SelfDestructingSolverStorable10 [2025-01-10 01:33:05,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:05,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash -258162614, now seen corresponding path program 5 times [2025-01-10 01:33:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647843140] [2025-01-10 01:33:05,959 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:33:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:05,971 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 238 statements into 47 equivalence classes. [2025-01-10 01:33:06,044 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 238 of 238 statements. [2025-01-10 01:33:06,045 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:33:06,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647843140] [2025-01-10 01:33:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647843140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988738555] [2025-01-10 01:33:07,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:33:07,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:07,779 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:33:07,780 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:33:07,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 238 statements into 47 equivalence classes. [2025-01-10 01:33:07,867 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 238 of 238 statements. [2025-01-10 01:33:07,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:33:07,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:07,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:33:07,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:08,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:10,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988738555] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:10,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:10,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:33:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978191709] [2025-01-10 01:33:10,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:10,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:33:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:10,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:33:10,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:33:10,709 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand has 96 states, 95 states have (on average 4.989473684210527) internal successors, (474), 96 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:11,028 INFO L93 Difference]: Finished difference Result 480 states and 527 transitions. [2025-01-10 01:33:11,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:33:11,028 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.989473684210527) internal successors, (474), 96 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-01-10 01:33:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:11,031 INFO L225 Difference]: With dead ends: 480 [2025-01-10 01:33:11,031 INFO L226 Difference]: Without dead ends: 479 [2025-01-10 01:33:11,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:33:11,033 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:11,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:33:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-01-10 01:33:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-01-10 01:33:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.002092050209205) internal successors, (479), 478 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2025-01-10 01:33:11,058 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 238 [2025-01-10 01:33:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:11,058 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2025-01-10 01:33:11,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.989473684210527) internal successors, (474), 96 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2025-01-10 01:33:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-10 01:33:11,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:11,068 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 1, 1, 1, 1] [2025-01-10 01:33:11,074 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:33:11,273 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,SelfDestructingSolverStorable11 [2025-01-10 01:33:11,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:11,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1797461942, now seen corresponding path program 6 times [2025-01-10 01:33:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504539528] [2025-01-10 01:33:11,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:33:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:11,289 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 478 statements into 95 equivalence classes. [2025-01-10 01:33:11,372 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 478 of 478 statements. [2025-01-10 01:33:11,373 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:33:11,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:16,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504539528] [2025-01-10 01:33:16,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504539528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586285556] [2025-01-10 01:33:16,517 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:33:16,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:16,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:16,519 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:33:16,521 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:33:16,552 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 478 statements into 95 equivalence classes. [2025-01-10 01:33:16,692 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 478 of 478 statements. [2025-01-10 01:33:16,693 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:33:16,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:16,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 01:33:16,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:17,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586285556] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:26,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 01:33:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928790105] [2025-01-10 01:33:26,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:26,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 01:33:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:26,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 01:33:26,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:33:26,175 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand has 192 states, 191 states have (on average 4.994764397905759) internal successors, (954), 192 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:26,956 INFO L93 Difference]: Finished difference Result 960 states and 1055 transitions. [2025-01-10 01:33:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 01:33:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 4.994764397905759) internal successors, (954), 192 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 478 [2025-01-10 01:33:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:26,962 INFO L225 Difference]: With dead ends: 960 [2025-01-10 01:33:26,963 INFO L226 Difference]: Without dead ends: 959 [2025-01-10 01:33:26,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1050 GetRequests, 860 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:33:26,966 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:26,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:33:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-01-10 01:33:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2025-01-10 01:33:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 1.001043841336117) internal successors, (959), 958 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 959 transitions. [2025-01-10 01:33:27,012 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 959 transitions. Word has length 478 [2025-01-10 01:33:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:27,013 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 959 transitions. [2025-01-10 01:33:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 4.994764397905759) internal successors, (954), 192 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 959 transitions. [2025-01-10 01:33:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 959 [2025-01-10 01:33:27,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:27,029 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 190, 1, 1, 1, 1] [2025-01-10 01:33:27,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:33:27,233 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,SelfDestructingSolverStorable12 [2025-01-10 01:33:27,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1045248074, now seen corresponding path program 7 times [2025-01-10 01:33:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996340165] [2025-01-10 01:33:27,235 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:33:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:27,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 958 statements into 1 equivalence classes. [2025-01-10 01:33:27,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 958 of 958 statements. [2025-01-10 01:33:27,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:27,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:50,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996340165] [2025-01-10 01:33:50,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996340165] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:50,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286469818] [2025-01-10 01:33:50,442 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:33:50,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:50,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:50,446 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:33:50,449 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:33:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 958 statements into 1 equivalence classes. [2025-01-10 01:33:50,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 958 of 958 statements. [2025-01-10 01:33:50,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:50,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:50,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-10 01:33:50,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:51,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:34:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:34:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286469818] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:34:26,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:34:26,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-01-10 01:34:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884164391] [2025-01-10 01:34:26,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:34:26,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-01-10 01:34:26,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:34:26,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-01-10 01:34:26,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 01:34:26,168 INFO L87 Difference]: Start difference. First operand 959 states and 959 transitions. Second operand has 384 states, 383 states have (on average 4.997389033942559) internal successors, (1914), 384 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:34:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:34:31,729 INFO L93 Difference]: Finished difference Result 1920 states and 2111 transitions. [2025-01-10 01:34:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-01-10 01:34:31,732 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 383 states have (on average 4.997389033942559) internal successors, (1914), 384 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 958 [2025-01-10 01:34:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:34:31,743 INFO L225 Difference]: With dead ends: 1920 [2025-01-10 01:34:31,743 INFO L226 Difference]: Without dead ends: 1919 [2025-01-10 01:34:31,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2106 GetRequests, 1724 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 01:34:31,749 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:34:31,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1159 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:34:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-01-10 01:34:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1919. [2025-01-10 01:34:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1918 states have (on average 1.0005213764337852) internal successors, (1919), 1918 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:34:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 1919 transitions. [2025-01-10 01:34:31,787 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 1919 transitions. Word has length 958 [2025-01-10 01:34:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:34:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 1919 transitions. [2025-01-10 01:34:31,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 383 states have (on average 4.997389033942559) internal successors, (1914), 384 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:34:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 1919 transitions. [2025-01-10 01:34:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2025-01-10 01:34:31,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:34:31,810 INFO L218 NwaCegarLoop]: trace histogram [383, 383, 383, 383, 382, 1, 1, 1, 1] [2025-01-10 01:34:31,821 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:34:32,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:34:32,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:34:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:34:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1796351926, now seen corresponding path program 8 times [2025-01-10 01:34:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:34:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406294666] [2025-01-10 01:34:32,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:34:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:34:32,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1918 statements into 2 equivalence classes. [2025-01-10 01:34:32,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1918 of 1918 statements. [2025-01-10 01:34:32,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:34:32,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat