./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/egcd.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/egcd.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 01ca8c8e30ceefcd4f6e4832a31edd1224d925e8551df750bd60cc922035a838 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:47:39,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:47:39,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:47:39,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:47:39,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:47:39,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:47:39,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:47:39,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:47:39,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:47:39,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:47:39,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:47:39,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:47:39,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:47:39,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:47:39,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:47:39,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:47:39,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:47:39,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:47:39,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:47:39,811 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 -> 01ca8c8e30ceefcd4f6e4832a31edd1224d925e8551df750bd60cc922035a838 [2025-03-04 10:47:40,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:47:40,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:47:40,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:47:40,028 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:47:40,028 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:47:40,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/egcd.c [2025-03-04 10:47:41,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf72771d/65aab70208bf4246852233fed0f68495/FLAGb32e0ebaf [2025-03-04 10:47:41,320 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:47:41,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/egcd.c [2025-03-04 10:47:41,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf72771d/65aab70208bf4246852233fed0f68495/FLAGb32e0ebaf [2025-03-04 10:47:41,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf72771d/65aab70208bf4246852233fed0f68495 [2025-03-04 10:47:41,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:47:41,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:47:41,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:47:41,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:47:41,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:47:41,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2d7d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41, skipping insertion in model container [2025-03-04 10:47:41,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:47:41,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:47:41,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:47:41,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:47:41,845 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:47:41,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41 WrapperNode [2025-03-04 10:47:41,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:47:41,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:47:41,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:47:41,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:47:41,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,878 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 121 [2025-03-04 10:47:41,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:47:41,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:47:41,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:47:41,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:47:41,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,903 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-04 10:47:41,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:47:41,916 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:47:41,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:47:41,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:47:41,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (1/1) ... [2025-03-04 10:47:41,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:47:41,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:41,951 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-04 10:47:41,955 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-04 10:47:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:47:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 10:47:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 10:47:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:47:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:47:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:47:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:47:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:47:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:47:42,017 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:47:42,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:47:42,352 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2025-03-04 10:47:42,352 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:47:42,366 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:47:42,369 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:47:42,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:47:42 BoogieIcfgContainer [2025-03-04 10:47:42,370 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:47:42,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:47:42,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:47:42,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:47:42,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:47:41" (1/3) ... [2025-03-04 10:47:42,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b7f196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:47:42, skipping insertion in model container [2025-03-04 10:47:42,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:41" (2/3) ... [2025-03-04 10:47:42,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b7f196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:47:42, skipping insertion in model container [2025-03-04 10:47:42,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:47:42" (3/3) ... [2025-03-04 10:47:42,379 INFO L128 eAbstractionObserver]: Analyzing ICFG egcd.c [2025-03-04 10:47:42,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:47:42,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd.c that has 3 procedures, 140 locations, 1 initial locations, 1 loop locations, and 56 error locations. [2025-03-04 10:47:42,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:47:42,444 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;@5c7428ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:47:42,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-04 10:47:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 128 states have internal predecessors, (133), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:47:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:47:42,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:42,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:42,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1395958554, now seen corresponding path program 1 times [2025-03-04 10:47:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:42,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369775333] [2025-03-04 10:47:42,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:42,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:47:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:47:42,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:42,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:47:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369775333] [2025-03-04 10:47:42,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369775333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186818880] [2025-03-04 10:47:42,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:42,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:42,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:42,573 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-04 10:47:42,575 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-04 10:47:42,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:47:42,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:47:42,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:42,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:42,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 10:47:42,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:47:42,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:42,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186818880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:42,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:42,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 10:47:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486391050] [2025-03-04 10:47:42,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:42,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:47:42,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:42,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:47:42,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:47:42,646 INFO L87 Difference]: Start difference. First operand has 140 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 128 states have internal predecessors, (133), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:42,666 INFO L93 Difference]: Finished difference Result 276 states and 306 transitions. [2025-03-04 10:47:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:47:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-04 10:47:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:42,673 INFO L225 Difference]: With dead ends: 276 [2025-03-04 10:47:42,673 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 10:47:42,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-04 10:47:42,677 INFO L435 NwaCegarLoop]: 147 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, 147 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-04 10:47:42,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 10:47:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-04 10:47:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 122 states have internal predecessors, (124), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:47:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2025-03-04 10:47:42,718 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 14 [2025-03-04 10:47:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:42,719 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2025-03-04 10:47:42,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2025-03-04 10:47:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:47:42,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:42,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:42,732 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-04 10:47:42,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 10:47:42,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1200368570, now seen corresponding path program 1 times [2025-03-04 10:47:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:42,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284228652] [2025-03-04 10:47:42,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:42,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:47:42,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:47:42,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:42,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238988540] [2025-03-04 10:47:42,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:42,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:42,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:42,948 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-04 10:47:42,950 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-04 10:47:42,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:47:42,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:47:42,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:42,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:42,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:47:42,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:43,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284228652] [2025-03-04 10:47:43,014 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:43,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238988540] [2025-03-04 10:47:43,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238988540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:43,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:43,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912497856] [2025-03-04 10:47:43,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:43,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:43,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:43,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:43,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:43,015 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:43,219 INFO L93 Difference]: Finished difference Result 217 states and 263 transitions. [2025-03-04 10:47:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:43,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2025-03-04 10:47:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:43,220 INFO L225 Difference]: With dead ends: 217 [2025-03-04 10:47:43,220 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 10:47:43,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-04 10:47:43,221 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 73 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:43,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 136 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 10:47:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 171. [2025-03-04 10:47:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 100 states have (on average 1.86) internal successors, (186), 155 states have internal predecessors, (186), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 10:47:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 212 transitions. [2025-03-04 10:47:43,232 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 212 transitions. Word has length 14 [2025-03-04 10:47:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:43,232 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 212 transitions. [2025-03-04 10:47:43,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 212 transitions. [2025-03-04 10:47:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:47:43,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:43,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:43,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:47:43,433 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,SelfDestructingSolverStorable1 [2025-03-04 10:47:43,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:43,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1792003912, now seen corresponding path program 1 times [2025-03-04 10:47:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:43,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538624236] [2025-03-04 10:47:43,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:43,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:47:43,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:47:43,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:43,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667712765] [2025-03-04 10:47:43,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:43,458 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-04 10:47:43,459 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-04 10:47:43,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:47:43,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:47:43,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:43,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:43,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:47:43,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:43,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:43,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538624236] [2025-03-04 10:47:43,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667712765] [2025-03-04 10:47:43,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667712765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:43,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:43,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:43,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267526260] [2025-03-04 10:47:43,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:43,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:43,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:43,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:43,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:43,506 INFO L87 Difference]: Start difference. First operand 171 states and 212 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:43,644 INFO L93 Difference]: Finished difference Result 271 states and 335 transitions. [2025-03-04 10:47:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:43,645 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-03-04 10:47:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:43,646 INFO L225 Difference]: With dead ends: 271 [2025-03-04 10:47:43,646 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 10:47:43,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-04 10:47:43,647 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:43,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 194 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 10:47:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 223. [2025-03-04 10:47:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.8082191780821917) internal successors, (264), 201 states have internal predecessors, (264), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 10:47:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2025-03-04 10:47:43,664 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 16 [2025-03-04 10:47:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:43,664 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2025-03-04 10:47:43,664 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2025-03-04 10:47:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:47:43,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:43,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:43,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:43,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:43,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:43,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash 166129078, now seen corresponding path program 1 times [2025-03-04 10:47:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:43,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441181034] [2025-03-04 10:47:43,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:43,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:47:43,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:47:43,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:43,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296928748] [2025-03-04 10:47:43,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:43,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:43,883 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-04 10:47:43,884 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-04 10:47:43,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:47:43,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:47:43,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:43,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:47:43,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:43,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:43,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441181034] [2025-03-04 10:47:43,952 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:43,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296928748] [2025-03-04 10:47:43,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296928748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:43,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:43,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054448316] [2025-03-04 10:47:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:43,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:43,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:43,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:43,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:43,953 INFO L87 Difference]: Start difference. First operand 223 states and 302 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:44,123 INFO L93 Difference]: Finished difference Result 257 states and 321 transitions. [2025-03-04 10:47:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:44,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-04 10:47:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:44,124 INFO L225 Difference]: With dead ends: 257 [2025-03-04 10:47:44,124 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 10:47:44,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-04 10:47:44,125 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 61 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:44,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 122 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 10:47:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 189. [2025-03-04 10:47:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 172 states have internal predecessors, (202), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 10:47:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 230 transitions. [2025-03-04 10:47:44,133 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 230 transitions. Word has length 18 [2025-03-04 10:47:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:44,134 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 230 transitions. [2025-03-04 10:47:44,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 230 transitions. [2025-03-04 10:47:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:47:44,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:44,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:44,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:47:44,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:44,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:44,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1356630459, now seen corresponding path program 1 times [2025-03-04 10:47:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:44,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733298876] [2025-03-04 10:47:44,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:44,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:47:44,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:47:44,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:44,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:44,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889478952] [2025-03-04 10:47:44,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:44,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:44,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:44,353 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-04 10:47:44,354 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-04 10:47:44,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:47:44,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:47:44,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:44,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:44,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:47:44,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:44,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733298876] [2025-03-04 10:47:44,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889478952] [2025-03-04 10:47:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889478952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:44,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60372753] [2025-03-04 10:47:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:44,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:44,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:44,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:44,407 INFO L87 Difference]: Start difference. First operand 189 states and 230 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-04 10:47:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:44,535 INFO L93 Difference]: Finished difference Result 349 states and 447 transitions. [2025-03-04 10:47:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:44,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 25 [2025-03-04 10:47:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:44,537 INFO L225 Difference]: With dead ends: 349 [2025-03-04 10:47:44,537 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 10:47:44,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-04 10:47:44,538 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:44,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 190 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 10:47:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 266. [2025-03-04 10:47:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 185 states have (on average 1.7081081081081082) internal successors, (316), 240 states have internal predecessors, (316), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2025-03-04 10:47:44,553 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 25 [2025-03-04 10:47:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:44,553 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2025-03-04 10:47:44,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-04 10:47:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2025-03-04 10:47:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:47:44,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:44,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:44,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:47:44,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:44,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:44,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:44,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1948189411, now seen corresponding path program 1 times [2025-03-04 10:47:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:44,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864784557] [2025-03-04 10:47:44,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:44,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:44,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:47:44,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:47:44,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:44,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:44,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1239803243] [2025-03-04 10:47:44,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:44,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:44,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:44,777 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-04 10:47:44,778 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-04 10:47:44,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:47:44,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:47:44,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:44,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:44,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:44,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:44,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:44,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:44,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864784557] [2025-03-04 10:47:44,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:44,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239803243] [2025-03-04 10:47:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239803243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:44,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:44,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380908483] [2025-03-04 10:47:44,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:44,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:44,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:44,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:44,873 INFO L87 Difference]: Start difference. First operand 266 states and 362 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04 10:47:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:45,014 INFO L93 Difference]: Finished difference Result 319 states and 427 transitions. [2025-03-04 10:47:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:45,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 27 [2025-03-04 10:47:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:45,016 INFO L225 Difference]: With dead ends: 319 [2025-03-04 10:47:45,016 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 10:47:45,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-04 10:47:45,018 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 230 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:45,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 135 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 10:47:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2025-03-04 10:47:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 185 states have (on average 1.6864864864864866) internal successors, (312), 240 states have internal predecessors, (312), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 358 transitions. [2025-03-04 10:47:45,029 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 358 transitions. Word has length 27 [2025-03-04 10:47:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:45,029 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 358 transitions. [2025-03-04 10:47:45,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04 10:47:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 358 transitions. [2025-03-04 10:47:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:47:45,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:45,030 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 10:47:45,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:45,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:45,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:45,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash 264329672, now seen corresponding path program 1 times [2025-03-04 10:47:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:45,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383206737] [2025-03-04 10:47:45,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:45,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:47:45,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:47:45,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:45,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336170532] [2025-03-04 10:47:45,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:45,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:45,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:45,243 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-04 10:47:45,244 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-04 10:47:45,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:47:45,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:47:45,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:45,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:45,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:45,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:45,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383206737] [2025-03-04 10:47:45,317 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336170532] [2025-03-04 10:47:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336170532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:45,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943777821] [2025-03-04 10:47:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:45,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:45,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:45,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:45,318 INFO L87 Difference]: Start difference. First operand 266 states and 358 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-04 10:47:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:45,482 INFO L93 Difference]: Finished difference Result 319 states and 423 transitions. [2025-03-04 10:47:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:45,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 28 [2025-03-04 10:47:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:45,483 INFO L225 Difference]: With dead ends: 319 [2025-03-04 10:47:45,483 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 10:47:45,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-04 10:47:45,484 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 169 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:45,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 150 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 10:47:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2025-03-04 10:47:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 185 states have (on average 1.664864864864865) internal successors, (308), 240 states have internal predecessors, (308), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 354 transitions. [2025-03-04 10:47:45,494 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 354 transitions. Word has length 28 [2025-03-04 10:47:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:45,494 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 354 transitions. [2025-03-04 10:47:45,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-04 10:47:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 354 transitions. [2025-03-04 10:47:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 10:47:45,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:45,496 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 10:47:45,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:47:45,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:45,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:45,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash -395714687, now seen corresponding path program 1 times [2025-03-04 10:47:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176457910] [2025-03-04 10:47:45,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:45,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:47:45,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:47:45,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:45,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156395231] [2025-03-04 10:47:45,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:45,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:45,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:45,716 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-04 10:47:45,718 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-04 10:47:45,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:47:45,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:47:45,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:45,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:45,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:45,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:45,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176457910] [2025-03-04 10:47:45,774 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156395231] [2025-03-04 10:47:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156395231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:45,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044687567] [2025-03-04 10:47:45,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:45,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:45,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:45,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:45,775 INFO L87 Difference]: Start difference. First operand 266 states and 354 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-04 10:47:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:46,005 INFO L93 Difference]: Finished difference Result 339 states and 427 transitions. [2025-03-04 10:47:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:46,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 29 [2025-03-04 10:47:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:46,007 INFO L225 Difference]: With dead ends: 339 [2025-03-04 10:47:46,007 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 10:47:46,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-04 10:47:46,008 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:46,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 159 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 10:47:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 267. [2025-03-04 10:47:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 186 states have (on average 1.6451612903225807) internal successors, (306), 241 states have internal predecessors, (306), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2025-03-04 10:47:46,019 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 29 [2025-03-04 10:47:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:46,022 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2025-03-04 10:47:46,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-04 10:47:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2025-03-04 10:47:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:47:46,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:46,023 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 10:47:46,032 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-04 10:47:46,223 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,SelfDestructingSolverStorable7 [2025-03-04 10:47:46,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:46,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 617746662, now seen corresponding path program 1 times [2025-03-04 10:47:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:46,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446040064] [2025-03-04 10:47:46,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:46,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:47:46,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:47:46,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:46,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637712922] [2025-03-04 10:47:46,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:46,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:46,245 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-04 10:47:46,247 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-04 10:47:46,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:47:46,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:47:46,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:46,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:46,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:46,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:46,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446040064] [2025-03-04 10:47:46,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637712922] [2025-03-04 10:47:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637712922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593526024] [2025-03-04 10:47:46,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:46,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:46,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:46,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:46,322 INFO L87 Difference]: Start difference. First operand 267 states and 352 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-04 10:47:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:46,668 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2025-03-04 10:47:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 30 [2025-03-04 10:47:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:46,670 INFO L225 Difference]: With dead ends: 339 [2025-03-04 10:47:46,670 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 10:47:46,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-04 10:47:46,671 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 139 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:46,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 162 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:47:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 10:47:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 268. [2025-03-04 10:47:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 187 states have (on average 1.625668449197861) internal successors, (304), 242 states have internal predecessors, (304), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 350 transitions. [2025-03-04 10:47:46,679 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 350 transitions. Word has length 30 [2025-03-04 10:47:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:46,680 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 350 transitions. [2025-03-04 10:47:46,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-04 10:47:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 350 transitions. [2025-03-04 10:47:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:47:46,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:46,680 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] [2025-03-04 10:47:46,686 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-04 10:47:46,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:46,885 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:46,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1247464834, now seen corresponding path program 1 times [2025-03-04 10:47:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106405340] [2025-03-04 10:47:46,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:46,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:47:46,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:47:46,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:46,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136617702] [2025-03-04 10:47:46,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:46,898 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-04 10:47:46,899 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-04 10:47:46,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:47:46,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:47:46,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:46,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:46,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:47:46,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:46,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:46,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106405340] [2025-03-04 10:47:46,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136617702] [2025-03-04 10:47:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136617702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:46,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634670135] [2025-03-04 10:47:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:46,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:46,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:46,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:46,992 INFO L87 Difference]: Start difference. First operand 268 states and 350 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:47,142 INFO L93 Difference]: Finished difference Result 290 states and 369 transitions. [2025-03-04 10:47:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2025-03-04 10:47:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:47,145 INFO L225 Difference]: With dead ends: 290 [2025-03-04 10:47:47,146 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 10:47:47,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-04 10:47:47,147 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 208 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:47,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 145 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 10:47:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 269. [2025-03-04 10:47:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 188 states have (on average 1.6117021276595744) internal successors, (303), 243 states have internal predecessors, (303), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 349 transitions. [2025-03-04 10:47:47,156 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 349 transitions. Word has length 38 [2025-03-04 10:47:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:47,157 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 349 transitions. [2025-03-04 10:47:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 349 transitions. [2025-03-04 10:47:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 10:47:47,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:47,159 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] [2025-03-04 10:47:47,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:47:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:47:47,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:47,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 16704252, now seen corresponding path program 1 times [2025-03-04 10:47:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:47,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702464887] [2025-03-04 10:47:47,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:47,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:47:47,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:47:47,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:47,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:47,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137097019] [2025-03-04 10:47:47,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:47,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:47,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:47,386 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-04 10:47:47,387 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-04 10:47:47,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:47:47,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:47:47,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:47,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:47,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:47,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:47:47,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702464887] [2025-03-04 10:47:47,486 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137097019] [2025-03-04 10:47:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137097019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190788991] [2025-03-04 10:47:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:47,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:47,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:47,487 INFO L87 Difference]: Start difference. First operand 269 states and 349 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:47,693 INFO L93 Difference]: Finished difference Result 290 states and 366 transitions. [2025-03-04 10:47:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:47,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2025-03-04 10:47:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:47,694 INFO L225 Difference]: With dead ends: 290 [2025-03-04 10:47:47,694 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 10:47:47,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-04 10:47:47,695 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 153 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:47,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 160 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 10:47:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 270. [2025-03-04 10:47:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 189 states have (on average 1.597883597883598) internal successors, (302), 244 states have internal predecessors, (302), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 348 transitions. [2025-03-04 10:47:47,702 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 348 transitions. Word has length 39 [2025-03-04 10:47:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:47,703 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 348 transitions. [2025-03-04 10:47:47,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 348 transitions. [2025-03-04 10:47:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:47:47,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:47,703 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] [2025-03-04 10:47:47,709 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-04 10:47:47,908 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,SelfDestructingSolverStorable10 [2025-03-04 10:47:47,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:47,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 517831872, now seen corresponding path program 1 times [2025-03-04 10:47:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:47,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128437181] [2025-03-04 10:47:47,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:47,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:47:47,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:47:47,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:47,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183982463] [2025-03-04 10:47:47,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:47,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:47,928 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-04 10:47:47,929 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-04 10:47:47,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:47:47,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:47:47,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:47,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:47,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:47,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:47:47,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128437181] [2025-03-04 10:47:47,984 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:47,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183982463] [2025-03-04 10:47:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183982463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487983037] [2025-03-04 10:47:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:47,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:47,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:47,985 INFO L87 Difference]: Start difference. First operand 270 states and 348 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:48,179 INFO L93 Difference]: Finished difference Result 298 states and 355 transitions. [2025-03-04 10:47:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-03-04 10:47:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:48,181 INFO L225 Difference]: With dead ends: 298 [2025-03-04 10:47:48,181 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 10:47:48,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-04 10:47:48,181 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 76 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:48,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 234 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 10:47:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2025-03-04 10:47:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 190 states have (on average 1.5842105263157895) internal successors, (301), 245 states have internal predecessors, (301), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 347 transitions. [2025-03-04 10:47:48,190 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 347 transitions. Word has length 40 [2025-03-04 10:47:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:48,190 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 347 transitions. [2025-03-04 10:47:48,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 347 transitions. [2025-03-04 10:47:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:47:48,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:48,192 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] [2025-03-04 10:47:48,197 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-04 10:47:48,392 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,SelfDestructingSolverStorable11 [2025-03-04 10:47:48,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:48,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1127081094, now seen corresponding path program 1 times [2025-03-04 10:47:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976882609] [2025-03-04 10:47:48,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:48,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:47:48,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:47:48,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:48,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:48,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166278910] [2025-03-04 10:47:48,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:48,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:48,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:48,411 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-04 10:47:48,413 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-04 10:47:48,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:47:48,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:47:48,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:48,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:48,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:48,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:47:48,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976882609] [2025-03-04 10:47:48,487 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166278910] [2025-03-04 10:47:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166278910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:48,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:48,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984348338] [2025-03-04 10:47:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:48,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:48,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:48,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:48,487 INFO L87 Difference]: Start difference. First operand 271 states and 347 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:48,937 INFO L93 Difference]: Finished difference Result 298 states and 352 transitions. [2025-03-04 10:47:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:48,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-03-04 10:47:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:48,938 INFO L225 Difference]: With dead ends: 298 [2025-03-04 10:47:48,938 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 10:47:48,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-04 10:47:48,939 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 76 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:48,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 237 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:47:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 10:47:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2025-03-04 10:47:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 191 states have (on average 1.5706806282722514) internal successors, (300), 246 states have internal predecessors, (300), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 346 transitions. [2025-03-04 10:47:48,946 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 346 transitions. Word has length 41 [2025-03-04 10:47:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:48,946 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 346 transitions. [2025-03-04 10:47:48,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 346 transitions. [2025-03-04 10:47:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:47:48,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:48,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:48,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:49,147 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,SelfDestructingSolverStorable12 [2025-03-04 10:47:49,147 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:49,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1736988244, now seen corresponding path program 1 times [2025-03-04 10:47:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:49,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363811996] [2025-03-04 10:47:49,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:49,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:47:49,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:47:49,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:47:49,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363811996] [2025-03-04 10:47:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363811996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:49,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:49,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837279440] [2025-03-04 10:47:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:49,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:49,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:49,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:49,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:49,217 INFO L87 Difference]: Start difference. First operand 272 states and 346 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:47:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:49,244 INFO L93 Difference]: Finished difference Result 272 states and 346 transitions. [2025-03-04 10:47:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:49,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 48 [2025-03-04 10:47:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:49,246 INFO L225 Difference]: With dead ends: 272 [2025-03-04 10:47:49,246 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 10:47:49,246 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-04 10:47:49,246 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 46 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:49,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 10:47:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-04 10:47:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 191 states have (on average 1.5392670157068062) internal successors, (294), 244 states have internal predecessors, (294), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 340 transitions. [2025-03-04 10:47:49,255 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 340 transitions. Word has length 48 [2025-03-04 10:47:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:49,255 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 340 transitions. [2025-03-04 10:47:49,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:47:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 340 transitions. [2025-03-04 10:47:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:47:49,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:49,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:49,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:47:49,256 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:49,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1987939309, now seen corresponding path program 1 times [2025-03-04 10:47:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33834244] [2025-03-04 10:47:49,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:49,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:47:49,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:47:49,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:47:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33834244] [2025-03-04 10:47:49,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33834244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:49,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:49,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668949936] [2025-03-04 10:47:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:49,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:49,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:49,303 INFO L87 Difference]: Start difference. First operand 270 states and 340 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:47:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:49,328 INFO L93 Difference]: Finished difference Result 270 states and 340 transitions. [2025-03-04 10:47:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:49,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2025-03-04 10:47:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:49,330 INFO L225 Difference]: With dead ends: 270 [2025-03-04 10:47:49,330 INFO L226 Difference]: Without dead ends: 268 [2025-03-04 10:47:49,330 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-04 10:47:49,330 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:49,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 196 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-04 10:47:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-04 10:47:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 191 states have (on average 1.4973821989528795) internal successors, (286), 242 states have internal predecessors, (286), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 332 transitions. [2025-03-04 10:47:49,341 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 332 transitions. Word has length 49 [2025-03-04 10:47:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:49,341 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 332 transitions. [2025-03-04 10:47:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:47:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 332 transitions. [2025-03-04 10:47:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:47:49,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:49,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:49,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:47:49,342 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:49,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1496631683, now seen corresponding path program 1 times [2025-03-04 10:47:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729068344] [2025-03-04 10:47:49,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:49,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:47:49,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:47:49,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:47:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729068344] [2025-03-04 10:47:49,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729068344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:49,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:47:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146686850] [2025-03-04 10:47:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:49,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:47:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:49,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:47:49,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:47:49,472 INFO L87 Difference]: Start difference. First operand 268 states and 332 transitions. Second operand has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:49,775 INFO L93 Difference]: Finished difference Result 271 states and 335 transitions. [2025-03-04 10:47:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:47:49,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2025-03-04 10:47:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:49,776 INFO L225 Difference]: With dead ends: 271 [2025-03-04 10:47:49,776 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 10:47:49,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:49,777 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 272 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:49,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 264 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:47:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 10:47:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-04 10:47:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 193 states have (on average 1.4922279792746114) internal successors, (288), 244 states have internal predecessors, (288), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 334 transitions. [2025-03-04 10:47:49,785 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 334 transitions. Word has length 50 [2025-03-04 10:47:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:49,785 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 334 transitions. [2025-03-04 10:47:49,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 334 transitions. [2025-03-04 10:47:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:47:49,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:49,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:49,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:47:49,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1496633028, now seen corresponding path program 1 times [2025-03-04 10:47:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-04 10:47:49,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:47:49,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:47:49,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:47:49,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-04 10:47:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806204517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7216980] [2025-03-04 10:47:49,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:49,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:49,881 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:49,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:47:49,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:47:49,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:47:49,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:49,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:47:49,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:47:49,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:47:50,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7216980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:50,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:50,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:47:50,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487822235] [2025-03-04 10:47:50,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:50,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:47:50,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:50,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:47:50,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:47:50,110 INFO L87 Difference]: Start difference. First operand 270 states and 334 transitions. Second operand has 13 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 8 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-04 10:47:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:50,452 INFO L93 Difference]: Finished difference Result 332 states and 388 transitions. [2025-03-04 10:47:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:47:50,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 8 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) Word has length 50 [2025-03-04 10:47:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:50,454 INFO L225 Difference]: With dead ends: 332 [2025-03-04 10:47:50,454 INFO L226 Difference]: Without dead ends: 331 [2025-03-04 10:47:50,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:47:50,454 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 682 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:50,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 370 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:47:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-04 10:47:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 270. [2025-03-04 10:47:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 193 states have (on average 1.4818652849740932) internal successors, (286), 244 states have internal predecessors, (286), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 332 transitions. [2025-03-04 10:47:50,464 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 332 transitions. Word has length 50 [2025-03-04 10:47:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:50,465 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 332 transitions. [2025-03-04 10:47:50,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 8 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-04 10:47:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 332 transitions. [2025-03-04 10:47:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:47:50,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:50,465 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:50,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:47:50,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:50,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:50,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash 99003166, now seen corresponding path program 1 times [2025-03-04 10:47:50,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:50,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393914616] [2025-03-04 10:47:50,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:50,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:47:50,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:47:50,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:50,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:47:50,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393914616] [2025-03-04 10:47:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393914616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:50,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:50,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639389480] [2025-03-04 10:47:50,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:50,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:50,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:50,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:50,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:50,708 INFO L87 Difference]: Start difference. First operand 270 states and 332 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:50,841 INFO L93 Difference]: Finished difference Result 326 states and 400 transitions. [2025-03-04 10:47:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2025-03-04 10:47:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:50,842 INFO L225 Difference]: With dead ends: 326 [2025-03-04 10:47:50,842 INFO L226 Difference]: Without dead ends: 322 [2025-03-04 10:47:50,842 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-04 10:47:50,843 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:50,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 137 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-04 10:47:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 280. [2025-03-04 10:47:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.4630541871921183) internal successors, (297), 254 states have internal predecessors, (297), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 343 transitions. [2025-03-04 10:47:50,865 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 343 transitions. Word has length 53 [2025-03-04 10:47:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:50,865 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 343 transitions. [2025-03-04 10:47:50,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 343 transitions. [2025-03-04 10:47:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:47:50,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:50,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:50,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:47:50,866 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:50,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:50,866 INFO L85 PathProgramCache]: Analyzing trace with hash 515717086, now seen corresponding path program 1 times [2025-03-04 10:47:50,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:50,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-03-04 10:47:50,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:50,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:47:50,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:47:50,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:50,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:50,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012005967] [2025-03-04 10:47:50,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:50,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:50,881 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:50,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:47:50,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:47:50,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:47:50,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:50,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:50,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:47:50,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:47:51,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-03-04 10:47:51,121 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012005967] [2025-03-04 10:47:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012005967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:51,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2025-03-04 10:47:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670563661] [2025-03-04 10:47:51,122 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:51,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:51,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:51,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:51,123 INFO L87 Difference]: Start difference. First operand 280 states and 343 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:51,256 INFO L93 Difference]: Finished difference Result 320 states and 394 transitions. [2025-03-04 10:47:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-03-04 10:47:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:51,258 INFO L225 Difference]: With dead ends: 320 [2025-03-04 10:47:51,258 INFO L226 Difference]: Without dead ends: 318 [2025-03-04 10:47:51,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:51,258 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 70 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:51,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 128 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-04 10:47:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2025-03-04 10:47:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 204 states have (on average 1.4558823529411764) internal successors, (297), 255 states have internal predecessors, (297), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 343 transitions. [2025-03-04 10:47:51,268 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 343 transitions. Word has length 55 [2025-03-04 10:47:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:51,268 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 343 transitions. [2025-03-04 10:47:51,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 343 transitions. [2025-03-04 10:47:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:47:51,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:51,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:51,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:47:51,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:51,470 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:51,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:51,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1192639426, now seen corresponding path program 1 times [2025-03-04 10:47:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:51,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-03-04 10:47:51,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:51,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:47:51,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:47:51,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:51,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977235876] [2025-03-04 10:47:51,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:51,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:51,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:51,485 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:51,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:47:51,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:47:51,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:47:51,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:51,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:51,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:47:51,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:47:51,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-03-04 10:47:51,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977235876] [2025-03-04 10:47:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977235876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:51,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2025-03-04 10:47:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194884370] [2025-03-04 10:47:51,763 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:51,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:51,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:51,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:51,764 INFO L87 Difference]: Start difference. First operand 281 states and 343 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:51,986 INFO L93 Difference]: Finished difference Result 320 states and 392 transitions. [2025-03-04 10:47:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:51,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-04 10:47:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:51,987 INFO L225 Difference]: With dead ends: 320 [2025-03-04 10:47:51,987 INFO L226 Difference]: Without dead ends: 318 [2025-03-04 10:47:51,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:51,988 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:51,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 173 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-04 10:47:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 282. [2025-03-04 10:47:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 205 states have (on average 1.448780487804878) internal successors, (297), 256 states have internal predecessors, (297), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 343 transitions. [2025-03-04 10:47:51,996 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 343 transitions. Word has length 56 [2025-03-04 10:47:51,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:51,996 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 343 transitions. [2025-03-04 10:47:51,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:51,997 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 343 transitions. [2025-03-04 10:47:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 10:47:51,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:51,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:52,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:52,198 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1951578150, now seen corresponding path program 1 times [2025-03-04 10:47:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711486291] [2025-03-04 10:47:52,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:52,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:47:52,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:47:52,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:52,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812323737] [2025-03-04 10:47:52,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:52,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:52,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:52,209 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:52,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:47:52,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:47:52,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:47:52,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:52,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:52,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:52,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:47:52,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711486291] [2025-03-04 10:47:52,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812323737] [2025-03-04 10:47:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812323737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146087965] [2025-03-04 10:47:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:52,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:52,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:52,304 INFO L87 Difference]: Start difference. First operand 282 states and 343 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:52,464 INFO L93 Difference]: Finished difference Result 333 states and 390 transitions. [2025-03-04 10:47:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:52,464 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-03-04 10:47:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:52,465 INFO L225 Difference]: With dead ends: 333 [2025-03-04 10:47:52,465 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 10:47:52,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-04 10:47:52,466 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 107 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:52,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 156 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 10:47:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 282. [2025-03-04 10:47:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 205 states have (on average 1.4439024390243902) internal successors, (296), 256 states have internal predecessors, (296), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 342 transitions. [2025-03-04 10:47:52,480 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 342 transitions. Word has length 59 [2025-03-04 10:47:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:52,480 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 342 transitions. [2025-03-04 10:47:52,480 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 342 transitions. [2025-03-04 10:47:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:47:52,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:52,480 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 10:47:52,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:47:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:52,681 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -276116321, now seen corresponding path program 1 times [2025-03-04 10:47:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082765050] [2025-03-04 10:47:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:52,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:47:52,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:47:52,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:52,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:47:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082765050] [2025-03-04 10:47:52,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082765050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689756508] [2025-03-04 10:47:52,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:52,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:52,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:52,776 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:52,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:47:52,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:47:52,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:47:52,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:52,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:52,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:47:52,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:47:52,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:52,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689756508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:52,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:52,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 10:47:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623015516] [2025-03-04 10:47:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:52,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:52,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:52,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:47:52,941 INFO L87 Difference]: Start difference. First operand 282 states and 342 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:53,229 INFO L93 Difference]: Finished difference Result 318 states and 389 transitions. [2025-03-04 10:47:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:47:53,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2025-03-04 10:47:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:53,234 INFO L225 Difference]: With dead ends: 318 [2025-03-04 10:47:53,234 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 10:47:53,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:53,235 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 62 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:53,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 122 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:47:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 10:47:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 283. [2025-03-04 10:47:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 206 states have (on average 1.4368932038834952) internal successors, (296), 257 states have internal predecessors, (296), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2025-03-04 10:47:53,246 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 61 [2025-03-04 10:47:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:53,246 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2025-03-04 10:47:53,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2025-03-04 10:47:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:47:53,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:53,247 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:47:53,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:53,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:53,453 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:53,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -369380422, now seen corresponding path program 1 times [2025-03-04 10:47:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425271986] [2025-03-04 10:47:53,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:53,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:47:53,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:47:53,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:53,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:53,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [786231327] [2025-03-04 10:47:53,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:53,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:53,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:53,463 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:53,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:47:53,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:47:53,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:47:53,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:53,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:53,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:53,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:47:53,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:53,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:53,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425271986] [2025-03-04 10:47:53,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:53,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786231327] [2025-03-04 10:47:53,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786231327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:53,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:53,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313205626] [2025-03-04 10:47:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:53,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:53,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:53,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:53,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:53,579 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:53,875 INFO L93 Difference]: Finished difference Result 335 states and 387 transitions. [2025-03-04 10:47:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:53,875 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-03-04 10:47:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:53,876 INFO L225 Difference]: With dead ends: 335 [2025-03-04 10:47:53,876 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 10:47:53,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-04 10:47:53,877 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 72 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:53,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 204 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:47:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 10:47:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 286. [2025-03-04 10:47:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 209 states have (on average 1.430622009569378) internal successors, (299), 260 states have internal predecessors, (299), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 345 transitions. [2025-03-04 10:47:53,885 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 345 transitions. Word has length 60 [2025-03-04 10:47:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:53,886 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 345 transitions. [2025-03-04 10:47:53,886 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:47:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 345 transitions. [2025-03-04 10:47:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:47:53,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:53,886 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 10:47:53,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:54,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:54,091 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:54,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash 30328649, now seen corresponding path program 1 times [2025-03-04 10:47:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:54,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924536559] [2025-03-04 10:47:54,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:54,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:47:54,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:47:54,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:54,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:47:54,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:54,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924536559] [2025-03-04 10:47:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924536559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:54,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331163078] [2025-03-04 10:47:54,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:54,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:54,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:54,205 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:54,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:47:54,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:47:54,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:47:54,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:54,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:54,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:47:54,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:47:54,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:54,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331163078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:54,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:54,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-04 10:47:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675782744] [2025-03-04 10:47:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:54,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:54,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:54,370 INFO L87 Difference]: Start difference. First operand 286 states and 345 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:54,606 INFO L93 Difference]: Finished difference Result 318 states and 384 transitions. [2025-03-04 10:47:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2025-03-04 10:47:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:54,608 INFO L225 Difference]: With dead ends: 318 [2025-03-04 10:47:54,608 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 10:47:54,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:47:54,608 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 59 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:54,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 129 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 10:47:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 287. [2025-03-04 10:47:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 210 states have (on average 1.4238095238095239) internal successors, (299), 261 states have internal predecessors, (299), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:47:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 345 transitions. [2025-03-04 10:47:54,617 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 345 transitions. Word has length 62 [2025-03-04 10:47:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:54,617 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 345 transitions. [2025-03-04 10:47:54,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 345 transitions. [2025-03-04 10:47:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 10:47:54,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:54,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 10:47:54,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:54,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:47:54,822 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:54,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 770549088, now seen corresponding path program 1 times [2025-03-04 10:47:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:54,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155331880] [2025-03-04 10:47:54,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:54,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 10:47:54,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 10:47:54,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:54,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450687434] [2025-03-04 10:47:54,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:54,837 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:54,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:47:54,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 10:47:54,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 10:47:54,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:54,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:54,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:47:54,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:47:55,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:55,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155331880] [2025-03-04 10:47:55,150 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450687434] [2025-03-04 10:47:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450687434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:55,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:47:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73830790] [2025-03-04 10:47:55,150 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:55,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:47:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:55,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:47:55,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:55,151 INFO L87 Difference]: Start difference. First operand 287 states and 345 transitions. Second operand has 8 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:55,451 INFO L93 Difference]: Finished difference Result 468 states and 591 transitions. [2025-03-04 10:47:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:47:55,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 66 [2025-03-04 10:47:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:55,452 INFO L225 Difference]: With dead ends: 468 [2025-03-04 10:47:55,452 INFO L226 Difference]: Without dead ends: 464 [2025-03-04 10:47:55,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:55,453 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 479 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:55,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 273 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:47:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-04 10:47:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 361. [2025-03-04 10:47:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 275 states have (on average 1.4654545454545456) internal successors, (403), 326 states have internal predecessors, (403), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 10:47:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 467 transitions. [2025-03-04 10:47:55,474 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 467 transitions. Word has length 66 [2025-03-04 10:47:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:55,476 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 467 transitions. [2025-03-04 10:47:55,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 467 transitions. [2025-03-04 10:47:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 10:47:55,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:55,480 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 10:47:55,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:55,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 10:47:55,681 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:55,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1882781969, now seen corresponding path program 1 times [2025-03-04 10:47:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695178003] [2025-03-04 10:47:55,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:55,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:47:55,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:47:55,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:55,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055236318] [2025-03-04 10:47:55,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:55,691 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:55,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:47:55,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:47:55,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:47:55,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:55,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:55,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:47:55,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:47:55,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695178003] [2025-03-04 10:47:57,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055236318] [2025-03-04 10:47:57,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055236318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:57,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:57,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:47:57,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559173120] [2025-03-04 10:47:57,261 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:57,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:47:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:57,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:47:57,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-03-04 10:47:57,262 INFO L87 Difference]: Start difference. First operand 361 states and 467 transitions. Second operand has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:57,571 INFO L93 Difference]: Finished difference Result 390 states and 492 transitions. [2025-03-04 10:47:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:47:57,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 67 [2025-03-04 10:47:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:57,572 INFO L225 Difference]: With dead ends: 390 [2025-03-04 10:47:57,572 INFO L226 Difference]: Without dead ends: 384 [2025-03-04 10:47:57,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=33, Invalid=76, Unknown=1, NotChecked=0, Total=110 [2025-03-04 10:47:57,573 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 178 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:57,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 364 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:47:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-04 10:47:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 355. [2025-03-04 10:47:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 275 states have (on average 1.410909090909091) internal successors, (388), 320 states have internal predecessors, (388), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 10:47:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 452 transitions. [2025-03-04 10:47:57,583 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 452 transitions. Word has length 67 [2025-03-04 10:47:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:57,583 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 452 transitions. [2025-03-04 10:47:57,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 452 transitions. [2025-03-04 10:47:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 10:47:57,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:57,584 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 10:47:57,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:57,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:47:57,784 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:57,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1763301182, now seen corresponding path program 1 times [2025-03-04 10:47:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410048836] [2025-03-04 10:47:57,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:57,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 10:47:57,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:47:57,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:57,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:57,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676995497] [2025-03-04 10:47:57,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:57,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:57,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:57,797 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:57,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:47:57,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 10:47:57,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:47:57,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:57,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:57,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:47:57,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:47:58,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:58,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:58,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410048836] [2025-03-04 10:47:58,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:58,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676995497] [2025-03-04 10:47:58,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676995497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:58,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:58,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:47:58,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700157820] [2025-03-04 10:47:58,177 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:58,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:47:58,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:58,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:47:58,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:58,178 INFO L87 Difference]: Start difference. First operand 355 states and 452 transitions. Second operand has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:58,752 INFO L93 Difference]: Finished difference Result 496 states and 655 transitions. [2025-03-04 10:47:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:47:58,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2025-03-04 10:47:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:58,754 INFO L225 Difference]: With dead ends: 496 [2025-03-04 10:47:58,754 INFO L226 Difference]: Without dead ends: 489 [2025-03-04 10:47:58,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:47:58,755 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 428 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:58,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 221 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:47:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-04 10:47:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 446. [2025-03-04 10:47:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 356 states have (on average 1.4606741573033708) internal successors, (520), 401 states have internal predecessors, (520), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 10:47:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 604 transitions. [2025-03-04 10:47:58,770 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 604 transitions. Word has length 68 [2025-03-04 10:47:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:58,770 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 604 transitions. [2025-03-04 10:47:58,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 604 transitions. [2025-03-04 10:47:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 10:47:58,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:58,771 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-04 10:47:58,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:58,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:58,975 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:47:58,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1172238131, now seen corresponding path program 1 times [2025-03-04 10:47:58,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:58,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155950216] [2025-03-04 10:47:58,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:58,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:47:58,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:47:58,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:58,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:58,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979802246] [2025-03-04 10:47:58,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:58,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:58,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:58,985 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:47:58,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:47:59,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:47:59,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:47:59,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:59,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:59,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:47:59,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:47:59,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155950216] [2025-03-04 10:47:59,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979802246] [2025-03-04 10:47:59,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979802246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:59,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:59,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:47:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90860252] [2025-03-04 10:47:59,463 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:59,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:47:59,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:59,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:47:59,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:59,464 INFO L87 Difference]: Start difference. First operand 446 states and 604 transitions. Second operand has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:59,966 INFO L93 Difference]: Finished difference Result 547 states and 738 transitions. [2025-03-04 10:47:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:47:59,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2025-03-04 10:47:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:59,967 INFO L225 Difference]: With dead ends: 547 [2025-03-04 10:47:59,968 INFO L226 Difference]: Without dead ends: 545 [2025-03-04 10:47:59,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:47:59,968 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 459 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:59,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 252 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:47:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-04 10:47:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 480. [2025-03-04 10:47:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 386 states have (on average 1.455958549222798) internal successors, (562), 431 states have internal predecessors, (562), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 10:47:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 654 transitions. [2025-03-04 10:47:59,983 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 654 transitions. Word has length 69 [2025-03-04 10:47:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:59,983 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 654 transitions. [2025-03-04 10:47:59,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:47:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 654 transitions. [2025-03-04 10:47:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:47:59,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:59,984 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-04 10:47:59,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:00,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:48:00,184 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:00,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1979643620, now seen corresponding path program 1 times [2025-03-04 10:48:00,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:00,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240861739] [2025-03-04 10:48:00,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:00,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:00,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:48:00,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:48:00,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:00,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63858047] [2025-03-04 10:48:00,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:00,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:00,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:00,195 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:00,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:48:00,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:48:00,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:48:00,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:00,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:00,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:48:00,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:48:00,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240861739] [2025-03-04 10:48:00,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63858047] [2025-03-04 10:48:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63858047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:00,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:48:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161469888] [2025-03-04 10:48:00,469 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:00,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:48:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:00,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:48:00,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:48:00,470 INFO L87 Difference]: Start difference. First operand 480 states and 654 transitions. Second operand has 9 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:48:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:00,768 INFO L93 Difference]: Finished difference Result 505 states and 701 transitions. [2025-03-04 10:48:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:48:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 70 [2025-03-04 10:48:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:00,770 INFO L225 Difference]: With dead ends: 505 [2025-03-04 10:48:00,770 INFO L226 Difference]: Without dead ends: 495 [2025-03-04 10:48:00,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:48:00,771 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 164 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 123 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-04 10:48:00,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 123 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:48:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-04 10:48:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 326. [2025-03-04 10:48:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 257 states have (on average 1.3190661478599222) internal successors, (339), 293 states have internal predecessors, (339), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:48:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 399 transitions. [2025-03-04 10:48:00,787 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 399 transitions. Word has length 70 [2025-03-04 10:48:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 399 transitions. [2025-03-04 10:48:00,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:48:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 399 transitions. [2025-03-04 10:48:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 10:48:00,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:00,788 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-04 10:48:00,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:48:00,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:48:00,989 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:00,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1239410005, now seen corresponding path program 1 times [2025-03-04 10:48:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633241952] [2025-03-04 10:48:00,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:00,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 10:48:00,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:48:00,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:00,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:00,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432954225] [2025-03-04 10:48:00,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:01,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:01,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:01,001 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:01,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:48:01,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 10:48:01,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:48:01,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:01,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:01,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:48:01,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:48:01,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633241952] [2025-03-04 10:48:01,264 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432954225] [2025-03-04 10:48:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432954225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:01,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:48:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191112111] [2025-03-04 10:48:01,264 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:01,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:48:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:01,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:48:01,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:48:01,265 INFO L87 Difference]: Start difference. First operand 326 states and 399 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:48:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:01,691 INFO L93 Difference]: Finished difference Result 363 states and 443 transitions. [2025-03-04 10:48:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:48:01,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2025-03-04 10:48:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:01,692 INFO L225 Difference]: With dead ends: 363 [2025-03-04 10:48:01,692 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 10:48:01,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:48:01,693 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 156 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:01,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 325 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:48:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 10:48:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 300. [2025-03-04 10:48:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 270 states have internal predecessors, (304), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 10:48:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 358 transitions. [2025-03-04 10:48:01,712 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 358 transitions. Word has length 71 [2025-03-04 10:48:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:01,712 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 358 transitions. [2025-03-04 10:48:01,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:48:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 358 transitions. [2025-03-04 10:48:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:48:01,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:01,712 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-04 10:48:01,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 10:48:01,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:01,913 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:01,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash 816635752, now seen corresponding path program 1 times [2025-03-04 10:48:01,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:01,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302788876] [2025-03-04 10:48:01,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:01,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:01,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:48:01,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:48:01,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:01,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224672483] [2025-03-04 10:48:01,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:01,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:01,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:01,925 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:01,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:48:01,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:48:01,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:48:01,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:01,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:01,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:48:01,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:48:02,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302788876] [2025-03-04 10:48:03,500 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224672483] [2025-03-04 10:48:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224672483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:03,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:48:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226008751] [2025-03-04 10:48:03,501 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:03,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:48:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:03,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:48:03,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2025-03-04 10:48:03,501 INFO L87 Difference]: Start difference. First operand 300 states and 358 transitions. Second operand has 8 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 10:48:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:03,746 INFO L93 Difference]: Finished difference Result 463 states and 578 transitions. [2025-03-04 10:48:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:48:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 77 [2025-03-04 10:48:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:03,747 INFO L225 Difference]: With dead ends: 463 [2025-03-04 10:48:03,747 INFO L226 Difference]: Without dead ends: 461 [2025-03-04 10:48:03,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2025-03-04 10:48:03,748 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 316 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:03,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 249 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:48:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-04 10:48:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 427. [2025-03-04 10:48:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 350 states have (on average 1.3257142857142856) internal successors, (464), 383 states have internal predecessors, (464), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 10:48:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 546 transitions. [2025-03-04 10:48:03,765 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 546 transitions. Word has length 77 [2025-03-04 10:48:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:03,765 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 546 transitions. [2025-03-04 10:48:03,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 10:48:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 546 transitions. [2025-03-04 10:48:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:48:03,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:03,767 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-04 10:48:03,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:48:03,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:03,968 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:03,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1191044068, now seen corresponding path program 1 times [2025-03-04 10:48:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:03,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095425903] [2025-03-04 10:48:03,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:03,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:48:03,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:48:03,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:03,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419953978] [2025-03-04 10:48:03,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:03,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:03,981 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:03,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:48:04,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:48:04,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:48:04,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:04,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:04,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:48:04,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 10:48:04,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095425903] [2025-03-04 10:48:04,278 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419953978] [2025-03-04 10:48:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419953978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:04,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 10:48:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216887794] [2025-03-04 10:48:04,279 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:48:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:04,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:48:04,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:48:04,279 INFO L87 Difference]: Start difference. First operand 427 states and 546 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 10:48:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:04,630 INFO L93 Difference]: Finished difference Result 583 states and 764 transitions. [2025-03-04 10:48:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:48:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 81 [2025-03-04 10:48:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:04,632 INFO L225 Difference]: With dead ends: 583 [2025-03-04 10:48:04,632 INFO L226 Difference]: Without dead ends: 579 [2025-03-04 10:48:04,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:48:04,633 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 382 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:04,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 214 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:48:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-04 10:48:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 438. [2025-03-04 10:48:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 360 states have (on average 1.3444444444444446) internal successors, (484), 393 states have internal predecessors, (484), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 10:48:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 568 transitions. [2025-03-04 10:48:04,652 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 568 transitions. Word has length 81 [2025-03-04 10:48:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:04,652 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 568 transitions. [2025-03-04 10:48:04,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 10:48:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 568 transitions. [2025-03-04 10:48:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 10:48:04,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:04,653 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-04 10:48:04,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:04,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:04,853 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:04,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1732339498, now seen corresponding path program 1 times [2025-03-04 10:48:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-03-04 10:48:04,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:04,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 10:48:04,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:48:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969766690] [2025-03-04 10:48:04,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:04,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:04,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:04,863 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:04,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:48:04,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 10:48:04,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:48:04,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:04,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:04,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:48:04,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:48:05,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:05,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:05,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-03-04 10:48:05,133 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:05,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969766690] [2025-03-04 10:48:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969766690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:05,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:48:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302944960] [2025-03-04 10:48:05,133 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:05,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:48:05,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:05,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:48:05,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:48:05,134 INFO L87 Difference]: Start difference. First operand 438 states and 568 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 10:48:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:05,556 INFO L93 Difference]: Finished difference Result 458 states and 590 transitions. [2025-03-04 10:48:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:48:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 82 [2025-03-04 10:48:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:05,557 INFO L225 Difference]: With dead ends: 458 [2025-03-04 10:48:05,557 INFO L226 Difference]: Without dead ends: 454 [2025-03-04 10:48:05,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:48:05,558 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 159 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:05,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 311 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:48:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-04 10:48:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 436. [2025-03-04 10:48:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 361 states have (on average 1.3213296398891967) internal successors, (477), 391 states have internal predecessors, (477), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 10:48:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 561 transitions. [2025-03-04 10:48:05,577 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 561 transitions. Word has length 82 [2025-03-04 10:48:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:05,579 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 561 transitions. [2025-03-04 10:48:05,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 10:48:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 561 transitions. [2025-03-04 10:48:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 10:48:05,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:05,580 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 10:48:05,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:05,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:05,780 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:05,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1994801217, now seen corresponding path program 1 times [2025-03-04 10:48:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:05,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193218143] [2025-03-04 10:48:05,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:05,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:48:05,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:48:05,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:05,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 10:48:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193218143] [2025-03-04 10:48:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193218143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657959367] [2025-03-04 10:48:05,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:05,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:05,854 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:05,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:48:05,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:48:05,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:48:05,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:05,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:05,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:48:05,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:06,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:48:06,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657959367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:48:06,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:06,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 10:48:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300003371] [2025-03-04 10:48:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:48:06,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:48:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:06,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:48:06,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:48:06,070 INFO L87 Difference]: Start difference. First operand 436 states and 561 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:48:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:06,232 INFO L93 Difference]: Finished difference Result 446 states and 572 transitions. [2025-03-04 10:48:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:48:06,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2025-03-04 10:48:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:06,233 INFO L225 Difference]: With dead ends: 446 [2025-03-04 10:48:06,233 INFO L226 Difference]: Without dead ends: 445 [2025-03-04 10:48:06,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:48:06,234 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:06,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:48:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-04 10:48:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 444. [2025-03-04 10:48:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 368 states have (on average 1.315217391304348) internal successors, (484), 398 states have internal predecessors, (484), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 10:48:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 570 transitions. [2025-03-04 10:48:06,252 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 570 transitions. Word has length 87 [2025-03-04 10:48:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:06,253 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 570 transitions. [2025-03-04 10:48:06,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:48:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 570 transitions. [2025-03-04 10:48:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 10:48:06,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:06,253 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 10:48:06,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 10:48:06,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 10:48:06,454 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:06,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1709295557, now seen corresponding path program 1 times [2025-03-04 10:48:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:06,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967057189] [2025-03-04 10:48:06,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:06,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:48:06,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:48:06,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:06,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 10:48:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967057189] [2025-03-04 10:48:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967057189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968939762] [2025-03-04 10:48:06,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:06,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:06,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:06,548 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:06,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:48:06,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:48:06,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:48:06,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:06,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:06,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:48:06,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:06,758 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:48:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968939762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:48:06,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:06,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-03-04 10:48:06,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977831945] [2025-03-04 10:48:06,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:48:06,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:48:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:06,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:48:06,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:48:06,759 INFO L87 Difference]: Start difference. First operand 444 states and 570 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:48:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:06,889 INFO L93 Difference]: Finished difference Result 446 states and 571 transitions. [2025-03-04 10:48:06,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:48:06,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2025-03-04 10:48:06,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:06,891 INFO L225 Difference]: With dead ends: 446 [2025-03-04 10:48:06,891 INFO L226 Difference]: Without dead ends: 416 [2025-03-04 10:48:06,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:48:06,891 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:06,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:48:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-04 10:48:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-03-04 10:48:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 343 states have (on average 1.3323615160349853) internal successors, (457), 373 states have internal predecessors, (457), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:48:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 537 transitions. [2025-03-04 10:48:06,910 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 537 transitions. Word has length 88 [2025-03-04 10:48:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:06,911 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 537 transitions. [2025-03-04 10:48:06,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:48:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 537 transitions. [2025-03-04 10:48:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:48:06,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:06,911 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-04 10:48:06,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 10:48:07,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:07,112 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:07,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1238975497, now seen corresponding path program 1 times [2025-03-04 10:48:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12149517] [2025-03-04 10:48:07,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:07,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:48:07,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:48:07,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:07,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:07,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12149517] [2025-03-04 10:48:07,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12149517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:07,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419846815] [2025-03-04 10:48:07,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:07,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:07,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:07,168 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:07,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:48:07,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:48:07,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:48:07,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:07,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:48:07,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:07,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419846815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:07,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:48:07,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 10:48:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283900425] [2025-03-04 10:48:07,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:07,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:48:07,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:07,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:48:07,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:48:07,439 INFO L87 Difference]: Start difference. First operand 416 states and 537 transitions. Second operand has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 14 states have internal predecessors, (157), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2025-03-04 10:48:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:07,801 INFO L93 Difference]: Finished difference Result 430 states and 550 transitions. [2025-03-04 10:48:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:48:07,802 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 14 states have internal predecessors, (157), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Word has length 91 [2025-03-04 10:48:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:07,803 INFO L225 Difference]: With dead ends: 430 [2025-03-04 10:48:07,803 INFO L226 Difference]: Without dead ends: 429 [2025-03-04 10:48:07,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:48:07,804 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 664 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:07,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 429 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:48:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-04 10:48:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 415. [2025-03-04 10:48:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.3265306122448979) internal successors, (455), 372 states have internal predecessors, (455), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:48:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 535 transitions. [2025-03-04 10:48:07,822 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 535 transitions. Word has length 91 [2025-03-04 10:48:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:07,824 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 535 transitions. [2025-03-04 10:48:07,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 14 states have internal predecessors, (157), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2025-03-04 10:48:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 535 transitions. [2025-03-04 10:48:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:48:07,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:07,825 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-04 10:48:07,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-04 10:48:08,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:08,026 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:08,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash -848718937, now seen corresponding path program 1 times [2025-03-04 10:48:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:08,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881387677] [2025-03-04 10:48:08,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:08,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:48:08,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:48:08,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:08,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881387677] [2025-03-04 10:48:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881387677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425170541] [2025-03-04 10:48:08,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:08,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:08,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:08,077 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:08,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:48:08,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:48:08,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:48:08,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:08,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:08,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:48:08,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:08,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:08,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425170541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:08,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:48:08,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:48:08,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68481097] [2025-03-04 10:48:08,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:08,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:48:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:08,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:48:08,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:48:08,310 INFO L87 Difference]: Start difference. First operand 415 states and 535 transitions. Second operand has 10 states, 9 states have (on average 12.0) internal successors, (108), 10 states have internal predecessors, (108), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 10:48:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:08,586 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2025-03-04 10:48:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:48:08,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.0) internal successors, (108), 10 states have internal predecessors, (108), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 91 [2025-03-04 10:48:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:08,587 INFO L225 Difference]: With dead ends: 417 [2025-03-04 10:48:08,587 INFO L226 Difference]: Without dead ends: 416 [2025-03-04 10:48:08,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:48:08,588 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 386 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:08,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 274 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:48:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-04 10:48:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2025-03-04 10:48:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 343 states have (on average 1.314868804664723) internal successors, (451), 371 states have internal predecessors, (451), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:48:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 531 transitions. [2025-03-04 10:48:08,605 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 531 transitions. Word has length 91 [2025-03-04 10:48:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:08,605 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 531 transitions. [2025-03-04 10:48:08,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.0) internal successors, (108), 10 states have internal predecessors, (108), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 10:48:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 531 transitions. [2025-03-04 10:48:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:48:08,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:08,606 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 10:48:08,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:08,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:48:08,806 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:08,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash -540441529, now seen corresponding path program 1 times [2025-03-04 10:48:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:08,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259208777] [2025-03-04 10:48:08,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:08,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 10:48:08,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:48:08,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:08,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259208777] [2025-03-04 10:48:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259208777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339119877] [2025-03-04 10:48:08,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:08,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:08,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:08,855 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:08,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 10:48:08,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 10:48:08,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:48:08,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:08,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:08,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:48:08,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:09,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:09,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339119877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:09,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:48:09,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-04 10:48:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824111771] [2025-03-04 10:48:09,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:09,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:48:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:09,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:48:09,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:48:09,106 INFO L87 Difference]: Start difference. First operand 414 states and 531 transitions. Second operand has 8 states, 7 states have (on average 22.571428571428573) internal successors, (158), 8 states have internal predecessors, (158), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-04 10:48:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:09,415 INFO L93 Difference]: Finished difference Result 849 states and 1130 transitions. [2025-03-04 10:48:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:48:09,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 22.571428571428573) internal successors, (158), 8 states have internal predecessors, (158), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 92 [2025-03-04 10:48:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:09,418 INFO L225 Difference]: With dead ends: 849 [2025-03-04 10:48:09,418 INFO L226 Difference]: Without dead ends: 847 [2025-03-04 10:48:09,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:48:09,419 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 207 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:09,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 268 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:48:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-04 10:48:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 607. [2025-03-04 10:48:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 516 states have (on average 1.317829457364341) internal successors, (680), 544 states have internal predecessors, (680), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 10:48:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 800 transitions. [2025-03-04 10:48:09,447 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 800 transitions. Word has length 92 [2025-03-04 10:48:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:09,447 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 800 transitions. [2025-03-04 10:48:09,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 22.571428571428573) internal successors, (158), 8 states have internal predecessors, (158), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-04 10:48:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 800 transitions. [2025-03-04 10:48:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 10:48:09,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:09,448 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 10:48:09,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:09,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:48:09,652 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:09,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:09,652 INFO L85 PathProgramCache]: Analyzing trace with hash -669944903, now seen corresponding path program 1 times [2025-03-04 10:48:09,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:09,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035450905] [2025-03-04 10:48:09,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:09,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:09,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:48:09,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:48:09,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:09,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:09,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:09,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035450905] [2025-03-04 10:48:09,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035450905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:09,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921255284] [2025-03-04 10:48:09,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:09,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:09,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:09,706 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:09,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-04 10:48:09,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:48:09,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:48:09,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:09,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:09,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:48:09,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:09,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:09,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921255284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:09,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:48:09,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-04 10:48:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24177493] [2025-03-04 10:48:09,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:09,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:48:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:09,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:48:09,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:48:09,953 INFO L87 Difference]: Start difference. First operand 607 states and 800 transitions. Second operand has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-04 10:48:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:10,269 INFO L93 Difference]: Finished difference Result 1201 states and 1628 transitions. [2025-03-04 10:48:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:48:10,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 94 [2025-03-04 10:48:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:10,273 INFO L225 Difference]: With dead ends: 1201 [2025-03-04 10:48:10,273 INFO L226 Difference]: Without dead ends: 1199 [2025-03-04 10:48:10,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:48:10,274 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 279 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:10,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 246 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:48:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-03-04 10:48:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 918. [2025-03-04 10:48:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 796 states have (on average 1.3228643216080402) internal successors, (1053), 824 states have internal predecessors, (1053), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-04 10:48:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1235 transitions. [2025-03-04 10:48:10,322 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1235 transitions. Word has length 94 [2025-03-04 10:48:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:10,322 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1235 transitions. [2025-03-04 10:48:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 7 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-04 10:48:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1235 transitions. [2025-03-04 10:48:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:48:10,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:10,323 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 10:48:10,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:10,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:48:10,524 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash 290997689, now seen corresponding path program 1 times [2025-03-04 10:48:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-03-04 10:48:10,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:10,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 10:48:10,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:48:10,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:10,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:10,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052774428] [2025-03-04 10:48:10,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:10,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:10,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:10,534 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:10,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-04 10:48:10,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 10:48:10,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:48:10,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:10,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:10,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:48:10,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 10:48:10,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:10,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:10,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-03-04 10:48:10,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:10,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052774428] [2025-03-04 10:48:10,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052774428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:10,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:10,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:48:10,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451918543] [2025-03-04 10:48:10,954 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:10,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:48:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:10,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:48:10,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:48:10,955 INFO L87 Difference]: Start difference. First operand 918 states and 1235 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:48:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:11,718 INFO L93 Difference]: Finished difference Result 1053 states and 1425 transitions. [2025-03-04 10:48:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:48:11,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 96 [2025-03-04 10:48:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:11,721 INFO L225 Difference]: With dead ends: 1053 [2025-03-04 10:48:11,721 INFO L226 Difference]: Without dead ends: 1051 [2025-03-04 10:48:11,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:48:11,722 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 382 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:11,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 291 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:48:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-04 10:48:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1009. [2025-03-04 10:48:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 877 states have (on average 1.3249714937286203) internal successors, (1162), 905 states have internal predecessors, (1162), 101 states have call successors, (101), 2 states have call predecessors, (101), 2 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-04 10:48:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1364 transitions. [2025-03-04 10:48:11,774 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1364 transitions. Word has length 96 [2025-03-04 10:48:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:11,774 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1364 transitions. [2025-03-04 10:48:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:48:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1364 transitions. [2025-03-04 10:48:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:48:11,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:11,775 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 10:48:11,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:11,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:48:11,975 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:11,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash 596659163, now seen corresponding path program 2 times [2025-03-04 10:48:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:11,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667860120] [2025-03-04 10:48:11,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:48:11,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:11,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-04 10:48:11,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:48:11,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:48:11,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:11,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298060492] [2025-03-04 10:48:11,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:48:11,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:11,987 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:11,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-04 10:48:12,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-04 10:48:12,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:48:12,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:48:12,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:12,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:48:12,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 10:48:12,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667860120] [2025-03-04 10:48:12,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298060492] [2025-03-04 10:48:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298060492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:12,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:48:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215293900] [2025-03-04 10:48:12,458 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:48:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:12,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:48:12,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:48:12,459 INFO L87 Difference]: Start difference. First operand 1009 states and 1364 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:48:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:13,211 INFO L93 Difference]: Finished difference Result 1056 states and 1420 transitions. [2025-03-04 10:48:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:48:13,211 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 96 [2025-03-04 10:48:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:13,213 INFO L225 Difference]: With dead ends: 1056 [2025-03-04 10:48:13,213 INFO L226 Difference]: Without dead ends: 1052 [2025-03-04 10:48:13,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:48:13,214 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 328 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:13,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 451 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:48:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-03-04 10:48:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1025. [2025-03-04 10:48:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 891 states have (on average 1.3209876543209877) internal successors, (1177), 919 states have internal predecessors, (1177), 103 states have call successors, (103), 2 states have call predecessors, (103), 2 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-04 10:48:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1383 transitions. [2025-03-04 10:48:13,259 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1383 transitions. Word has length 96 [2025-03-04 10:48:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:13,259 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1383 transitions. [2025-03-04 10:48:13,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:48:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1383 transitions. [2025-03-04 10:48:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 10:48:13,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:13,260 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:13,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:13,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:13,460 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:13,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash 430993859, now seen corresponding path program 1 times [2025-03-04 10:48:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:13,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649876662] [2025-03-04 10:48:13,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:13,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:48:13,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:48:13,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:13,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941158456] [2025-03-04 10:48:13,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:13,472 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:13,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-04 10:48:13,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:48:13,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:48:13,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:13,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:13,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:48:13,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 10:48:13,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649876662] [2025-03-04 10:48:13,998 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941158456] [2025-03-04 10:48:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941158456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:13,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:48:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823362959] [2025-03-04 10:48:13,998 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:13,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:48:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:13,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:48:13,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:48:13,999 INFO L87 Difference]: Start difference. First operand 1025 states and 1383 transitions. Second operand has 13 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:48:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:14,531 INFO L93 Difference]: Finished difference Result 1103 states and 1475 transitions. [2025-03-04 10:48:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:48:14,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 97 [2025-03-04 10:48:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:14,534 INFO L225 Difference]: With dead ends: 1103 [2025-03-04 10:48:14,534 INFO L226 Difference]: Without dead ends: 1101 [2025-03-04 10:48:14,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:48:14,535 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 345 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:14,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 207 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:48:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-03-04 10:48:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1041. [2025-03-04 10:48:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 905 states have (on average 1.3193370165745857) internal successors, (1194), 933 states have internal predecessors, (1194), 105 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 10:48:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1404 transitions. [2025-03-04 10:48:14,587 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1404 transitions. Word has length 97 [2025-03-04 10:48:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:14,587 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1404 transitions. [2025-03-04 10:48:14,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:48:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1404 transitions. [2025-03-04 10:48:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 10:48:14,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:14,587 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:14,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:14,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-04 10:48:14,792 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1316564961, now seen corresponding path program 2 times [2025-03-04 10:48:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477193199] [2025-03-04 10:48:14,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:48:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:14,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-04 10:48:14,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:48:14,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:48:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:14,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473802148] [2025-03-04 10:48:14,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:48:14,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:14,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:14,806 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:14,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-04 10:48:14,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-04 10:48:14,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:48:14,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:48:14,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:14,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:48:14,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:15,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:15,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:15,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477193199] [2025-03-04 10:48:15,310 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:15,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473802148] [2025-03-04 10:48:15,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473802148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:15,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:48:15,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:48:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637498367] [2025-03-04 10:48:15,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:15,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:48:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:15,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:48:15,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:48:15,311 INFO L87 Difference]: Start difference. First operand 1041 states and 1404 transitions. Second operand has 10 states, 9 states have (on average 13.11111111111111) internal successors, (118), 10 states have internal predecessors, (118), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:48:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:17,534 INFO L93 Difference]: Finished difference Result 1175 states and 1566 transitions. [2025-03-04 10:48:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:48:17,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.11111111111111) internal successors, (118), 10 states have internal predecessors, (118), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 97 [2025-03-04 10:48:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:17,537 INFO L225 Difference]: With dead ends: 1175 [2025-03-04 10:48:17,537 INFO L226 Difference]: Without dead ends: 1172 [2025-03-04 10:48:17,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:48:17,538 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 365 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:17,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 425 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 10:48:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-04 10:48:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1040. [2025-03-04 10:48:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 907 states have (on average 1.310915104740904) internal successors, (1189), 934 states have internal predecessors, (1189), 103 states have call successors, (103), 2 states have call predecessors, (103), 2 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-04 10:48:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1395 transitions. [2025-03-04 10:48:17,586 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1395 transitions. Word has length 97 [2025-03-04 10:48:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:17,587 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1395 transitions. [2025-03-04 10:48:17,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.11111111111111) internal successors, (118), 10 states have internal predecessors, (118), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:48:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1395 transitions. [2025-03-04 10:48:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 10:48:17,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:17,587 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:17,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-03-04 10:48:17,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-04 10:48:17,788 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:17,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash 475907831, now seen corresponding path program 1 times [2025-03-04 10:48:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:17,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385272172] [2025-03-04 10:48:17,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:17,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:17,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:48:17,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:48:17,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:17,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518819404] [2025-03-04 10:48:17,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:17,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:17,798 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:17,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-04 10:48:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:48:17,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:48:17,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:17,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:48:17,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:18,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385272172] [2025-03-04 10:48:18,103 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518819404] [2025-03-04 10:48:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518819404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:18,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:18,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:48:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556756942] [2025-03-04 10:48:18,103 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:18,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:48:18,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:18,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:48:18,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:48:18,103 INFO L87 Difference]: Start difference. First operand 1040 states and 1395 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 10:48:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:18,620 INFO L93 Difference]: Finished difference Result 1107 states and 1490 transitions. [2025-03-04 10:48:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:48:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 98 [2025-03-04 10:48:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:18,623 INFO L225 Difference]: With dead ends: 1107 [2025-03-04 10:48:18,623 INFO L226 Difference]: Without dead ends: 1103 [2025-03-04 10:48:18,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:48:18,624 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 171 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:18,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 289 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:48:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-03-04 10:48:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 930. [2025-03-04 10:48:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 813 states have (on average 1.2595325953259533) internal successors, (1024), 836 states have internal predecessors, (1024), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-04 10:48:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1206 transitions. [2025-03-04 10:48:18,668 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1206 transitions. Word has length 98 [2025-03-04 10:48:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:18,668 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1206 transitions. [2025-03-04 10:48:18,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 10:48:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1206 transitions. [2025-03-04 10:48:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 10:48:18,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:18,668 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:18,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:18,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-03-04 10:48:18,869 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1868240961, now seen corresponding path program 1 times [2025-03-04 10:48:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174534525] [2025-03-04 10:48:18,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:18,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 10:48:18,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:48:18,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:18,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:18,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831621586] [2025-03-04 10:48:18,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:18,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:18,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:18,879 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:18,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-04 10:48:18,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 10:48:18,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:48:18,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:18,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:18,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:48:18,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:19,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:19,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174534525] [2025-03-04 10:48:19,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:19,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831621586] [2025-03-04 10:48:19,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831621586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:19,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:19,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:48:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337190145] [2025-03-04 10:48:19,236 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:19,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:48:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:19,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:48:19,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:48:19,236 INFO L87 Difference]: Start difference. First operand 930 states and 1206 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 10:48:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:19,489 INFO L93 Difference]: Finished difference Result 977 states and 1264 transitions. [2025-03-04 10:48:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:48:19,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2025-03-04 10:48:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:19,492 INFO L225 Difference]: With dead ends: 977 [2025-03-04 10:48:19,492 INFO L226 Difference]: Without dead ends: 975 [2025-03-04 10:48:19,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:48:19,493 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:19,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 241 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:48:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-04 10:48:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 944. [2025-03-04 10:48:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 825 states have (on average 1.256969696969697) internal successors, (1037), 848 states have internal predecessors, (1037), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-04 10:48:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1223 transitions. [2025-03-04 10:48:19,538 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1223 transitions. Word has length 99 [2025-03-04 10:48:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:19,538 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1223 transitions. [2025-03-04 10:48:19,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 10:48:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1223 transitions. [2025-03-04 10:48:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 10:48:19,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:19,539 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:19,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:19,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:19,739 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:19,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1796421921, now seen corresponding path program 2 times [2025-03-04 10:48:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451390853] [2025-03-04 10:48:19,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:48:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:19,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 10:48:19,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:48:19,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:48:19,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140692608] [2025-03-04 10:48:19,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:48:19,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:19,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:19,750 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:19,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-03-04 10:48:19,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 10:48:19,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:48:19,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:48:19,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:19,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:48:19,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:20,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451390853] [2025-03-04 10:48:20,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140692608] [2025-03-04 10:48:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140692608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:20,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:48:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-04 10:48:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305298275] [2025-03-04 10:48:20,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:48:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:20,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:48:20,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:48:20,302 INFO L87 Difference]: Start difference. First operand 944 states and 1223 transitions. Second operand has 9 states, 8 states have (on average 15.25) internal successors, (122), 9 states have internal predecessors, (122), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:48:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:21,728 INFO L93 Difference]: Finished difference Result 1066 states and 1370 transitions. [2025-03-04 10:48:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:48:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 15.25) internal successors, (122), 9 states have internal predecessors, (122), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 99 [2025-03-04 10:48:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:21,731 INFO L225 Difference]: With dead ends: 1066 [2025-03-04 10:48:21,731 INFO L226 Difference]: Without dead ends: 1064 [2025-03-04 10:48:21,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:48:21,732 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 434 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:21,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 326 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 10:48:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-04 10:48:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 933. [2025-03-04 10:48:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 817 states have (on average 1.2509179926560587) internal successors, (1022), 839 states have internal predecessors, (1022), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-04 10:48:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1204 transitions. [2025-03-04 10:48:21,784 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1204 transitions. Word has length 99 [2025-03-04 10:48:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:21,784 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1204 transitions. [2025-03-04 10:48:21,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 15.25) internal successors, (122), 9 states have internal predecessors, (122), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:48:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1204 transitions. [2025-03-04 10:48:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 10:48:21,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:21,785 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:21,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-03-04 10:48:21,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:21,986 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2080895029, now seen corresponding path program 1 times [2025-03-04 10:48:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:21,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148448864] [2025-03-04 10:48:21,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:21,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:21,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 10:48:21,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 10:48:21,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:21,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406997334] [2025-03-04 10:48:21,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:21,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:21,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:21,997 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:21,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-03-04 10:48:22,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 10:48:22,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 10:48:22,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:22,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:22,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:48:22,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:22,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-04 10:48:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148448864] [2025-03-04 10:48:22,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406997334] [2025-03-04 10:48:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406997334] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:22,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:48:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936188238] [2025-03-04 10:48:22,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:48:22,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:48:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:22,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:48:22,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:48:22,448 INFO L87 Difference]: Start difference. First operand 933 states and 1204 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:48:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:22,766 INFO L93 Difference]: Finished difference Result 933 states and 1204 transitions. [2025-03-04 10:48:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:48:22,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2025-03-04 10:48:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:22,769 INFO L225 Difference]: With dead ends: 933 [2025-03-04 10:48:22,769 INFO L226 Difference]: Without dead ends: 932 [2025-03-04 10:48:22,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:48:22,769 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:22,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 106 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:48:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-04 10:48:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2025-03-04 10:48:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 817 states have (on average 1.2301101591187271) internal successors, (1005), 838 states have internal predecessors, (1005), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-04 10:48:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1187 transitions. [2025-03-04 10:48:22,825 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1187 transitions. Word has length 100 [2025-03-04 10:48:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:22,825 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1187 transitions. [2025-03-04 10:48:22,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:48:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1187 transitions. [2025-03-04 10:48:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 10:48:22,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:22,826 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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-04 10:48:22,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:23,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-04 10:48:23,026 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash 870107706, now seen corresponding path program 1 times [2025-03-04 10:48:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156297592] [2025-03-04 10:48:23,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:23,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 10:48:23,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 10:48:23,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:23,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:48:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156297592] [2025-03-04 10:48:23,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156297592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981211924] [2025-03-04 10:48:23,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:23,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:23,090 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:23,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-03-04 10:48:23,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 10:48:23,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 10:48:23,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:23,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:23,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:48:23,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:48:23,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:48:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981211924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:23,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:48:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:48:23,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777939733] [2025-03-04 10:48:23,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:23,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:48:23,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:23,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:48:23,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:48:23,241 INFO L87 Difference]: Start difference. First operand 932 states and 1187 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 6 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-04 10:48:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:23,726 INFO L93 Difference]: Finished difference Result 934 states and 1189 transitions. [2025-03-04 10:48:23,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:48:23,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 6 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 102 [2025-03-04 10:48:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:23,729 INFO L225 Difference]: With dead ends: 934 [2025-03-04 10:48:23,729 INFO L226 Difference]: Without dead ends: 933 [2025-03-04 10:48:23,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:48:23,729 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 117 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:23,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 118 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:48:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-04 10:48:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 931. [2025-03-04 10:48:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 817 states have (on average 1.2252141982864138) internal successors, (1001), 837 states have internal predecessors, (1001), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-04 10:48:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1183 transitions. [2025-03-04 10:48:23,779 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1183 transitions. Word has length 102 [2025-03-04 10:48:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:23,779 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1183 transitions. [2025-03-04 10:48:23,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 states have internal predecessors, (79), 6 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-04 10:48:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1183 transitions. [2025-03-04 10:48:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 10:48:23,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:23,780 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:23,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:23,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 10:48:23,981 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:23,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 83236543, now seen corresponding path program 1 times [2025-03-04 10:48:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885053429] [2025-03-04 10:48:23,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:23,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 10:48:23,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 10:48:23,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:23,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:23,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128525322] [2025-03-04 10:48:23,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:23,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:23,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:23,991 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:23,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-03-04 10:48:24,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 10:48:24,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 10:48:24,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:24,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:24,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:48:24,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 10:48:24,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 10:48:24,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:24,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885053429] [2025-03-04 10:48:24,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:24,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128525322] [2025-03-04 10:48:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128525322] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:48:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62915953] [2025-03-04 10:48:24,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:48:24,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:48:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:24,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:48:24,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:48:24,514 INFO L87 Difference]: Start difference. First operand 931 states and 1183 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:48:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:25,110 INFO L93 Difference]: Finished difference Result 931 states and 1183 transitions. [2025-03-04 10:48:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:48:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-04 10:48:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:25,112 INFO L225 Difference]: With dead ends: 931 [2025-03-04 10:48:25,112 INFO L226 Difference]: Without dead ends: 928 [2025-03-04 10:48:25,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:48:25,113 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:25,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 106 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:48:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-03-04 10:48:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2025-03-04 10:48:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 817 states have (on average 1.197062423500612) internal successors, (978), 834 states have internal predecessors, (978), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-04 10:48:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1160 transitions. [2025-03-04 10:48:25,165 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1160 transitions. Word has length 101 [2025-03-04 10:48:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:25,165 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1160 transitions. [2025-03-04 10:48:25,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:48:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1160 transitions. [2025-03-04 10:48:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:48:25,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:25,165 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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-04 10:48:25,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-03-04 10:48:25,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-04 10:48:25,366 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1203535118, now seen corresponding path program 1 times [2025-03-04 10:48:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226440619] [2025-03-04 10:48:25,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:25,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:48:25,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:48:25,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:25,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 10:48:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226440619] [2025-03-04 10:48:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226440619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:48:25,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:48:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:48:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858446232] [2025-03-04 10:48:25,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:48:25,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:48:25,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:25,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:48:25,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:48:25,418 INFO L87 Difference]: Start difference. First operand 928 states and 1160 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:48:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:25,863 INFO L93 Difference]: Finished difference Result 941 states and 1171 transitions. [2025-03-04 10:48:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:48:25,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 103 [2025-03-04 10:48:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:25,866 INFO L225 Difference]: With dead ends: 941 [2025-03-04 10:48:25,866 INFO L226 Difference]: Without dead ends: 929 [2025-03-04 10:48:25,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:48:25,867 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 134 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:25,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 175 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:48:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-04 10:48:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 916. [2025-03-04 10:48:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 807 states have (on average 1.190830235439901) internal successors, (961), 823 states have internal predecessors, (961), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 10:48:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1141 transitions. [2025-03-04 10:48:25,922 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1141 transitions. Word has length 103 [2025-03-04 10:48:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:25,922 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1141 transitions. [2025-03-04 10:48:25,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:48:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1141 transitions. [2025-03-04 10:48:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 10:48:25,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:25,923 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:25,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 10:48:25,923 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:25,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1227820891, now seen corresponding path program 2 times [2025-03-04 10:48:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:25,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61706180] [2025-03-04 10:48:25,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:48:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:25,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-03-04 10:48:25,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 10:48:25,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:48:25,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:25,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275479599] [2025-03-04 10:48:25,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:48:25,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:25,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:25,934 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:25,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-03-04 10:48:25,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-03-04 10:48:25,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 10:48:25,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:48:25,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:25,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:48:25,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 10:48:26,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 10:48:26,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61706180] [2025-03-04 10:48:26,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275479599] [2025-03-04 10:48:26,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275479599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:26,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:48:26,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 10:48:26,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8692639] [2025-03-04 10:48:26,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:26,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:48:26,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:26,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:48:26,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:48:26,588 INFO L87 Difference]: Start difference. First operand 916 states and 1141 transitions. Second operand has 14 states, 13 states have (on average 9.923076923076923) internal successors, (129), 14 states have internal predecessors, (129), 8 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 10:48:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:27,589 INFO L93 Difference]: Finished difference Result 1105 states and 1383 transitions. [2025-03-04 10:48:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:48:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.923076923076923) internal successors, (129), 14 states have internal predecessors, (129), 8 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 107 [2025-03-04 10:48:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:27,591 INFO L225 Difference]: With dead ends: 1105 [2025-03-04 10:48:27,592 INFO L226 Difference]: Without dead ends: 1104 [2025-03-04 10:48:27,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:48:27,592 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 479 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:27,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 388 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:48:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2025-03-04 10:48:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 916. [2025-03-04 10:48:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 807 states have (on average 1.1883519206939281) internal successors, (959), 823 states have internal predecessors, (959), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 10:48:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1139 transitions. [2025-03-04 10:48:27,680 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1139 transitions. Word has length 107 [2025-03-04 10:48:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:27,680 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1139 transitions. [2025-03-04 10:48:27,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.923076923076923) internal successors, (129), 14 states have internal predecessors, (129), 8 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 10:48:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1139 transitions. [2025-03-04 10:48:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 10:48:27,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:27,681 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:27,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-03-04 10:48:27,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:27,881 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:48:27,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1755960279, now seen corresponding path program 1 times [2025-03-04 10:48:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:27,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94424565] [2025-03-04 10:48:27,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:27,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 10:48:27,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:48:27,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:27,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:27,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597596915] [2025-03-04 10:48:27,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:27,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:27,893 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:27,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-03-04 10:48:27,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 10:48:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:48:27,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:27,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:48:27,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:48:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 10:48:27,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:48:27,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:27,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:48:27,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:48:27,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:48:27,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 56 remaining) [2025-03-04 10:48:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 56 remaining) [2025-03-04 10:48:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 56 remaining) [2025-03-04 10:48:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 56 remaining) [2025-03-04 10:48:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 56 remaining) [2025-03-04 10:48:27,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-03-04 10:48:28,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:28,176 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2025-03-04 10:48:28,204 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:48:28,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:48:28 BoogieIcfgContainer [2025-03-04 10:48:28,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:48:28,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:48:28,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:48:28,207 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:48:28,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:47:42" (3/4) ... [2025-03-04 10:48:28,208 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 10:48:28,256 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-03-04 10:48:28,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:48:28,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:48:28,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:48:28,300 INFO L158 Benchmark]: Toolchain (without parser) took 46610.56ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 104.0MB in the beginning and 165.2MB in the end (delta: -61.2MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2025-03-04 10:48:28,300 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory was 127.7MB in the beginning and 127.4MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:48:28,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.28ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 92.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:48:28,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.56ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:48:28,300 INFO L158 Benchmark]: Boogie Preprocessor took 33.64ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 90.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:48:28,300 INFO L158 Benchmark]: IcfgBuilder took 453.77ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 68.9MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:48:28,300 INFO L158 Benchmark]: TraceAbstraction took 45834.45ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 67.8MB in the beginning and 172.9MB in the end (delta: -105.1MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2025-03-04 10:48:28,301 INFO L158 Benchmark]: Witness Printer took 92.94ms. Allocated memory is still 327.2MB. Free memory was 172.9MB in the beginning and 165.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:48:28,301 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory was 127.7MB in the beginning and 127.4MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.28ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 92.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.56ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.64ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 90.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 453.77ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 68.9MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45834.45ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 67.8MB in the beginning and 172.9MB in the end (delta: -105.1MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Witness Printer took 92.94ms. Allocated memory is still 327.2MB. Free memory was 172.9MB in the beginning and 165.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 35]: integer overflow possible integer overflow possible We found a FailurePath: [L19] int a, b, p, q, r, s; [L20] int x, y; [L21] x = __VERIFIER_nondet_int() [L22] y = __VERIFIER_nondet_int() [L23] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1] [L8] COND FALSE !(!cond) VAL [\old(cond)=1] [L23] RET assume_abort_if_not(x >= 1) VAL [x=1073741824, y=1073741825] [L24] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1] [L8] COND FALSE !(!cond) VAL [\old(cond)=1] [L24] RET assume_abort_if_not(y >= 1) VAL [x=1073741824, y=1073741825] [L26] a = x [L27] b = y [L28] p = 1 [L29] q = 0 [L30] r = 0 [L31] s = 1 VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L34] EXPR p * s VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L34] EXPR r * q VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L34] EXPR p * s - r * q VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L34] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L34] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L35] EXPR y * r VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L35] EXPR x * p VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L35] EXPR y * r + x * p VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L35] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L35] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L36] EXPR x * q VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L36] EXPR y * s VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L36] EXPR x * q + y * s VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L36] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L36] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L38] COND FALSE !(!(a != b)) VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L41] COND FALSE !(a > b) VAL [a=1073741824, b=1073741825, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L46] EXPR b - a [L46] b = b - a VAL [a=1073741824, b=1, p=1, q=0, r=0, s=1, x=1073741824, y=1073741825] [L47] EXPR q - p [L47] q = q - p VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L48] EXPR s - r [L48] s = s - r VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L34] EXPR p * s VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L34] EXPR r * q VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L34] EXPR p * s - r * q VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L34] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L34] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L35] EXPR y * r VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L35] EXPR x * p VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L35] EXPR y * r + x * p VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L35] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L35] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L36] EXPR x * q VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L36] EXPR y * s VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L36] EXPR x * q + y * s VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L36] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L36] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L38] COND FALSE !(!(a != b)) VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L41] COND TRUE a > b VAL [a=1073741824, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L42] EXPR a - b [L42] a = a - b VAL [a=1073741823, b=1, p=1, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L43] EXPR p - q [L43] p = p - q VAL [a=1073741823, b=1, p=2, q=-1, r=0, s=1, x=1073741824, y=1073741825] [L44] EXPR r - s [L44] r = r - s VAL [a=1073741823, b=1, p=2, q=-1, r=-1, s=1, x=1073741824, y=1073741825] [L34] EXPR p * s VAL [a=1073741823, b=1, p=2, q=-1, r=-1, s=1, x=1073741824, y=1073741825] [L34] EXPR r * q VAL [a=1073741823, b=1, p=2, q=-1, r=-1, s=1, x=1073741824, y=1073741825] [L34] EXPR p * s - r * q VAL [a=1073741823, b=1, p=2, q=-1, r=-1, s=1, x=1073741824, y=1073741825] [L34] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L34] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=1073741823, b=1, p=2, q=-1, r=-1, s=1, x=1073741824, y=1073741825] [L35] y * r VAL [a=1073741823, b=1, p=2, q=-1, r=-1, s=1, x=1073741824, y=1073741825] [L35] x * p VAL [a=1073741823, b=1, q=-1, r=-1, s=1, y=1073741825] - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 45.8s, OverallIterations: 52, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10511 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10250 mSDsluCounter, 11092 SdHoareTripleChecker+Invalid, 14.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7391 mSDsCounter, 810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20827 IncrementalHoareTripleChecker+Invalid, 21637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 810 mSolverCounterUnsat, 3701 mSDtfsCounter, 20827 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4431 GetRequests, 4008 SyntacticMatches, 7 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1041occurred in iteration=42, InterpolantAutomatonStates: 367, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 2872 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 6619 NumberOfCodeBlocks, 6619 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 5134 ConstructedInterpolants, 0 QuantifiedInterpolants, 29365 SizeOfPredicates, 60 NumberOfNonLiveVariables, 6579 ConjunctsInSsa, 406 ConjunctsInUnsatCore, 73 InterpolantComputations, 26 PerfectInterpolantSequences, 3131/4042 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 10:48:28,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)