./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.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 6c37a77a9f4db0db15bb3c5a5baacfcd5e1536d243d9987efda949cfc27e3fb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:42:04,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:42:04,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:42:04,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:42:04,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:42:04,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:42:04,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:42:04,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:42:04,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:42:04,117 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:42:04,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:42:04,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:42:04,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:42:04,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:42:04,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:42:04,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:42:04,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:42:04,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:42:04,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:42:04,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:42:04,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:42:04,120 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 -> 6c37a77a9f4db0db15bb3c5a5baacfcd5e1536d243d9987efda949cfc27e3fb7 [2025-03-17 15:42:04,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:42:04,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:42:04,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:42:04,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:42:04,359 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:42:04,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c [2025-03-17 15:42:05,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a46483c/61477f450c9b4e9c98d1e49de77479f0/FLAG0986779eb [2025-03-17 15:42:05,718 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:42:05,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c [2025-03-17 15:42:05,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a46483c/61477f450c9b4e9c98d1e49de77479f0/FLAG0986779eb [2025-03-17 15:42:05,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a46483c/61477f450c9b4e9c98d1e49de77479f0 [2025-03-17 15:42:05,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:42:05,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:42:05,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:42:05,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:42:05,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:42:05,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:05,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d8359d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05, skipping insertion in model container [2025-03-17 15:42:05,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:05,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:42:05,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:42:05,920 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:42:05,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:42:05,950 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:42:05,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05 WrapperNode [2025-03-17 15:42:05,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:42:05,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:42:05,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:42:05,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:42:05,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:05,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:05,974 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-03-17 15:42:05,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:42:05,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:42:05,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:42:05,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:42:05,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:05,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:05,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:06,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:42:06,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:06,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:06,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:06,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:06,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:06,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:06,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:42:06,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:42:06,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:42:06,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:42:06,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (1/1) ... [2025-03-17 15:42:06,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:42:06,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:06,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:42:06,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:42:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:42:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:42:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:42:06,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:42:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:42:06,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:42:06,103 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:42:06,105 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:42:06,368 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-17 15:42:06,368 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:42:06,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:42:06,378 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:42:06,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:42:06 BoogieIcfgContainer [2025-03-17 15:42:06,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:42:06,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:42:06,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:42:06,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:42:06,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:42:05" (1/3) ... [2025-03-17 15:42:06,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9e5916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:42:06, skipping insertion in model container [2025-03-17 15:42:06,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:05" (2/3) ... [2025-03-17 15:42:06,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9e5916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:42:06, skipping insertion in model container [2025-03-17 15:42:06,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:42:06" (3/3) ... [2025-03-17 15:42:06,388 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound50.c [2025-03-17 15:42:06,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:42:06,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll_unwindbound50.c that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 52 error locations. [2025-03-17 15:42:06,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:42:06,438 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;@4ed0398e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:42:06,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-17 15:42:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:42:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 15:42:06,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:06,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 15:42:06,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash 145907, now seen corresponding path program 1 times [2025-03-17 15:42:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:06,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882727538] [2025-03-17 15:42:06,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:06,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 15:42:06,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 15:42:06,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:06,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:42:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:06,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882727538] [2025-03-17 15:42:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882727538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:06,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:42:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267924099] [2025-03-17 15:42:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:06,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:42:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:06,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:42:06,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:42:06,619 INFO L87 Difference]: Start difference. First operand has 121 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:42:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:06,692 INFO L93 Difference]: Finished difference Result 241 states and 271 transitions. [2025-03-17 15:42:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:42:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 15:42:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:06,700 INFO L225 Difference]: With dead ends: 241 [2025-03-17 15:42:06,700 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 15:42:06,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:42:06,706 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:06,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 352 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:42:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 15:42:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-17 15:42:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 110 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:42:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2025-03-17 15:42:06,742 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 3 [2025-03-17 15:42:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:06,742 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2025-03-17 15:42:06,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:42:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2025-03-17 15:42:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:42:06,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:06,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:42:06,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:42:06,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash 51828508, now seen corresponding path program 1 times [2025-03-17 15:42:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:06,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189982985] [2025-03-17 15:42:06,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:06,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:42:06,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:42:06,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:06,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:42:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189982985] [2025-03-17 15:42:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189982985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:42:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284698714] [2025-03-17 15:42:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:06,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:42:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:06,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:42:06,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:06,791 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:42:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:06,869 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2025-03-17 15:42:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:42:06,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:42:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:06,871 INFO L225 Difference]: With dead ends: 117 [2025-03-17 15:42:06,871 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 15:42:06,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:06,871 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 79 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:06,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 84 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 15:42:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 15:42:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 101 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:42:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2025-03-17 15:42:06,883 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 6 [2025-03-17 15:42:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:06,883 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2025-03-17 15:42:06,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:42:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2025-03-17 15:42:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:42:06,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:06,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:42:06,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:42:06,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:06,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1606683823, now seen corresponding path program 1 times [2025-03-17 15:42:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679557620] [2025-03-17 15:42:06,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:06,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:06,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:42:06,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:42:06,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:06,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:42:06,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679557620] [2025-03-17 15:42:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679557620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:06,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:42:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028988406] [2025-03-17 15:42:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:06,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:42:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:06,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:42:06,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:06,918 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:42:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:07,007 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2025-03-17 15:42:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:42:07,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:42:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:07,009 INFO L225 Difference]: With dead ends: 191 [2025-03-17 15:42:07,010 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 15:42:07,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:07,011 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 67 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:07,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 160 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 15:42:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2025-03-17 15:42:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.5520833333333333) internal successors, (149), 134 states have internal predecessors, (149), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:42:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2025-03-17 15:42:07,026 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 7 [2025-03-17 15:42:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:07,026 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2025-03-17 15:42:07,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:42:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2025-03-17 15:42:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:42:07,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:07,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:42:07,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:42:07,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:07,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2027551711, now seen corresponding path program 1 times [2025-03-17 15:42:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:07,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151364937] [2025-03-17 15:42:07,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:07,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:42:07,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:42:07,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:07,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:42:07,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569186357] [2025-03-17 15:42:07,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:07,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:07,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:07,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:07,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:42:07,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:42:07,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:42:07,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:07,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:07,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:42:07,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:42:07,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:42:07,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:07,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151364937] [2025-03-17 15:42:07,147 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:42:07,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569186357] [2025-03-17 15:42:07,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569186357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:07,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:07,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:42:07,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039468672] [2025-03-17 15:42:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:07,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:42:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:07,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:42:07,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:07,150 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:42:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:07,224 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2025-03-17 15:42:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:42:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-17 15:42:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:07,225 INFO L225 Difference]: With dead ends: 184 [2025-03-17 15:42:07,225 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 15:42:07,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:07,226 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 59 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:07,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 162 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 15:42:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 147. [2025-03-17 15:42:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.530612244897959) internal successors, (150), 136 states have internal predecessors, (150), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:42:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2025-03-17 15:42:07,243 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 20 [2025-03-17 15:42:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:07,244 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2025-03-17 15:42:07,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:42:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2025-03-17 15:42:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 15:42:07,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:07,244 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-17 15:42:07,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:42:07,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:07,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:07,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1416214445, now seen corresponding path program 1 times [2025-03-17 15:42:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:07,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100754145] [2025-03-17 15:42:07,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:07,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 15:42:07,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 15:42:07,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:07,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:42:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314484176] [2025-03-17 15:42:07,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:07,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:07,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:42:07,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 15:42:07,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 15:42:07,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:07,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:07,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:42:07,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:07,518 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-17 15:42:07,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:42:07,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100754145] [2025-03-17 15:42:07,518 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:42:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314484176] [2025-03-17 15:42:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314484176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:07,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:42:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097050405] [2025-03-17 15:42:07,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:07,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:42:07,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:07,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:42:07,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:07,520 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-17 15:42:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:07,605 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2025-03-17 15:42:07,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:42:07,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 27 [2025-03-17 15:42:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:07,606 INFO L225 Difference]: With dead ends: 174 [2025-03-17 15:42:07,606 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 15:42:07,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:07,607 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 41 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:07,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 168 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 15:42:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2025-03-17 15:42:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 146 states have internal predecessors, (161), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:42:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2025-03-17 15:42:07,616 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 27 [2025-03-17 15:42:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:07,616 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2025-03-17 15:42:07,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-17 15:42:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2025-03-17 15:42:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 15:42:07,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:07,617 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-17 15:42:07,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:42:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:07,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:07,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 952974886, now seen corresponding path program 1 times [2025-03-17 15:42:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752214614] [2025-03-17 15:42:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:07,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:42:07,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:42:07,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:07,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:07,885 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-17 15:42:07,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:07,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752214614] [2025-03-17 15:42:07,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752214614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:07,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:07,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:42:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579343589] [2025-03-17 15:42:07,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:07,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:42:07,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:07,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:42:07,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:07,888 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-17 15:42:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:07,966 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2025-03-17 15:42:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:42:07,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2025-03-17 15:42:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:07,967 INFO L225 Difference]: With dead ends: 166 [2025-03-17 15:42:07,967 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 15:42:07,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:07,968 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:07,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 173 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 15:42:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2025-03-17 15:42:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 108 states have (on average 1.4722222222222223) internal successors, (159), 146 states have internal predecessors, (159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:42:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2025-03-17 15:42:07,974 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 28 [2025-03-17 15:42:07,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:07,975 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2025-03-17 15:42:07,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-17 15:42:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2025-03-17 15:42:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:42:07,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:07,975 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-17 15:42:07,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:42:07,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:07,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash -522549557, now seen corresponding path program 1 times [2025-03-17 15:42:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946978566] [2025-03-17 15:42:07,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:07,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:42:07,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:42:07,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:07,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:08,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-17 15:42:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:08,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946978566] [2025-03-17 15:42:08,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946978566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:08,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:08,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:42:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76583777] [2025-03-17 15:42:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:08,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:42:08,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:08,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:42:08,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:08,014 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-17 15:42:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:08,089 INFO L93 Difference]: Finished difference Result 172 states and 190 transitions. [2025-03-17 15:42:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:42:08,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 29 [2025-03-17 15:42:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:08,091 INFO L225 Difference]: With dead ends: 172 [2025-03-17 15:42:08,091 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 15:42:08,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:42:08,091 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:08,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 177 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 15:42:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-17 15:42:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 111 states have (on average 1.4144144144144144) internal successors, (157), 149 states have internal predecessors, (157), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:42:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2025-03-17 15:42:08,104 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 29 [2025-03-17 15:42:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:08,104 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2025-03-17 15:42:08,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-17 15:42:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2025-03-17 15:42:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:42:08,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:08,106 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, 1] [2025-03-17 15:42:08,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:42:08,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:08,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 341050857, now seen corresponding path program 1 times [2025-03-17 15:42:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:08,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132082492] [2025-03-17 15:42:08,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:08,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:42:08,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:42:08,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:08,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:08,149 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-17 15:42:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132082492] [2025-03-17 15:42:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132082492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:42:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816912304] [2025-03-17 15:42:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:08,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:42:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:08,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:42:08,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:42:08,150 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 15:42:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:08,271 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2025-03-17 15:42:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:42:08,271 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), 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 31 [2025-03-17 15:42:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:08,272 INFO L225 Difference]: With dead ends: 166 [2025-03-17 15:42:08,274 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 15:42:08,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:42:08,274 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 87 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:08,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 198 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 15:42:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-17 15:42:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 149 states have internal predecessors, (155), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:42:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2025-03-17 15:42:08,290 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 31 [2025-03-17 15:42:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:08,291 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2025-03-17 15:42:08,291 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), 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-17 15:42:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2025-03-17 15:42:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:42:08,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:08,291 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, 1, 1, 1, 1, 1] [2025-03-17 15:42:08,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:42:08,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash 498144293, now seen corresponding path program 1 times [2025-03-17 15:42:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231123716] [2025-03-17 15:42:08,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:08,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:42:08,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:42:08,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:08,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:08,363 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-17 15:42:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231123716] [2025-03-17 15:42:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231123716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:08,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:42:08,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295130689] [2025-03-17 15:42:08,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:08,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:42:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:08,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:42:08,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:42:08,364 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-17 15:42:12,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:12,506 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2025-03-17 15:42:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:42:12,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2025-03-17 15:42:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:12,507 INFO L225 Difference]: With dead ends: 166 [2025-03-17 15:42:12,507 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 15:42:12,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:42:12,508 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 81 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:12,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 188 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 15:42:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 15:42:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 15:42:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 128 states have internal predecessors, (130), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:42:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2025-03-17 15:42:12,515 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 35 [2025-03-17 15:42:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2025-03-17 15:42:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-17 15:42:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2025-03-17 15:42:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 15:42:12,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:12,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:42:12,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:42:12,516 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:12,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1132371136, now seen corresponding path program 1 times [2025-03-17 15:42:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528014095] [2025-03-17 15:42:12,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:12,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 15:42:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 15:42:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:12,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:12,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528014095] [2025-03-17 15:42:12,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528014095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:12,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:42:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071575139] [2025-03-17 15:42:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:12,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:42:12,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:12,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:42:12,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:42:12,574 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:42:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:12,648 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2025-03-17 15:42:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:42:12,648 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-17 15:42:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:12,650 INFO L225 Difference]: With dead ends: 141 [2025-03-17 15:42:12,650 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 15:42:12,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:42:12,651 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:12,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 160 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 15:42:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-17 15:42:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 129 states have internal predecessors, (131), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:42:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2025-03-17 15:42:12,658 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 48 [2025-03-17 15:42:12,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:12,659 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2025-03-17 15:42:12,659 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:42:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2025-03-17 15:42:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:42:12,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:12,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:42:12,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:42:12,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash -743766830, now seen corresponding path program 1 times [2025-03-17 15:42:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041930900] [2025-03-17 15:42:12,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:12,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:42:12,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:42:12,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:12,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:12,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041930900] [2025-03-17 15:42:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041930900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:12,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:12,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:42:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765112835] [2025-03-17 15:42:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:12,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:42:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:12,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:42:12,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:42:12,705 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:42:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:12,786 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2025-03-17 15:42:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:42:12,787 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-17 15:42:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:12,788 INFO L225 Difference]: With dead ends: 141 [2025-03-17 15:42:12,788 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 15:42:12,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:42:12,788 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:12,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 15:42:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-17 15:42:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 92 states have (on average 1.434782608695652) internal successors, (132), 130 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:42:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2025-03-17 15:42:12,805 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 49 [2025-03-17 15:42:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:12,805 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2025-03-17 15:42:12,805 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:42:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2025-03-17 15:42:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 15:42:12,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:12,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-17 15:42:12,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:42:12,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:12,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1795349776, now seen corresponding path program 1 times [2025-03-17 15:42:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:12,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823208937] [2025-03-17 15:42:12,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:12,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:12,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:42:12,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:42:12,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:12,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:12,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:12,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823208937] [2025-03-17 15:42:12,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823208937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:12,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858788656] [2025-03-17 15:42:12,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:12,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:12,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:12,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:12,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:42:12,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:42:12,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:42:12,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:12,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:12,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:42:12,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:13,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:42:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858788656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:42:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-17 15:42:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789838571] [2025-03-17 15:42:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:42:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:13,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:42:13,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:42:13,004 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:42:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:13,024 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2025-03-17 15:42:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:42:13,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-17 15:42:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:13,025 INFO L225 Difference]: With dead ends: 140 [2025-03-17 15:42:13,025 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 15:42:13,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:42:13,025 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 69 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:13,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 304 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:42:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 15:42:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-17 15:42:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.423913043478261) internal successors, (131), 129 states have internal predecessors, (131), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:42:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2025-03-17 15:42:13,032 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 51 [2025-03-17 15:42:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:13,032 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2025-03-17 15:42:13,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:42:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2025-03-17 15:42:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 15:42:13,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:13,035 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-17 15:42:13,041 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-17 15:42:13,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:13,235 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:13,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash 178731873, now seen corresponding path program 1 times [2025-03-17 15:42:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:13,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062574041] [2025-03-17 15:42:13,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:13,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:13,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:42:13,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:42:13,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:13,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:13,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:13,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062574041] [2025-03-17 15:42:13,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062574041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:13,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849892349] [2025-03-17 15:42:13,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:13,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:13,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:13,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:13,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:42:13,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:42:13,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:42:13,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:13,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:13,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:42:13,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:13,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:42:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849892349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:42:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-17 15:42:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244862716] [2025-03-17 15:42:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:13,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:42:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:13,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:42:13,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:42:13,401 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:42:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:13,444 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2025-03-17 15:42:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:42:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-17 15:42:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:13,445 INFO L225 Difference]: With dead ends: 183 [2025-03-17 15:42:13,445 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 15:42:13,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:42:13,446 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 67 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:13,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 461 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:42:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 15:42:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 154. [2025-03-17 15:42:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 142 states have internal predecessors, (148), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:42:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-03-17 15:42:13,461 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 52 [2025-03-17 15:42:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:13,462 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-03-17 15:42:13,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:42:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-03-17 15:42:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:42:13,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:13,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-17 15:42:13,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:42:13,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:13,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:13,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1158140116, now seen corresponding path program 1 times [2025-03-17 15:42:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:13,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852836769] [2025-03-17 15:42:13,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:13,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:42:13,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:42:13,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:13,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852836769] [2025-03-17 15:42:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852836769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110293548] [2025-03-17 15:42:13,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:13,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:13,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:13,700 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:13,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:42:13,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:42:13,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:42:13,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:13,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:13,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:42:13,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:13,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:42:13,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110293548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:13,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:42:13,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 15:42:13,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370768938] [2025-03-17 15:42:13,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:13,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:42:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:13,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:42:13,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:42:13,846 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:42:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:13,959 INFO L93 Difference]: Finished difference Result 278 states and 329 transitions. [2025-03-17 15:42:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:42:13,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2025-03-17 15:42:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:13,962 INFO L225 Difference]: With dead ends: 278 [2025-03-17 15:42:13,962 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 15:42:13,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:42:13,962 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 143 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:13,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 227 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 15:42:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 145. [2025-03-17 15:42:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 133 states have internal predecessors, (135), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:42:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2025-03-17 15:42:13,972 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 55 [2025-03-17 15:42:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:13,973 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2025-03-17 15:42:13,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:42:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2025-03-17 15:42:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 15:42:13,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:13,974 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] [2025-03-17 15:42:13,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 15:42:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 15:42:14,175 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1338471294, now seen corresponding path program 1 times [2025-03-17 15:42:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411159618] [2025-03-17 15:42:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:14,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:42:14,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:42:14,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:14,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:42:14,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980958763] [2025-03-17 15:42:14,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:14,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:14,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:14,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:14,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:42:14,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:42:14,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:42:14,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:14,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:14,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:42:14,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:42:14,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:42:14,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411159618] [2025-03-17 15:42:14,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:42:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980958763] [2025-03-17 15:42:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980958763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:14,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:42:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-17 15:42:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331829275] [2025-03-17 15:42:14,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:14,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:42:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:14,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:42:14,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:42:14,369 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:42:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:14,525 INFO L93 Difference]: Finished difference Result 369 states and 404 transitions. [2025-03-17 15:42:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:42:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 68 [2025-03-17 15:42:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:14,527 INFO L225 Difference]: With dead ends: 369 [2025-03-17 15:42:14,527 INFO L226 Difference]: Without dead ends: 367 [2025-03-17 15:42:14,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:42:14,528 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 241 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:14,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 327 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-17 15:42:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 243. [2025-03-17 15:42:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 195 states have (on average 1.3282051282051281) internal successors, (259), 223 states have internal predecessors, (259), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 15:42:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 295 transitions. [2025-03-17 15:42:14,538 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 295 transitions. Word has length 68 [2025-03-17 15:42:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:14,539 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 295 transitions. [2025-03-17 15:42:14,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:42:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 295 transitions. [2025-03-17 15:42:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 15:42:14,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:14,540 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] [2025-03-17 15:42:14,545 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-17 15:42:14,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 15:42:14,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2065122902, now seen corresponding path program 1 times [2025-03-17 15:42:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:14,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030974080] [2025-03-17 15:42:14,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:14,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:14,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 15:42:14,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 15:42:14,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:14,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:42:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580884028] [2025-03-17 15:42:14,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:14,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:14,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:14,753 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:14,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:42:14,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 15:42:14,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 15:42:14,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:14,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:14,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:42:14,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:14,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030974080] [2025-03-17 15:42:14,940 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:42:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580884028] [2025-03-17 15:42:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580884028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:14,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:42:14,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-17 15:42:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843681042] [2025-03-17 15:42:14,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:14,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:42:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:14,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:42:14,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:42:14,941 INFO L87 Difference]: Start difference. First operand 243 states and 295 transitions. Second operand has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 15:42:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:15,137 INFO L93 Difference]: Finished difference Result 331 states and 405 transitions. [2025-03-17 15:42:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:42:15,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 75 [2025-03-17 15:42:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:15,139 INFO L225 Difference]: With dead ends: 331 [2025-03-17 15:42:15,139 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 15:42:15,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:42:15,140 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 224 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:15,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 259 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:42:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 15:42:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2025-03-17 15:42:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.2412060301507537) internal successors, (247), 221 states have internal predecessors, (247), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 15:42:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 287 transitions. [2025-03-17 15:42:15,154 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 287 transitions. Word has length 75 [2025-03-17 15:42:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:15,154 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 287 transitions. [2025-03-17 15:42:15,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 15:42:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 287 transitions. [2025-03-17 15:42:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 15:42:15,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:15,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:42:15,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:42:15,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:15,356 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:15,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash 405699529, now seen corresponding path program 1 times [2025-03-17 15:42:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:15,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766907485] [2025-03-17 15:42:15,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:15,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:42:15,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:42:15,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:15,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766907485] [2025-03-17 15:42:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766907485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069955635] [2025-03-17 15:42:15,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:15,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:15,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:15,434 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:15,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:42:15,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:42:15,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:42:15,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:15,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:15,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:42:15,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:15,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069955635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:15,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:42:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 15:42:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339174076] [2025-03-17 15:42:15,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:42:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:15,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:42:15,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:42:15,682 INFO L87 Difference]: Start difference. First operand 243 states and 287 transitions. Second operand has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-17 15:42:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:15,808 INFO L93 Difference]: Finished difference Result 243 states and 287 transitions. [2025-03-17 15:42:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:42:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 76 [2025-03-17 15:42:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:15,812 INFO L225 Difference]: With dead ends: 243 [2025-03-17 15:42:15,812 INFO L226 Difference]: Without dead ends: 240 [2025-03-17 15:42:15,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:42:15,813 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 123 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:15,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 157 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-17 15:42:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-03-17 15:42:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.2060301507537687) internal successors, (240), 218 states have internal predecessors, (240), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 15:42:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 280 transitions. [2025-03-17 15:42:15,839 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 280 transitions. Word has length 76 [2025-03-17 15:42:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:15,839 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 280 transitions. [2025-03-17 15:42:15,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-17 15:42:15,839 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2025-03-17 15:42:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 15:42:15,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:15,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:42:15,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:42:16,042 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,SelfDestructingSolverStorable16 [2025-03-17 15:42:16,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:16,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:16,043 INFO L85 PathProgramCache]: Analyzing trace with hash -308216440, now seen corresponding path program 1 times [2025-03-17 15:42:16,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:16,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-03-17 15:42:16,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:16,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:16,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 15:42:16,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 15:42:16,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:16,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-03-17 15:42:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890222906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449234450] [2025-03-17 15:42:16,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:16,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:16,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:16,107 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:42:16,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:42:16,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 15:42:16,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 15:42:16,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:16,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:16,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:42:16,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:16,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:16,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449234450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:16,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:42:16,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 15:42:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371812980] [2025-03-17 15:42:16,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:16,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:42:16,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:16,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:42:16,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:42:16,344 INFO L87 Difference]: Start difference. First operand 240 states and 280 transitions. Second operand has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-17 15:42:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:16,530 INFO L93 Difference]: Finished difference Result 295 states and 345 transitions. [2025-03-17 15:42:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:42:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 77 [2025-03-17 15:42:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:16,532 INFO L225 Difference]: With dead ends: 295 [2025-03-17 15:42:16,532 INFO L226 Difference]: Without dead ends: 286 [2025-03-17 15:42:16,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:42:16,533 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 122 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:16,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 269 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:42:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-17 15:42:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 250. [2025-03-17 15:42:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 213 states have (on average 1.1220657276995305) internal successors, (239), 226 states have internal predecessors, (239), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 15:42:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2025-03-17 15:42:16,543 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 77 [2025-03-17 15:42:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:16,544 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2025-03-17 15:42:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-17 15:42:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2025-03-17 15:42:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 15:42:16,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:16,544 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] [2025-03-17 15:42:16,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 15:42:16,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 15:42:16,745 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:16,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash 156746086, now seen corresponding path program 1 times [2025-03-17 15:42:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254638250] [2025-03-17 15:42:16,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:16,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:16,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 15:42:16,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 15:42:16,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:16,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:16,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254638250] [2025-03-17 15:42:16,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254638250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:16,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148995346] [2025-03-17 15:42:16,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:16,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:16,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:16,808 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-17 15:42:16,809 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-17 15:42:16,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 15:42:16,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 15:42:16,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:16,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:16,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:42:16,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:42:17,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:42:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148995346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:17,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:42:17,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-17 15:42:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591659853] [2025-03-17 15:42:17,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:17,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:42:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:17,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:42:17,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:42:17,015 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-17 15:42:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:17,117 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2025-03-17 15:42:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:42:17,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 79 [2025-03-17 15:42:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:17,118 INFO L225 Difference]: With dead ends: 252 [2025-03-17 15:42:17,118 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 15:42:17,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:42:17,119 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 93 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:17,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 151 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 15:42:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-17 15:42:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.0497237569060773) internal successors, (190), 187 states have internal predecessors, (190), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 15:42:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2025-03-17 15:42:17,130 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 79 [2025-03-17 15:42:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:17,130 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2025-03-17 15:42:17,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-17 15:42:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2025-03-17 15:42:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 15:42:17,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:17,132 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2025-03-17 15:42:17,138 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-17 15:42:17,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:17,336 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:17,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1521099596, now seen corresponding path program 1 times [2025-03-17 15:42:17,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:17,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-03-17 15:42:17,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:17,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 15:42:17,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 15:42:17,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:17,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 15:42:17,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:17,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-03-17 15:42:17,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130544518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:17,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911620608] [2025-03-17 15:42:17,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:42:17,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:17,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:17,463 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-17 15:42:17,465 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-17 15:42:17,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 15:42:17,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 15:42:17,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:42:17,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:17,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:42:17,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 15:42:17,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 15:42:18,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911620608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:18,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:42:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-17 15:42:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446253103] [2025-03-17 15:42:18,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:18,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 15:42:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:18,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 15:42:18,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2025-03-17 15:42:18,014 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-17 15:42:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:18,316 INFO L93 Difference]: Finished difference Result 337 states and 377 transitions. [2025-03-17 15:42:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:42:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 145 [2025-03-17 15:42:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:18,317 INFO L225 Difference]: With dead ends: 337 [2025-03-17 15:42:18,318 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 15:42:18,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2025-03-17 15:42:18,319 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 107 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:18,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 436 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:42:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 15:42:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 298. [2025-03-17 15:42:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 264 states have (on average 1.0643939393939394) internal successors, (281), 270 states have internal predecessors, (281), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 15:42:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 331 transitions. [2025-03-17 15:42:18,335 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 331 transitions. Word has length 145 [2025-03-17 15:42:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:18,335 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 331 transitions. [2025-03-17 15:42:18,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-17 15:42:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 331 transitions. [2025-03-17 15:42:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 15:42:18,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:18,337 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2025-03-17 15:42:18,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 15:42:18,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:18,541 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash 486146306, now seen corresponding path program 2 times [2025-03-17 15:42:18,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:18,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420576568] [2025-03-17 15:42:18,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:42:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:18,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-03-17 15:42:18,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 15:42:18,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:42:18,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:42:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420576568] [2025-03-17 15:42:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420576568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336056483] [2025-03-17 15:42:18,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:42:18,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:18,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:18,712 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-17 15:42:18,713 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-17 15:42:18,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-03-17 15:42:18,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 15:42:18,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:42:18,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:18,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:42:18,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:42:19,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:42:19,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336056483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:19,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:42:19,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-17 15:42:19,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31631869] [2025-03-17 15:42:19,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:19,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 15:42:19,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:19,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 15:42:19,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:42:19,273 INFO L87 Difference]: Start difference. First operand 298 states and 331 transitions. Second operand has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-17 15:42:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:19,635 INFO L93 Difference]: Finished difference Result 378 states and 419 transitions. [2025-03-17 15:42:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 15:42:19,636 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 173 [2025-03-17 15:42:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:19,637 INFO L225 Difference]: With dead ends: 378 [2025-03-17 15:42:19,637 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 15:42:19,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2025-03-17 15:42:19,638 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 282 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:19,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 585 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:42:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 15:42:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 318. [2025-03-17 15:42:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 282 states have (on average 1.0602836879432624) internal successors, (299), 288 states have internal predecessors, (299), 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-17 15:42:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 353 transitions. [2025-03-17 15:42:19,659 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 353 transitions. Word has length 173 [2025-03-17 15:42:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:19,659 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 353 transitions. [2025-03-17 15:42:19,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-17 15:42:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 353 transitions. [2025-03-17 15:42:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-17 15:42:19,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:19,660 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 15:42:19,666 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-17 15:42:19,860 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,SelfDestructingSolverStorable20 [2025-03-17 15:42:19,861 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:19,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:19,861 INFO L85 PathProgramCache]: Analyzing trace with hash 460493419, now seen corresponding path program 2 times [2025-03-17 15:42:19,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:19,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273613344] [2025-03-17 15:42:19,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:42:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:19,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-03-17 15:42:19,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 15:42:19,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:42:19,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:42:19,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896342600] [2025-03-17 15:42:19,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:42:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:19,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:19,895 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-17 15:42:19,897 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-17 15:42:19,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-03-17 15:42:19,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 15:42:19,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:42:19,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:19,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:42:19,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 15:42:20,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 15:42:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:20,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273613344] [2025-03-17 15:42:20,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:42:20,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896342600] [2025-03-17 15:42:20,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896342600] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:20,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:42:20,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 15:42:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194884370] [2025-03-17 15:42:20,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:20,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:42:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:20,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:42:20,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:42:20,375 INFO L87 Difference]: Start difference. First operand 318 states and 353 transitions. Second operand has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-17 15:42:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:20,780 INFO L93 Difference]: Finished difference Result 511 states and 564 transitions. [2025-03-17 15:42:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:42:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 212 [2025-03-17 15:42:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:20,783 INFO L225 Difference]: With dead ends: 511 [2025-03-17 15:42:20,783 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 15:42:20,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:42:20,784 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 433 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:20,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 826 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:42:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 15:42:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 432. [2025-03-17 15:42:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 387 states have (on average 1.0594315245478036) internal successors, (410), 393 states have internal predecessors, (410), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 15:42:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 482 transitions. [2025-03-17 15:42:20,803 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 482 transitions. Word has length 212 [2025-03-17 15:42:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:20,804 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 482 transitions. [2025-03-17 15:42:20,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-17 15:42:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 482 transitions. [2025-03-17 15:42:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 15:42:20,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:20,805 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 15:42:20,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 15:42:21,006 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,SelfDestructingSolverStorable21 [2025-03-17 15:42:21,006 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -700388447, now seen corresponding path program 2 times [2025-03-17 15:42:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-03-17 15:42:21,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:42:21,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:21,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 219 statements into 2 equivalence classes. [2025-03-17 15:42:21,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 15:42:21,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:42:21,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:42:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836513397] [2025-03-17 15:42:21,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:42:21,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:21,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:21,029 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-17 15:42:21,031 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-17 15:42:21,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 219 statements into 2 equivalence classes. [2025-03-17 15:42:21,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 15:42:21,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:42:21,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:21,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:42:21,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 15:42:21,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 15:42:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-03-17 15:42:21,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:42:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836513397] [2025-03-17 15:42:21,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836513397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:21,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:42:21,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 15:42:21,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38001881] [2025-03-17 15:42:21,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:21,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:42:21,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:21,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:42:21,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:42:21,494 INFO L87 Difference]: Start difference. First operand 432 states and 482 transitions. Second operand has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-17 15:42:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:21,873 INFO L93 Difference]: Finished difference Result 504 states and 562 transitions. [2025-03-17 15:42:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:42:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 219 [2025-03-17 15:42:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:21,875 INFO L225 Difference]: With dead ends: 504 [2025-03-17 15:42:21,875 INFO L226 Difference]: Without dead ends: 460 [2025-03-17 15:42:21,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:42:21,876 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 383 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:21,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 882 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:42:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-17 15:42:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 424. [2025-03-17 15:42:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 379 states have (on average 1.0395778364116095) internal successors, (394), 385 states have internal predecessors, (394), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 15:42:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 466 transitions. [2025-03-17 15:42:21,900 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 466 transitions. Word has length 219 [2025-03-17 15:42:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:21,901 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 466 transitions. [2025-03-17 15:42:21,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-17 15:42:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 466 transitions. [2025-03-17 15:42:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-17 15:42:21,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:21,904 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2025-03-17 15:42:21,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 15:42:22,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:22,111 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:22,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1165801536, now seen corresponding path program 2 times [2025-03-17 15:42:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83918319] [2025-03-17 15:42:22,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:42:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:22,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 337 statements into 2 equivalence classes. [2025-03-17 15:42:22,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 337 of 337 statements. [2025-03-17 15:42:22,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:42:22,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-17 15:42:22,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:22,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83918319] [2025-03-17 15:42:22,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83918319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:22,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046524666] [2025-03-17 15:42:22,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:42:22,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:22,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:22,286 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-17 15:42:22,288 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-17 15:42:22,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 337 statements into 2 equivalence classes. [2025-03-17 15:42:22,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 337 of 337 statements. [2025-03-17 15:42:22,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:42:22,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:22,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:42:22,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-17 15:42:22,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-17 15:42:22,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046524666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:42:22,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:42:22,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 15:42:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871948996] [2025-03-17 15:42:22,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 15:42:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:22,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 15:42:22,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:42:22,847 INFO L87 Difference]: Start difference. First operand 424 states and 466 transitions. Second operand has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 13 states have internal predecessors, (107), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:42:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:22,952 INFO L93 Difference]: Finished difference Result 424 states and 466 transitions. [2025-03-17 15:42:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:42:22,953 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 13 states have internal predecessors, (107), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 337 [2025-03-17 15:42:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:22,954 INFO L225 Difference]: With dead ends: 424 [2025-03-17 15:42:22,954 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 15:42:22,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:42:22,955 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 251 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:22,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 167 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 15:42:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-17 15:42:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 379 states have (on average 1.029023746701847) internal successors, (390), 384 states have internal predecessors, (390), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 15:42:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 462 transitions. [2025-03-17 15:42:22,971 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 462 transitions. Word has length 337 [2025-03-17 15:42:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:22,971 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 462 transitions. [2025-03-17 15:42:22,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 13 states have internal predecessors, (107), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:42:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 462 transitions. [2025-03-17 15:42:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-17 15:42:22,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:22,976 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1] [2025-03-17 15:42:22,983 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-17 15:42:23,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:23,178 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:23,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash 151805942, now seen corresponding path program 3 times [2025-03-17 15:42:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612380427] [2025-03-17 15:42:23,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:42:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:23,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 365 statements into 10 equivalence classes. [2025-03-17 15:42:23,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 134 of 365 statements. [2025-03-17 15:42:23,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 15:42:23,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 51 proven. 466 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2025-03-17 15:42:23,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:23,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612380427] [2025-03-17 15:42:23,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612380427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:23,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446330740] [2025-03-17 15:42:23,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:42:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:23,354 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-17 15:42:23,355 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-17 15:42:23,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 365 statements into 10 equivalence classes. [2025-03-17 15:42:23,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 49 of 365 statements. [2025-03-17 15:42:23,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 15:42:23,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:23,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:42:23,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 126 proven. 176 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2025-03-17 15:42:23,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:40,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446330740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:40,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:42:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-17 15:42:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141282132] [2025-03-17 15:42:40,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:40,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:42:40,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:40,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:42:40,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:42:40,894 INFO L87 Difference]: Start difference. First operand 423 states and 462 transitions. Second operand has 16 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-17 15:42:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:41,354 INFO L93 Difference]: Finished difference Result 423 states and 462 transitions. [2025-03-17 15:42:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:42:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 365 [2025-03-17 15:42:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:41,356 INFO L225 Difference]: With dead ends: 423 [2025-03-17 15:42:41,356 INFO L226 Difference]: Without dead ends: 405 [2025-03-17 15:42:41,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:42:41,357 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 395 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:41,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 145 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:42:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-17 15:42:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-03-17 15:42:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 365 states have (on average 1.010958904109589) internal successors, (369), 368 states have internal predecessors, (369), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 15:42:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 437 transitions. [2025-03-17 15:42:41,380 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 437 transitions. Word has length 365 [2025-03-17 15:42:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:41,380 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 437 transitions. [2025-03-17 15:42:41,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 9.0) internal successors, (135), 16 states have internal predecessors, (135), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-17 15:42:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 437 transitions. [2025-03-17 15:42:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 15:42:41,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:41,383 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-03-17 15:42:41,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 15:42:41,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 15:42:41,583 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:41,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash -353953731, now seen corresponding path program 3 times [2025-03-17 15:42:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:41,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108904322] [2025-03-17 15:42:41,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:42:41,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:41,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 500 statements into 15 equivalence classes. [2025-03-17 15:42:41,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 15:42:41,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-17 15:42:41,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:42:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988825678] [2025-03-17 15:42:41,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:42:41,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:41,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:41,730 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-17 15:42:41,732 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-17 15:42:41,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 500 statements into 15 equivalence classes. [2025-03-17 15:42:41,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 77 of 500 statements. [2025-03-17 15:42:41,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 15:42:41,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:41,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:42:41,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2025-03-17 15:42:41,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:42:41,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108904322] [2025-03-17 15:42:41,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:42:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988825678] [2025-03-17 15:42:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988825678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:42:41,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:42:41,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:42:41,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627270561] [2025-03-17 15:42:41,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:42:41,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:42:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:41,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:42:41,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:42:41,958 INFO L87 Difference]: Start difference. First operand 405 states and 437 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:42:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:42,308 INFO L93 Difference]: Finished difference Result 407 states and 439 transitions. [2025-03-17 15:42:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:42:42,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 500 [2025-03-17 15:42:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:42,310 INFO L225 Difference]: With dead ends: 407 [2025-03-17 15:42:42,310 INFO L226 Difference]: Without dead ends: 405 [2025-03-17 15:42:42,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:42:42,311 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 113 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:42,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 80 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:42:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-17 15:42:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 403. [2025-03-17 15:42:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 365 states have (on average 1.0054794520547945) internal successors, (367), 366 states have internal predecessors, (367), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 15:42:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 435 transitions. [2025-03-17 15:42:42,342 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 435 transitions. Word has length 500 [2025-03-17 15:42:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:42,343 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 435 transitions. [2025-03-17 15:42:42,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:42:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 435 transitions. [2025-03-17 15:42:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-17 15:42:42,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:42:42,346 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-03-17 15:42:42,352 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-17 15:42:42,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 15:42:42,547 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-17 15:42:42,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:42:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1353476721, now seen corresponding path program 3 times [2025-03-17 15:42:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:42:42,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648841816] [2025-03-17 15:42:42,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:42:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:42:42,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 507 statements into 15 equivalence classes. [2025-03-17 15:42:42,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 507 of 507 statements. [2025-03-17 15:42:42,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-17 15:42:42,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:42:42,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307550233] [2025-03-17 15:42:42,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:42:42,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:42:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:42:42,660 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-17 15:42:42,662 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-17 15:42:42,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 507 statements into 15 equivalence classes. [2025-03-17 15:42:42,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 507 statements. [2025-03-17 15:42:42,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 15:42:42,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:42:42,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:42:42,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:42:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 180 proven. 234 refuted. 0 times theorem prover too weak. 3370 trivial. 0 not checked. [2025-03-17 15:42:43,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:42:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:42:44,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648841816] [2025-03-17 15:42:44,829 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:42:44,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307550233] [2025-03-17 15:42:44,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307550233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:42:44,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:42:44,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-17 15:42:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289943326] [2025-03-17 15:42:44,829 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:42:44,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:42:44,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:42:44,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:42:44,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:42:44,830 INFO L87 Difference]: Start difference. First operand 403 states and 435 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 15:42:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:42:45,073 INFO L93 Difference]: Finished difference Result 405 states and 437 transitions. [2025-03-17 15:42:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:42:45,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 507 [2025-03-17 15:42:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:42:45,074 INFO L225 Difference]: With dead ends: 405 [2025-03-17 15:42:45,074 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:42:45,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:42:45,075 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 131 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:42:45,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 98 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:42:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:42:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:42:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:42:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:42:45,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 507 [2025-03-17 15:42:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:42:45,075 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:42:45,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 15:42:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:42:45,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:42:45,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2025-03-17 15:42:45,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-03-17 15:42:45,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-03-17 15:42:45,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-03-17 15:42:45,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-03-17 15:42:45,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-03-17 15:42:45,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-03-17 15:42:45,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-03-17 15:42:45,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-03-17 15:42:45,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-03-17 15:42:45,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-03-17 15:42:45,088 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-17 15:42:45,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 15:42:45,288 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:42:45,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:42:52,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:42:52,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:42:52 BoogieIcfgContainer [2025-03-17 15:42:52,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:42:52,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:42:52,347 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:42:52,347 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:42:52,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:42:06" (3/4) ... [2025-03-17 15:42:52,349 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:42:52,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:42:52,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:42:52,359 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:42:52,359 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:42:52,359 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:42:52,425 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:42:52,426 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:42:52,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:42:52,427 INFO L158 Benchmark]: Toolchain (without parser) took 46658.29ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 113.8MB in the beginning and 222.7MB in the end (delta: -109.0MB). Peak memory consumption was 178.5MB. Max. memory is 16.1GB. [2025-03-17 15:42:52,427 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:42:52,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.20ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 102.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:42:52,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.04ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:42:52,428 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:42:52,428 INFO L158 Benchmark]: IcfgBuilder took 369.04ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 81.0MB in the end (delta: 18.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 15:42:52,428 INFO L158 Benchmark]: TraceAbstraction took 45965.77ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 80.5MB in the beginning and 226.8MB in the end (delta: -146.4MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. [2025-03-17 15:42:52,428 INFO L158 Benchmark]: Witness Printer took 79.43ms. Allocated memory is still 436.2MB. Free memory was 226.8MB in the beginning and 222.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:42:52,430 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.34ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.20ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 102.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.04ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 369.04ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 81.0MB in the end (delta: 18.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 45965.77ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 80.5MB in the beginning and 226.8MB in the end (delta: -146.4MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. * Witness Printer took 79.43ms. Allocated memory is still 436.2MB. Free memory was 226.8MB in the beginning and 222.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 135 edges, 52 error locations. Started 1 CEGAR loops. OverallTime: 38.9s, OverallIterations: 27, TraceHistogramMax: 32, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3745 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3672 mSDsluCounter, 7394 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5203 mSDsCounter, 490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4552 IncrementalHoareTripleChecker+Invalid, 5043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 490 mSolverCounterUnsat, 2191 mSDtfsCounter, 4552 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4655 GetRequests, 4423 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=22, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 674 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 6312 NumberOfCodeBlocks, 4882 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 6074 ConstructedInterpolants, 4 QuantifiedInterpolants, 22087 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3172 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 47 InterpolantComputations, 15 PerfectInterpolantSequences, 18009/21249 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 52 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((((((((0 <= (counter + 2147483648)) && (n <= 2147483647)) && (counter <= 50)) && (3 <= t)) && (a <= 4611686018427387903)) && (0 <= a)) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1))) || (((((n <= 2147483647) && (t == 1)) && (counter == 0)) && (a == 0)) && (s == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:42:52,458 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 Result: TRUE