./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aab72618ab8befdf7d3c20393ae3aa97ba59d5fce32037d3e275043b0cba9f2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:35:00,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:35:00,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:35:00,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:35:00,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:35:00,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:35:00,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:35:00,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:35:00,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:35:00,961 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:35:00,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:35:00,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:35:00,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:35:00,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:35:00,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:35:00,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:35:00,963 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aab72618ab8befdf7d3c20393ae3aa97ba59d5fce32037d3e275043b0cba9f2d [2025-03-09 02:35:01,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:35:01,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:35:01,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:35:01,195 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:35:01,196 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:35:01,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c [2025-03-09 02:35:02,296 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6d90ee52/4691c141b9fa47b5a1060cc510f0be64/FLAGafba82562 [2025-03-09 02:35:02,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:35:02,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c [2025-03-09 02:35:02,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6d90ee52/4691c141b9fa47b5a1060cc510f0be64/FLAGafba82562 [2025-03-09 02:35:02,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6d90ee52/4691c141b9fa47b5a1060cc510f0be64 [2025-03-09 02:35:02,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:35:02,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:35:02,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:35:02,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:35:02,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:35:02,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:35:02" (1/1) ... [2025-03-09 02:35:02,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6424dbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:02, skipping insertion in model container [2025-03-09 02:35:02,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:35:02" (1/1) ... [2025-03-09 02:35:02,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:35:03,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:35:03,016 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:35:03,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:35:03,044 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:35:03,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03 WrapperNode [2025-03-09 02:35:03,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:35:03,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:35:03,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:35:03,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:35:03,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,083 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2025-03-09 02:35:03,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:35:03,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:35:03,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:35:03,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:35:03,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:35:03,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:35:03,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:35:03,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:35:03,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:35:03,118 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (1/1) ... [2025-03-09 02:35:03,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:35:03,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:03,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:35:03,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:35:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:35:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:35:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:35:03,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:35:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:35:03,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:35:03,197 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:35:03,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:35:03,614 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-09 02:35:03,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:35:03,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:35:03,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:35:03,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:35:03 BoogieIcfgContainer [2025-03-09 02:35:03,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:35:03,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:35:03,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:35:03,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:35:03,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:35:02" (1/3) ... [2025-03-09 02:35:03,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f433f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:35:03, skipping insertion in model container [2025-03-09 02:35:03,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:03" (2/3) ... [2025-03-09 02:35:03,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f433f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:35:03, skipping insertion in model container [2025-03-09 02:35:03,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:35:03" (3/3) ... [2025-03-09 02:35:03,635 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound100.c [2025-03-09 02:35:03,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:35:03,647 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_unwindbound100.c that has 2 procedures, 192 locations, 1 initial locations, 1 loop locations, and 86 error locations. [2025-03-09 02:35:03,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:35:03,695 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;@111b686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:35:03,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-03-09 02:35:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 101 states have (on average 1.900990099009901) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:35:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:35:03,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:03,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:35:03,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:03,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2141758114, now seen corresponding path program 1 times [2025-03-09 02:35:03,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:03,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972743899] [2025-03-09 02:35:03,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:03,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:35:03,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:35:03,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:03,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972743899] [2025-03-09 02:35:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972743899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993187745] [2025-03-09 02:35:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:03,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:35:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:03,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:35:03,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:35:03,808 INFO L87 Difference]: Start difference. First operand has 192 states, 101 states have (on average 1.900990099009901) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:03,831 INFO L93 Difference]: Finished difference Result 367 states and 394 transitions. [2025-03-09 02:35:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:35:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 02:35:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:03,838 INFO L225 Difference]: With dead ends: 367 [2025-03-09 02:35:03,838 INFO L226 Difference]: Without dead ends: 172 [2025-03-09 02:35:03,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:35:03,844 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:03,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-09 02:35:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-09 02:35:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 96 states have (on average 1.7708333333333333) internal successors, (170), 168 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:35:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2025-03-09 02:35:03,871 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 6 [2025-03-09 02:35:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:03,872 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2025-03-09 02:35:03,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2025-03-09 02:35:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:35:03,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:03,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:35:03,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:35:03,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:03,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2141728323, now seen corresponding path program 1 times [2025-03-09 02:35:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115277101] [2025-03-09 02:35:03,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:03,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:35:03,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:35:03,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:03,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115277101] [2025-03-09 02:35:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115277101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371383690] [2025-03-09 02:35:03,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:03,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:03,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:03,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:03,953 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:04,001 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2025-03-09 02:35:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:35:04,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 02:35:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:04,006 INFO L225 Difference]: With dead ends: 253 [2025-03-09 02:35:04,006 INFO L226 Difference]: Without dead ends: 176 [2025-03-09 02:35:04,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:35:04,007 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 4 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:04,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 503 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-09 02:35:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-09 02:35:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 100 states have (on average 1.74) internal successors, (174), 172 states have internal predecessors, (174), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:35:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2025-03-09 02:35:04,014 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 6 [2025-03-09 02:35:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:04,014 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2025-03-09 02:35:04,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2025-03-09 02:35:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:35:04,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:04,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:04,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:35:04,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:04,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1805825781, now seen corresponding path program 1 times [2025-03-09 02:35:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514344132] [2025-03-09 02:35:04,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:04,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:35:04,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:35:04,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:04,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:04,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:04,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514344132] [2025-03-09 02:35:04,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514344132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:04,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:04,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514734809] [2025-03-09 02:35:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:04,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:35:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:04,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:35:04,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:04,062 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:04,414 INFO L93 Difference]: Finished difference Result 312 states and 324 transitions. [2025-03-09 02:35:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:35:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 02:35:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:04,416 INFO L225 Difference]: With dead ends: 312 [2025-03-09 02:35:04,416 INFO L226 Difference]: Without dead ends: 256 [2025-03-09 02:35:04,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:04,417 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 82 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:04,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 127 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:35:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-09 02:35:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2025-03-09 02:35:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 245 states have internal predecessors, (261), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:35:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 267 transitions. [2025-03-09 02:35:04,429 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 267 transitions. Word has length 9 [2025-03-09 02:35:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 267 transitions. [2025-03-09 02:35:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 267 transitions. [2025-03-09 02:35:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:35:04,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:04,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:04,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:35:04,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1109740071, now seen corresponding path program 1 times [2025-03-09 02:35:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18825377] [2025-03-09 02:35:04,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:04,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:35:04,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:35:04,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:04,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:04,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:04,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18825377] [2025-03-09 02:35:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18825377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:04,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921000671] [2025-03-09 02:35:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:04,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:35:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:04,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:35:04,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:04,512 INFO L87 Difference]: Start difference. First operand 250 states and 267 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:04,573 INFO L93 Difference]: Finished difference Result 269 states and 281 transitions. [2025-03-09 02:35:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:35:04,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-09 02:35:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:04,574 INFO L225 Difference]: With dead ends: 269 [2025-03-09 02:35:04,574 INFO L226 Difference]: Without dead ends: 264 [2025-03-09 02:35:04,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:04,575 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 58 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:04,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 296 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:35:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-09 02:35:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 257. [2025-03-09 02:35:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 180 states have (on average 1.488888888888889) internal successors, (268), 252 states have internal predecessors, (268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:35:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 274 transitions. [2025-03-09 02:35:04,582 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 274 transitions. Word has length 37 [2025-03-09 02:35:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:04,583 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 274 transitions. [2025-03-09 02:35:04,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 274 transitions. [2025-03-09 02:35:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 02:35:04,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:04,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:04,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:35:04,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:04,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1308316073, now seen corresponding path program 1 times [2025-03-09 02:35:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:04,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324661137] [2025-03-09 02:35:04,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:04,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 02:35:04,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 02:35:04,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:04,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324661137] [2025-03-09 02:35:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324661137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:35:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130126804] [2025-03-09 02:35:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:04,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:04,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:04,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:04,676 INFO L87 Difference]: Start difference. First operand 257 states and 274 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:04,803 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2025-03-09 02:35:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-09 02:35:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:04,805 INFO L225 Difference]: With dead ends: 268 [2025-03-09 02:35:04,805 INFO L226 Difference]: Without dead ends: 263 [2025-03-09 02:35:04,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:04,805 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 136 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:04,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 233 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:35:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-09 02:35:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2025-03-09 02:35:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 180 states have (on average 1.461111111111111) internal successors, (263), 252 states have internal predecessors, (263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:35:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 269 transitions. [2025-03-09 02:35:04,819 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 269 transitions. Word has length 39 [2025-03-09 02:35:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:04,819 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 269 transitions. [2025-03-09 02:35:04,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 269 transitions. [2025-03-09 02:35:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:35:04,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:04,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:04,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:35:04,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1903092517, now seen corresponding path program 1 times [2025-03-09 02:35:04,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:04,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428066419] [2025-03-09 02:35:04,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:04,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:04,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:35:04,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:35:04,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:04,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428066419] [2025-03-09 02:35:04,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428066419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:04,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:04,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:35:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394955783] [2025-03-09 02:35:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:04,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:04,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:04,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:04,892 INFO L87 Difference]: Start difference. First operand 257 states and 269 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:05,019 INFO L93 Difference]: Finished difference Result 267 states and 271 transitions. [2025-03-09 02:35:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:05,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-03-09 02:35:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:05,021 INFO L225 Difference]: With dead ends: 267 [2025-03-09 02:35:05,021 INFO L226 Difference]: Without dead ends: 229 [2025-03-09 02:35:05,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:05,022 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 128 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:05,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 246 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:35:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-09 02:35:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2025-03-09 02:35:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 218 states have internal predecessors, (225), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:35:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 231 transitions. [2025-03-09 02:35:05,028 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 231 transitions. Word has length 40 [2025-03-09 02:35:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:05,028 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 231 transitions. [2025-03-09 02:35:05,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:35:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 231 transitions. [2025-03-09 02:35:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:35:05,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:05,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:05,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:35:05,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:05,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2050676589, now seen corresponding path program 1 times [2025-03-09 02:35:05,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:05,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332799017] [2025-03-09 02:35:05,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:05,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:05,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:35:05,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:35:05,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:05,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332799017] [2025-03-09 02:35:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332799017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:05,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:05,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131332715] [2025-03-09 02:35:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:05,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:35:05,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:05,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:35:05,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:05,091 INFO L87 Difference]: Start difference. First operand 223 states and 231 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:05,103 INFO L93 Difference]: Finished difference Result 225 states and 231 transitions. [2025-03-09 02:35:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:35:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-09 02:35:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:05,104 INFO L225 Difference]: With dead ends: 225 [2025-03-09 02:35:05,104 INFO L226 Difference]: Without dead ends: 223 [2025-03-09 02:35:05,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:05,105 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:05,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-09 02:35:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-09 02:35:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 218 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:35:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 229 transitions. [2025-03-09 02:35:05,111 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 229 transitions. Word has length 49 [2025-03-09 02:35:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:05,112 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 229 transitions. [2025-03-09 02:35:05,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 229 transitions. [2025-03-09 02:35:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:35:05,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:05,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:05,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:35:05,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:05,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:05,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1911217840, now seen corresponding path program 1 times [2025-03-09 02:35:05,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:05,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764578746] [2025-03-09 02:35:05,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:05,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:05,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:35:05,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:35:05,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:05,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:35:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197203813] [2025-03-09 02:35:05,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:05,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:05,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:35:05,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:35:05,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:35:05,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:35:05,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:05,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:05,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:35:05,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:05,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:35:05,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:05,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764578746] [2025-03-09 02:35:05,280 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:35:05,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197203813] [2025-03-09 02:35:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197203813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:35:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975883336] [2025-03-09 02:35:05,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:05,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:05,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:05,281 INFO L87 Difference]: Start difference. First operand 223 states and 229 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:05,592 INFO L93 Difference]: Finished difference Result 367 states and 384 transitions. [2025-03-09 02:35:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:05,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-09 02:35:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:05,594 INFO L225 Difference]: With dead ends: 367 [2025-03-09 02:35:05,594 INFO L226 Difference]: Without dead ends: 313 [2025-03-09 02:35:05,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:05,594 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 96 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:05,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 156 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:35:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-09 02:35:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 305. [2025-03-09 02:35:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 226 states have (on average 1.415929203539823) internal successors, (320), 298 states have internal predecessors, (320), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 330 transitions. [2025-03-09 02:35:05,602 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 330 transitions. Word has length 54 [2025-03-09 02:35:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:05,602 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 330 transitions. [2025-03-09 02:35:05,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 330 transitions. [2025-03-09 02:35:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:35:05,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:05,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:05,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:35:05,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:05,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:05,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1956860886, now seen corresponding path program 1 times [2025-03-09 02:35:05,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:05,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310389195] [2025-03-09 02:35:05,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:05,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:05,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:35:05,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:35:05,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:05,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310389195] [2025-03-09 02:35:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310389195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:05,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:05,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:35:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831990276] [2025-03-09 02:35:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:05,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:05,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:05,861 INFO L87 Difference]: Start difference. First operand 305 states and 330 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:06,074 INFO L93 Difference]: Finished difference Result 306 states and 330 transitions. [2025-03-09 02:35:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2025-03-09 02:35:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:06,075 INFO L225 Difference]: With dead ends: 306 [2025-03-09 02:35:06,075 INFO L226 Difference]: Without dead ends: 305 [2025-03-09 02:35:06,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:06,076 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 42 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:06,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 302 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:35:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-09 02:35:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-09 02:35:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 226 states have (on average 1.4115044247787611) internal successors, (319), 298 states have internal predecessors, (319), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 329 transitions. [2025-03-09 02:35:06,087 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 329 transitions. Word has length 60 [2025-03-09 02:35:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:06,087 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 329 transitions. [2025-03-09 02:35:06,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 329 transitions. [2025-03-09 02:35:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 02:35:06,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:06,089 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:06,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:35:06,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:06,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash 652369064, now seen corresponding path program 1 times [2025-03-09 02:35:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:06,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566298287] [2025-03-09 02:35:06,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:06,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:35:06,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:35:06,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:06,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:06,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:06,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566298287] [2025-03-09 02:35:06,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566298287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:35:06,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562560375] [2025-03-09 02:35:06,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:06,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:06,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:06,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:35:06,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:35:06,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:35:06,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:35:06,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:06,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:06,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:35:06,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:06,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:35:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562560375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:06,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:35:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:35:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902263877] [2025-03-09 02:35:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:35:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:06,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:35:06,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:35:06,316 INFO L87 Difference]: Start difference. First operand 305 states and 329 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:06,333 INFO L93 Difference]: Finished difference Result 305 states and 329 transitions. [2025-03-09 02:35:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-09 02:35:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:06,335 INFO L225 Difference]: With dead ends: 305 [2025-03-09 02:35:06,335 INFO L226 Difference]: Without dead ends: 304 [2025-03-09 02:35:06,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:35:06,336 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 121 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:06,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-09 02:35:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-03-09 02:35:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 297 states have internal predecessors, (317), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 327 transitions. [2025-03-09 02:35:06,344 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 327 transitions. Word has length 62 [2025-03-09 02:35:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:06,344 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 327 transitions. [2025-03-09 02:35:06,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 327 transitions. [2025-03-09 02:35:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 02:35:06,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:06,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:06,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:35:06,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 02:35:06,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:06,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:06,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1251395348, now seen corresponding path program 1 times [2025-03-09 02:35:06,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:06,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083397103] [2025-03-09 02:35:06,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:06,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:06,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:35:06,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:35:06,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083397103] [2025-03-09 02:35:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083397103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:35:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088753626] [2025-03-09 02:35:06,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:06,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:06,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:35:06,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:35:06,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:35:06,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:35:06,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:06,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:06,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:35:06,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:06,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:35:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088753626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:06,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:35:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:35:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452564588] [2025-03-09 02:35:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:06,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:35:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:06,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:35:06,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:35:06,756 INFO L87 Difference]: Start difference. First operand 304 states and 327 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:06,794 INFO L93 Difference]: Finished difference Result 416 states and 446 transitions. [2025-03-09 02:35:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:35:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-09 02:35:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:06,795 INFO L225 Difference]: With dead ends: 416 [2025-03-09 02:35:06,795 INFO L226 Difference]: Without dead ends: 415 [2025-03-09 02:35:06,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:35:06,796 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 118 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:06,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 781 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-09 02:35:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 377. [2025-03-09 02:35:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 297 states have (on average 1.4175084175084176) internal successors, (421), 369 states have internal predecessors, (421), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:35:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 435 transitions. [2025-03-09 02:35:06,804 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 435 transitions. Word has length 63 [2025-03-09 02:35:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:06,805 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 435 transitions. [2025-03-09 02:35:06,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 435 transitions. [2025-03-09 02:35:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 02:35:06,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:06,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:06,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:35:07,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:07,006 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:07,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -859206258, now seen corresponding path program 1 times [2025-03-09 02:35:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928275376] [2025-03-09 02:35:07,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:07,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 02:35:07,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 02:35:07,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:07,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:35:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614120652] [2025-03-09 02:35:07,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:07,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:07,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:35:07,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:35:07,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 02:35:07,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 02:35:07,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:07,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:07,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:35:07,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 02:35:07,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:35:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:07,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928275376] [2025-03-09 02:35:07,170 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:35:07,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614120652] [2025-03-09 02:35:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614120652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:07,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:07,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267518646] [2025-03-09 02:35:07,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:07,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:35:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:07,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:35:07,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:07,171 INFO L87 Difference]: Start difference. First operand 377 states and 435 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:07,215 INFO L93 Difference]: Finished difference Result 377 states and 435 transitions. [2025-03-09 02:35:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:35:07,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-09 02:35:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:07,217 INFO L225 Difference]: With dead ends: 377 [2025-03-09 02:35:07,217 INFO L226 Difference]: Without dead ends: 374 [2025-03-09 02:35:07,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:07,218 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:07,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 151 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-09 02:35:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-03-09 02:35:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 297 states have (on average 1.393939393939394) internal successors, (414), 366 states have internal predecessors, (414), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:35:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 428 transitions. [2025-03-09 02:35:07,262 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 428 transitions. Word has length 93 [2025-03-09 02:35:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:07,263 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 428 transitions. [2025-03-09 02:35:07,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:35:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 428 transitions. [2025-03-09 02:35:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 02:35:07,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:07,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:07,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:35:07,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:07,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:07,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash -865590136, now seen corresponding path program 1 times [2025-03-09 02:35:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960642724] [2025-03-09 02:35:07,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:07,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 02:35:07,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 02:35:07,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:07,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:35:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256394881] [2025-03-09 02:35:07,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:07,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:07,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:07,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:35:07,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:35:07,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 02:35:07,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 02:35:07,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:07,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:07,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:35:07,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:07,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:35:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960642724] [2025-03-09 02:35:07,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:35:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256394881] [2025-03-09 02:35:07,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256394881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:35:07,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:35:07,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 02:35:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671377403] [2025-03-09 02:35:07,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:35:07,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:35:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:07,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:35:07,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:35:07,916 INFO L87 Difference]: Start difference. First operand 374 states and 428 transitions. Second operand has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:35:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:08,538 INFO L93 Difference]: Finished difference Result 503 states and 554 transitions. [2025-03-09 02:35:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:35:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-03-09 02:35:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:08,541 INFO L225 Difference]: With dead ends: 503 [2025-03-09 02:35:08,541 INFO L226 Difference]: Without dead ends: 496 [2025-03-09 02:35:08,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:35:08,541 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 291 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:08,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 359 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:35:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-09 02:35:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 446. [2025-03-09 02:35:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 369 states have (on average 1.4336043360433603) internal successors, (529), 438 states have internal predecessors, (529), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:35:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 543 transitions. [2025-03-09 02:35:08,551 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 543 transitions. Word has length 94 [2025-03-09 02:35:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:08,551 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 543 transitions. [2025-03-09 02:35:08,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:35:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 543 transitions. [2025-03-09 02:35:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 02:35:08,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:08,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:08,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:35:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 02:35:08,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:35:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1063490356, now seen corresponding path program 1 times [2025-03-09 02:35:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:08,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577145508] [2025-03-09 02:35:08,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:08,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:35:08,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:35:08,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:08,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:35:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692992120] [2025-03-09 02:35:08,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:08,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:08,780 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:35:08,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:35:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:35:08,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:35:08,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:08,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:35:08,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:09,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:35:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:35:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:09,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577145508] [2025-03-09 02:35:09,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:35:09,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692992120] [2025-03-09 02:35:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692992120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:35:09,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:35:09,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-09 02:35:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001652839] [2025-03-09 02:35:09,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:35:09,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:35:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:09,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:35:09,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:35:09,745 INFO L87 Difference]: Start difference. First operand 446 states and 543 transitions. Second operand has 9 states, 8 states have (on average 22.5) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:35:12,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:17,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:22,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:30,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:33,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:36,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:41,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:45,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:49,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:53,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:35:57,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:02,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:07,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:11,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:15,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:19,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:22,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:26,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:31,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:35,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:40,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:40,225 INFO L93 Difference]: Finished difference Result 458 states and 543 transitions. [2025-03-09 02:36:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:36:40,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 22.5) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-03-09 02:36:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:40,228 INFO L225 Difference]: With dead ends: 458 [2025-03-09 02:36:40,228 INFO L226 Difference]: Without dead ends: 450 [2025-03-09 02:36:40,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:36:40,229 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 282 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 41 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:40,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 110 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 859 Invalid, 17 Unknown, 0 Unchecked, 86.0s Time] [2025-03-09 02:36:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-09 02:36:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 444. [2025-03-09 02:36:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 369 states have (on average 1.3929539295392954) internal successors, (514), 436 states have internal predecessors, (514), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:36:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 528 transitions. [2025-03-09 02:36:40,244 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 528 transitions. Word has length 95 [2025-03-09 02:36:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:40,244 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 528 transitions. [2025-03-09 02:36:40,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 22.5) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 528 transitions. [2025-03-09 02:36:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 02:36:40,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:40,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:40,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:36:40,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:40,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:40,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 823309030, now seen corresponding path program 1 times [2025-03-09 02:36:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76729372] [2025-03-09 02:36:40,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:40,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 02:36:40,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:36:40,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:40,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76729372] [2025-03-09 02:36:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76729372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840552630] [2025-03-09 02:36:40,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:40,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:40,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:40,583 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:36:40,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:36:40,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 02:36:40,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:36:40,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:40,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:40,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:36:40,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:36:40,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:40,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840552630] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:36:40,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:36:40,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2025-03-09 02:36:40,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413552998] [2025-03-09 02:36:40,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:40,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:36:40,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:40,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:36:40,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:36:40,796 INFO L87 Difference]: Start difference. First operand 444 states and 528 transitions. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:36:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:40,915 INFO L93 Difference]: Finished difference Result 660 states and 717 transitions. [2025-03-09 02:36:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:36:40,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 104 [2025-03-09 02:36:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:40,919 INFO L225 Difference]: With dead ends: 660 [2025-03-09 02:36:40,919 INFO L226 Difference]: Without dead ends: 520 [2025-03-09 02:36:40,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:36:40,922 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 264 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:40,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1396 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:36:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-09 02:36:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 448. [2025-03-09 02:36:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 369 states have (on average 1.4308943089430894) internal successors, (528), 436 states have internal predecessors, (528), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:36:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 544 transitions. [2025-03-09 02:36:40,939 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 544 transitions. Word has length 104 [2025-03-09 02:36:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:40,939 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 544 transitions. [2025-03-09 02:36:40,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:36:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 544 transitions. [2025-03-09 02:36:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 02:36:40,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:40,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:40,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:36:41,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:41,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:41,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:41,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1288509640, now seen corresponding path program 1 times [2025-03-09 02:36:41,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:41,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061361219] [2025-03-09 02:36:41,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:41,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:41,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:36:41,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:36:41,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:41,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061361219] [2025-03-09 02:36:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061361219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:41,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455759137] [2025-03-09 02:36:41,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:41,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:41,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:36:41,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:36:41,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:36:41,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:36:41,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:41,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:41,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:36:41,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:41,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:36:41,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455759137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:36:41,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:36:41,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:36:41,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215061800] [2025-03-09 02:36:41,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:41,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:36:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:41,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:36:41,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:36:41,384 INFO L87 Difference]: Start difference. First operand 448 states and 544 transitions. Second operand has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:41,404 INFO L93 Difference]: Finished difference Result 481 states and 550 transitions. [2025-03-09 02:36:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:36:41,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-03-09 02:36:41,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:41,406 INFO L225 Difference]: With dead ends: 481 [2025-03-09 02:36:41,406 INFO L226 Difference]: Without dead ends: 480 [2025-03-09 02:36:41,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:36:41,407 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 103 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:41,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:36:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-09 02:36:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 447. [2025-03-09 02:36:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 369 states have (on average 1.4227642276422765) internal successors, (525), 435 states have internal predecessors, (525), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:36:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 541 transitions. [2025-03-09 02:36:41,419 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 541 transitions. Word has length 105 [2025-03-09 02:36:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:41,419 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 541 transitions. [2025-03-09 02:36:41,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 541 transitions. [2025-03-09 02:36:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 02:36:41,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:41,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:41,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:36:41,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 02:36:41,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:41,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1289093247, now seen corresponding path program 1 times [2025-03-09 02:36:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159694519] [2025-03-09 02:36:41,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:41,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:36:41,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:36:41,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:41,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:41,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159694519] [2025-03-09 02:36:41,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159694519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:41,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544488735] [2025-03-09 02:36:41,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:41,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:41,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:41,681 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:36:41,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:36:41,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:36:41,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:36:41,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:41,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:41,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:36:41,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:41,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544488735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:36:41,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:36:41,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:36:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032499939] [2025-03-09 02:36:41,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:41,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:36:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:41,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:36:41,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:36:41,888 INFO L87 Difference]: Start difference. First operand 447 states and 541 transitions. Second operand has 7 states, 6 states have (on average 39.0) internal successors, (234), 7 states have internal predecessors, (234), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:36:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:41,924 INFO L93 Difference]: Finished difference Result 546 states and 609 transitions. [2025-03-09 02:36:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:36:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.0) internal successors, (234), 7 states have internal predecessors, (234), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 106 [2025-03-09 02:36:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:41,925 INFO L225 Difference]: With dead ends: 546 [2025-03-09 02:36:41,926 INFO L226 Difference]: Without dead ends: 545 [2025-03-09 02:36:41,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:36:41,926 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 96 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:41,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 767 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:36:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-09 02:36:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 485. [2025-03-09 02:36:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 406 states have (on average 1.4482758620689655) internal successors, (588), 472 states have internal predecessors, (588), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:36:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 606 transitions. [2025-03-09 02:36:41,936 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 606 transitions. Word has length 106 [2025-03-09 02:36:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:41,936 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 606 transitions. [2025-03-09 02:36:41,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.0) internal successors, (234), 7 states have internal predecessors, (234), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:36:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 606 transitions. [2025-03-09 02:36:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-09 02:36:41,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:41,937 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:36:41,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:36:42,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:36:42,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:42,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash -867064225, now seen corresponding path program 1 times [2025-03-09 02:36:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:42,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785441245] [2025-03-09 02:36:42,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:42,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-09 02:36:42,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 02:36:42,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:42,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 02:36:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785441245] [2025-03-09 02:36:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785441245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:36:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:36:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:36:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490009705] [2025-03-09 02:36:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:42,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:36:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:42,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:36:42,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:36:42,191 INFO L87 Difference]: Start difference. First operand 485 states and 606 transitions. Second operand has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:42,344 INFO L93 Difference]: Finished difference Result 485 states and 606 transitions. [2025-03-09 02:36:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:36:42,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2025-03-09 02:36:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:42,346 INFO L225 Difference]: With dead ends: 485 [2025-03-09 02:36:42,346 INFO L226 Difference]: Without dead ends: 478 [2025-03-09 02:36:42,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:36:42,347 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:42,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 34 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:36:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-09 02:36:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2025-03-09 02:36:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 406 states have (on average 1.3990147783251232) internal successors, (568), 465 states have internal predecessors, (568), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:36:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 586 transitions. [2025-03-09 02:36:42,361 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 586 transitions. Word has length 121 [2025-03-09 02:36:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:42,362 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 586 transitions. [2025-03-09 02:36:42,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 586 transitions. [2025-03-09 02:36:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 02:36:42,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:42,362 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:36:42,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:36:42,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:42,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1109187057, now seen corresponding path program 1 times [2025-03-09 02:36:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:42,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740449223] [2025-03-09 02:36:42,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:42,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 02:36:42,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 02:36:42,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:42,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 02:36:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740449223] [2025-03-09 02:36:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740449223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:36:42,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:36:42,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:36:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146600929] [2025-03-09 02:36:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:42,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:36:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:42,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:36:42,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:36:42,417 INFO L87 Difference]: Start difference. First operand 478 states and 586 transitions. Second operand has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:42,592 INFO L93 Difference]: Finished difference Result 478 states and 586 transitions. [2025-03-09 02:36:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:36:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2025-03-09 02:36:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:42,593 INFO L225 Difference]: With dead ends: 478 [2025-03-09 02:36:42,593 INFO L226 Difference]: Without dead ends: 471 [2025-03-09 02:36:42,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:36:42,594 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:42,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 41 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:36:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-09 02:36:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-09 02:36:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 406 states have (on average 1.3497536945812807) internal successors, (548), 458 states have internal predecessors, (548), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:36:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 566 transitions. [2025-03-09 02:36:42,604 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 566 transitions. Word has length 122 [2025-03-09 02:36:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:42,604 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 566 transitions. [2025-03-09 02:36:42,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 566 transitions. [2025-03-09 02:36:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-09 02:36:42,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:42,605 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:36:42,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:36:42,605 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:42,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash -776867891, now seen corresponding path program 1 times [2025-03-09 02:36:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377847861] [2025-03-09 02:36:42,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:42,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-09 02:36:42,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-09 02:36:42,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:42,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:36:42,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513292942] [2025-03-09 02:36:42,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:42,629 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:36:42,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:36:42,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-09 02:36:42,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-09 02:36:42,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:42,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:42,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:36:42,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:42,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377847861] [2025-03-09 02:36:42,925 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:36:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513292942] [2025-03-09 02:36:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513292942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:36:42,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:36:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 02:36:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062943655] [2025-03-09 02:36:42,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:42,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:36:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:42,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:36:42,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:36:42,927 INFO L87 Difference]: Start difference. First operand 471 states and 566 transitions. Second operand has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:36:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:43,390 INFO L93 Difference]: Finished difference Result 507 states and 572 transitions. [2025-03-09 02:36:43,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:36:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 124 [2025-03-09 02:36:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:43,392 INFO L225 Difference]: With dead ends: 507 [2025-03-09 02:36:43,392 INFO L226 Difference]: Without dead ends: 467 [2025-03-09 02:36:43,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:36:43,393 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 453 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:43,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 163 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:36:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-09 02:36:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2025-03-09 02:36:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 402 states have (on average 1.2487562189054726) internal successors, (502), 451 states have internal predecessors, (502), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:36:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 520 transitions. [2025-03-09 02:36:43,403 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 520 transitions. Word has length 124 [2025-03-09 02:36:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:43,404 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 520 transitions. [2025-03-09 02:36:43,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:36:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 520 transitions. [2025-03-09 02:36:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-09 02:36:43,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:43,404 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:43,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:36:43,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:43,608 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:43,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1473870943, now seen corresponding path program 1 times [2025-03-09 02:36:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:43,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893727295] [2025-03-09 02:36:43,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:43,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-09 02:36:43,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 02:36:43,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:43,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:36:43,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764783454] [2025-03-09 02:36:43,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:43,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:43,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:43,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:36:43,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:36:43,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-09 02:36:43,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 02:36:43,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:43,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:43,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:36:43,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:36:43,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:44,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893727295] [2025-03-09 02:36:44,125 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:36:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764783454] [2025-03-09 02:36:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764783454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:44,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:36:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-09 02:36:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224579061] [2025-03-09 02:36:44,126 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:44,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:36:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:44,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:36:44,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:36:44,126 INFO L87 Difference]: Start difference. First operand 463 states and 520 transitions. Second operand has 5 states, 4 states have (on average 33.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:36:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:44,354 INFO L93 Difference]: Finished difference Result 465 states and 523 transitions. [2025-03-09 02:36:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:36:44,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 33.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 144 [2025-03-09 02:36:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:44,355 INFO L225 Difference]: With dead ends: 465 [2025-03-09 02:36:44,355 INFO L226 Difference]: Without dead ends: 451 [2025-03-09 02:36:44,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:36:44,356 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 65 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:44,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 59 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:36:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-09 02:36:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2025-03-09 02:36:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 402 states have (on average 1.181592039800995) internal successors, (475), 437 states have internal predecessors, (475), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:36:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 493 transitions. [2025-03-09 02:36:44,365 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 493 transitions. Word has length 144 [2025-03-09 02:36:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:44,365 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 493 transitions. [2025-03-09 02:36:44,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 33.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:36:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 493 transitions. [2025-03-09 02:36:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-09 02:36:44,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:44,365 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:44,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:36:44,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 02:36:44,566 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1554641045, now seen corresponding path program 1 times [2025-03-09 02:36:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635235779] [2025-03-09 02:36:44,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:44,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-09 02:36:44,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-09 02:36:44,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:44,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:36:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109862641] [2025-03-09 02:36:44,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:44,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:44,584 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:36:44,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:36:44,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-09 02:36:44,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-09 02:36:44,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:44,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:44,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:36:44,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:36:44,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:45,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635235779] [2025-03-09 02:36:45,133 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:36:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109862641] [2025-03-09 02:36:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109862641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:45,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:36:45,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-09 02:36:45,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454000991] [2025-03-09 02:36:45,133 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:45,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:36:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:45,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:36:45,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:36:45,134 INFO L87 Difference]: Start difference. First operand 449 states and 493 transitions. Second operand has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:36:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:45,413 INFO L93 Difference]: Finished difference Result 452 states and 495 transitions. [2025-03-09 02:36:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:36:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 145 [2025-03-09 02:36:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:45,416 INFO L225 Difference]: With dead ends: 452 [2025-03-09 02:36:45,416 INFO L226 Difference]: Without dead ends: 414 [2025-03-09 02:36:45,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:36:45,417 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:45,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:36:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-09 02:36:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-03-09 02:36:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 368 states have (on average 1.1956521739130435) internal successors, (440), 402 states have internal predecessors, (440), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:36:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 456 transitions. [2025-03-09 02:36:45,428 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 456 transitions. Word has length 145 [2025-03-09 02:36:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:45,428 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 456 transitions. [2025-03-09 02:36:45,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:36:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 456 transitions. [2025-03-09 02:36:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-09 02:36:45,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:45,429 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:36:45,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:36:45,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 02:36:45,630 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash 129941553, now seen corresponding path program 1 times [2025-03-09 02:36:45,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151225301] [2025-03-09 02:36:45,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:45,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-09 02:36:45,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-09 02:36:45,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:45,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:36:45,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52257575] [2025-03-09 02:36:45,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:45,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:45,657 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:36:45,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:36:45,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-09 02:36:45,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-09 02:36:45,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:45,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:45,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:36:45,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:46,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:36:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151225301] [2025-03-09 02:36:46,198 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:36:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52257575] [2025-03-09 02:36:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52257575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:36:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:36:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:36:46,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570923730] [2025-03-09 02:36:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:46,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:36:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:36:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:36:46,199 INFO L87 Difference]: Start difference. First operand 414 states and 456 transitions. Second operand has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:46,514 INFO L93 Difference]: Finished difference Result 417 states and 456 transitions. [2025-03-09 02:36:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:36:46,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 152 [2025-03-09 02:36:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:46,515 INFO L225 Difference]: With dead ends: 417 [2025-03-09 02:36:46,515 INFO L226 Difference]: Without dead ends: 396 [2025-03-09 02:36:46,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:36:46,516 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 174 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:46,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 83 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:36:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-09 02:36:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-09 02:36:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 368 states have (on average 1.078804347826087) internal successors, (397), 384 states have internal predecessors, (397), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:36:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 413 transitions. [2025-03-09 02:36:46,525 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 413 transitions. Word has length 152 [2025-03-09 02:36:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:46,525 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 413 transitions. [2025-03-09 02:36:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:36:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 413 transitions. [2025-03-09 02:36:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-09 02:36:46,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:46,526 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:36:46,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 02:36:46,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 02:36:46,731 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:36:46,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash -266779073, now seen corresponding path program 1 times [2025-03-09 02:36:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:46,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948916661] [2025-03-09 02:36:46,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:46,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:46,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes.