./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/hard2-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-nla/hard2-both-nt.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 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:37:45,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:37:46,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:37:46,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:37:46,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:37:46,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:37:46,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:37:46,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:37:46,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:37:46,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:37:46,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:37:46,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:37:46,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:37:46,066 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:37:46,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:37:46,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:37:46,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:37:46,067 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 -> 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 [2025-03-04 10:37:46,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:37:46,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:37:46,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:37:46,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:37:46,299 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:37:46,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/hard2-both-nt.c [2025-03-04 10:37:47,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752f0f4c1/f2a8f1f050874c3d81a5b930e52c0e00/FLAG4169ed954 [2025-03-04 10:37:47,630 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:37:47,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/hard2-both-nt.c [2025-03-04 10:37:47,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752f0f4c1/f2a8f1f050874c3d81a5b930e52c0e00/FLAG4169ed954 [2025-03-04 10:37:47,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752f0f4c1/f2a8f1f050874c3d81a5b930e52c0e00 [2025-03-04 10:37:47,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:37:47,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:37:47,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:37:47,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:37:47,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:37:47,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54503126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47, skipping insertion in model container [2025-03-04 10:37:47,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:37:47,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:37:47,794 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:37:47,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:37:47,816 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:37:47,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47 WrapperNode [2025-03-04 10:37:47,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:37:47,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:37:47,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:37:47,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:37:47,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,836 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2025-03-04 10:37:47,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:37:47,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:37:47,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:37:47,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:37:47,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,852 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:37:47,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:37:47,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:37:47,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:37:47,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:37:47,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (1/1) ... [2025-03-04 10:37:47,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:37:47,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:47,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:37:47,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:37:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:37:47,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:37:47,941 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:37:47,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:37:48,077 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-04 10:37:48,078 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:37:48,088 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:37:48,088 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:37:48,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:37:48 BoogieIcfgContainer [2025-03-04 10:37:48,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:37:48,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:37:48,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:37:48,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:37:48,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:37:47" (1/3) ... [2025-03-04 10:37:48,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8319c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:37:48, skipping insertion in model container [2025-03-04 10:37:48,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:47" (2/3) ... [2025-03-04 10:37:48,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8319c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:37:48, skipping insertion in model container [2025-03-04 10:37:48,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:37:48" (3/3) ... [2025-03-04 10:37:48,097 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2-both-nt.c [2025-03-04 10:37:48,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:37:48,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2-both-nt.c that has 1 procedures, 45 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-04 10:37:48,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:37:48,157 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;@35e4ef25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:37:48,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 10:37:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 44 states have internal predecessors, (49), 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-04 10:37:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 10:37:48,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:48,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 10:37:48,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:48,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 77421, now seen corresponding path program 1 times [2025-03-04 10:37:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:48,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89777013] [2025-03-04 10:37:48,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:48,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:37:48,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:37:48,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:48,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:48,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036756051] [2025-03-04 10:37:48,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:48,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:48,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:48,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:48,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:37:48,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:37:48,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:37:48,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:48,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:48,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:37:48,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:48,330 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-04 10:37:48,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:48,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:48,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89777013] [2025-03-04 10:37:48,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:48,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036756051] [2025-03-04 10:37:48,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036756051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809255098] [2025-03-04 10:37:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:48,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:48,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:48,353 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) 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-04 10:37:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:48,456 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2025-03-04 10:37:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:48,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) 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-04 10:37:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:48,464 INFO L225 Difference]: With dead ends: 99 [2025-03-04 10:37:48,464 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 10:37:48,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:48,468 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:48,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 10:37:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-03-04 10:37:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 56 states have internal predecessors, (68), 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-04 10:37:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-03-04 10:37:48,493 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 3 [2025-03-04 10:37:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:48,493 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-03-04 10:37:48,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) 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-04 10:37:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-03-04 10:37:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:37:48,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:48,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:37:48,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:37:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 10:37:48,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1988506444, now seen corresponding path program 1 times [2025-03-04 10:37:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:48,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017522369] [2025-03-04 10:37:48,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:48,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:37:48,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:37:48,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:48,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:48,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721090938] [2025-03-04 10:37:48,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:48,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:48,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:48,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:48,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:37:48,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:37:48,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:37:48,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:48,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:48,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:37:48,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:48,747 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-04 10:37:48,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017522369] [2025-03-04 10:37:48,747 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721090938] [2025-03-04 10:37:48,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721090938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:48,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:48,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:48,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620999149] [2025-03-04 10:37:48,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:48,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:48,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:48,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:48,748 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:48,783 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2025-03-04 10:37:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:37:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:48,784 INFO L225 Difference]: With dead ends: 79 [2025-03-04 10:37:48,784 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 10:37:48,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:48,785 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:48,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 47 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 10:37:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-03-04 10:37:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.6938775510204083) internal successors, (83), 66 states have internal predecessors, (83), 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-04 10:37:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2025-03-04 10:37:48,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 6 [2025-03-04 10:37:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:48,791 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2025-03-04 10:37:48,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2025-03-04 10:37:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:37:48,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:48,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:37:48,797 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-04 10:37:48,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 10:37:48,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:48,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1988506404, now seen corresponding path program 1 times [2025-03-04 10:37:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:48,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061732757] [2025-03-04 10:37:48,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:48,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:48,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:37:49,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:37:49,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:49,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:49,037 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-04 10:37:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:49,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061732757] [2025-03-04 10:37:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061732757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027604729] [2025-03-04 10:37:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:49,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:49,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:49,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:49,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:49,042 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:49,084 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-03-04 10:37:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:49,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:37:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:49,085 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:37:49,085 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 10:37:49,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:49,085 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:49,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 10:37:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-04 10:37:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 66 states have internal predecessors, (79), 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-04 10:37:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-03-04 10:37:49,095 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 6 [2025-03-04 10:37:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:49,096 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-03-04 10:37:49,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-03-04 10:37:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:37:49,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:49,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:49,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:37:49,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:49,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:49,097 INFO L85 PathProgramCache]: Analyzing trace with hash 305753938, now seen corresponding path program 1 times [2025-03-04 10:37:49,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:49,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697323247] [2025-03-04 10:37:49,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:49,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:37:49,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:37:49,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:49,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:49,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064167150] [2025-03-04 10:37:49,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:49,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:49,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:37:49,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:37:49,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:37:49,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:49,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:49,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:37:49,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:49,193 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-04 10:37:49,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697323247] [2025-03-04 10:37:49,193 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064167150] [2025-03-04 10:37:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064167150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:49,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:49,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:49,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537396849] [2025-03-04 10:37:49,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:49,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:49,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:49,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:49,195 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:49,240 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2025-03-04 10:37:49,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:37:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:49,241 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:37:49,241 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 10:37:49,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:49,242 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:49,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 40 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 10:37:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-03-04 10:37:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 66 states have internal predecessors, (77), 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-04 10:37:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-03-04 10:37:49,248 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 8 [2025-03-04 10:37:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:49,248 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-03-04 10:37:49,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-03-04 10:37:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:37:49,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:49,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:49,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:37:49,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:49,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:49,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash 888437479, now seen corresponding path program 1 times [2025-03-04 10:37:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:49,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867076502] [2025-03-04 10:37:49,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:49,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:37:49,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:37:49,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:49,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:49,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50400941] [2025-03-04 10:37:49,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:49,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:49,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:49,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:49,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:37:49,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:37:49,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:37:49,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:49,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:49,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:37:49,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:49,523 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-04 10:37:49,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867076502] [2025-03-04 10:37:49,523 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50400941] [2025-03-04 10:37:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50400941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:49,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:49,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264717988] [2025-03-04 10:37:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:49,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:49,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:49,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:49,525 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:49,565 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-03-04 10:37:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:37:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:49,566 INFO L225 Difference]: With dead ends: 76 [2025-03-04 10:37:49,566 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 10:37:49,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:49,567 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:49,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 10:37:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-03-04 10:37:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.530612244897959) internal successors, (75), 66 states have internal predecessors, (75), 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-04 10:37:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2025-03-04 10:37:49,579 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 9 [2025-03-04 10:37:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:49,580 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-03-04 10:37:49,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,580 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2025-03-04 10:37:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:37:49,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:49,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:49,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:37:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:49,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1808975974, now seen corresponding path program 1 times [2025-03-04 10:37:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141690681] [2025-03-04 10:37:49,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:37:49,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:37:49,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:49,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2105019110] [2025-03-04 10:37:49,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:49,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:49,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:49,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:37:49,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:37:49,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:37:49,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:49,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:49,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:37:49,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:49,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:49,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141690681] [2025-03-04 10:37:49,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105019110] [2025-03-04 10:37:49,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105019110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:49,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:49,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:37:49,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139417117] [2025-03-04 10:37:49,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:49,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:37:49,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:49,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:37:49,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:49,876 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:49,971 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2025-03-04 10:37:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:37:49,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:37:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:49,972 INFO L225 Difference]: With dead ends: 106 [2025-03-04 10:37:49,972 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 10:37:49,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:49,973 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:49,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 67 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 10:37:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2025-03-04 10:37:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 94 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2025-03-04 10:37:49,979 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 10 [2025-03-04 10:37:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:49,979 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2025-03-04 10:37:49,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2025-03-04 10:37:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:37:49,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:49,980 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:49,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:37:50,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:50,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:50,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash 243680358, now seen corresponding path program 1 times [2025-03-04 10:37:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:50,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153195936] [2025-03-04 10:37:50,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:50,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:50,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:37:50,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:37:50,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:50,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:50,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282175910] [2025-03-04 10:37:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:50,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:50,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:50,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:50,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:37:50,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:37:50,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:37:50,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:50,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:50,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:37:50,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:50,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:37:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:50,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153195936] [2025-03-04 10:37:50,401 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282175910] [2025-03-04 10:37:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282175910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:37:50,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:37:50,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 10:37:50,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030471235] [2025-03-04 10:37:50,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:37:50,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:37:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:50,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:37:50,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:37:50,403 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-04 10:37:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:50,565 INFO L93 Difference]: Finished difference Result 238 states and 322 transitions. [2025-03-04 10:37:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:37:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:37:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:50,566 INFO L225 Difference]: With dead ends: 238 [2025-03-04 10:37:50,567 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 10:37:50,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:37:50,567 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 131 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:50,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 63 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 10:37:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 163. [2025-03-04 10:37:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 147 states have (on average 1.530612244897959) internal successors, (225), 162 states have internal predecessors, (225), 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-04 10:37:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 225 transitions. [2025-03-04 10:37:50,582 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 225 transitions. Word has length 11 [2025-03-04 10:37:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:50,583 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 225 transitions. [2025-03-04 10:37:50,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-04 10:37:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 225 transitions. [2025-03-04 10:37:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:37:50,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:50,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:50,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:37:50,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:50,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:50,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2046376893, now seen corresponding path program 1 times [2025-03-04 10:37:50,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:50,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220802182] [2025-03-04 10:37:50,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:50,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:50,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:37:50,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:37:50,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:50,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220802182] [2025-03-04 10:37:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220802182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:37:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036106820] [2025-03-04 10:37:50,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:50,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:50,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:50,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:50,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:37:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:37:50,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:37:50,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:50,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:50,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:37:50,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:50,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036106820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:37:50,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:37:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678863732] [2025-03-04 10:37:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:50,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:37:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:50,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:37:50,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:37:50,899 INFO L87 Difference]: Start difference. First operand 163 states and 225 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-04 10:37:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:50,965 INFO L93 Difference]: Finished difference Result 171 states and 225 transitions. [2025-03-04 10:37:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:37:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 10:37:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:50,967 INFO L225 Difference]: With dead ends: 171 [2025-03-04 10:37:50,967 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 10:37:50,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-04 10:37:50,967 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 34 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:50,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 85 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 10:37:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2025-03-04 10:37:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 147 states have (on average 1.469387755102041) internal successors, (216), 161 states have internal predecessors, (216), 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-04 10:37:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2025-03-04 10:37:50,978 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 13 [2025-03-04 10:37:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:50,978 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2025-03-04 10:37:50,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-04 10:37:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2025-03-04 10:37:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:37:50,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:50,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:51,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:37:51,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:51,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:51,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash 986825763, now seen corresponding path program 1 times [2025-03-04 10:37:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:51,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755452150] [2025-03-04 10:37:51,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:51,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:37:51,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:37:51,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:51,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:51,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755452150] [2025-03-04 10:37:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755452150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:37:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122042866] [2025-03-04 10:37:51,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:51,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:51,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:51,219 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:51,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:37:51,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:37:51,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:37:51,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:51,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:51,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:37:51,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:51,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:37:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122042866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:37:51,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:37:51,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:37:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274501129] [2025-03-04 10:37:51,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:37:51,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:37:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:51,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:37:51,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:37:51,282 INFO L87 Difference]: Start difference. First operand 162 states and 216 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:51,352 INFO L93 Difference]: Finished difference Result 244 states and 314 transitions. [2025-03-04 10:37:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:37:51,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 10:37:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:51,353 INFO L225 Difference]: With dead ends: 244 [2025-03-04 10:37:51,353 INFO L226 Difference]: Without dead ends: 242 [2025-03-04 10:37:51,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:37:51,354 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 120 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:51,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 110 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-04 10:37:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 212. [2025-03-04 10:37:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 197 states have (on average 1.4517766497461928) internal successors, (286), 211 states have internal predecessors, (286), 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-04 10:37:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 286 transitions. [2025-03-04 10:37:51,384 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 286 transitions. Word has length 14 [2025-03-04 10:37:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:51,384 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 286 transitions. [2025-03-04 10:37:51,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 286 transitions. [2025-03-04 10:37:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:37:51,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:51,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:51,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:37:51,585 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,SelfDestructingSolverStorable8 [2025-03-04 10:37:51,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:51,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1634227467, now seen corresponding path program 1 times [2025-03-04 10:37:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:51,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004983319] [2025-03-04 10:37:51,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:51,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:37:51,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:37:51,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:51,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:51,626 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-04 10:37:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:51,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004983319] [2025-03-04 10:37:51,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004983319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:51,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:51,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185530107] [2025-03-04 10:37:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:51,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:51,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:51,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:51,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:51,627 INFO L87 Difference]: Start difference. First operand 212 states and 286 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:51,652 INFO L93 Difference]: Finished difference Result 212 states and 286 transitions. [2025-03-04 10:37:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-03-04 10:37:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:51,655 INFO L225 Difference]: With dead ends: 212 [2025-03-04 10:37:51,655 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 10:37:51,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:51,655 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:51,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 10:37:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-04 10:37:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 210 states have internal predecessors, (280), 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-04 10:37:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2025-03-04 10:37:51,665 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 16 [2025-03-04 10:37:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:51,666 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2025-03-04 10:37:51,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-04 10:37:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2025-03-04 10:37:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:37:51,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:51,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:51,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:37:51,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:51,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash -878556098, now seen corresponding path program 1 times [2025-03-04 10:37:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:51,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50986046] [2025-03-04 10:37:51,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:51,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:37:51,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:37:51,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:51,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:51,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:51,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50986046] [2025-03-04 10:37:51,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50986046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:51,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:51,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:37:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667144019] [2025-03-04 10:37:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:51,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:37:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:51,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:37:51,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:51,766 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:51,841 INFO L93 Difference]: Finished difference Result 247 states and 331 transitions. [2025-03-04 10:37:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:37:51,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 10:37:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:51,843 INFO L225 Difference]: With dead ends: 247 [2025-03-04 10:37:51,843 INFO L226 Difference]: Without dead ends: 246 [2025-03-04 10:37:51,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:51,846 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:51,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 67 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-04 10:37:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 223. [2025-03-04 10:37:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 209 states have (on average 1.4019138755980862) internal successors, (293), 222 states have internal predecessors, (293), 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-04 10:37:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 293 transitions. [2025-03-04 10:37:51,856 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 293 transitions. Word has length 17 [2025-03-04 10:37:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:51,856 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 293 transitions. [2025-03-04 10:37:51,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 293 transitions. [2025-03-04 10:37:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:37:51,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:51,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:51,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:37:51,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:51,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1465435287, now seen corresponding path program 1 times [2025-03-04 10:37:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032330076] [2025-03-04 10:37:51,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:37:51,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:37:51,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:51,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:51,974 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-04 10:37:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032330076] [2025-03-04 10:37:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032330076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:51,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:37:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074195172] [2025-03-04 10:37:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:51,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:37:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:51,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:37:51,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:37:51,975 INFO L87 Difference]: Start difference. First operand 223 states and 293 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:52,086 INFO L93 Difference]: Finished difference Result 237 states and 308 transitions. [2025-03-04 10:37:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:37:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-03-04 10:37:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:52,087 INFO L225 Difference]: With dead ends: 237 [2025-03-04 10:37:52,087 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 10:37:52,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:37:52,088 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:52,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 10:37:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2025-03-04 10:37:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 210 states have (on average 1.3952380952380952) internal successors, (293), 223 states have internal predecessors, (293), 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-04 10:37:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 293 transitions. [2025-03-04 10:37:52,101 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 293 transitions. Word has length 18 [2025-03-04 10:37:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:52,103 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 293 transitions. [2025-03-04 10:37:52,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-04 10:37:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 293 transitions. [2025-03-04 10:37:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:37:52,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:52,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:52,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:37:52,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:52,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1816146332, now seen corresponding path program 1 times [2025-03-04 10:37:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322358207] [2025-03-04 10:37:52,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:52,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:37:52,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:37:52,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:52,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:52,219 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-04 10:37:52,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322358207] [2025-03-04 10:37:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322358207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:52,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:37:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49613036] [2025-03-04 10:37:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:52,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:37:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:52,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:37:52,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:37:52,220 INFO L87 Difference]: Start difference. First operand 224 states and 293 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:52,332 INFO L93 Difference]: Finished difference Result 237 states and 306 transitions. [2025-03-04 10:37:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:37:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-03-04 10:37:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:52,334 INFO L225 Difference]: With dead ends: 237 [2025-03-04 10:37:52,334 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 10:37:52,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:37:52,335 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:52,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 60 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 10:37:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2025-03-04 10:37:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 211 states have (on average 1.3886255924170616) internal successors, (293), 224 states have internal predecessors, (293), 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-04 10:37:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 293 transitions. [2025-03-04 10:37:52,344 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 293 transitions. Word has length 19 [2025-03-04 10:37:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:52,344 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 293 transitions. [2025-03-04 10:37:52,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-04 10:37:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 293 transitions. [2025-03-04 10:37:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:37:52,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:52,346 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-04 10:37:52,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:37:52,346 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:52,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:52,346 INFO L85 PathProgramCache]: Analyzing trace with hash 465961443, now seen corresponding path program 1 times [2025-03-04 10:37:52,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:52,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753034121] [2025-03-04 10:37:52,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:52,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:52,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:37:52,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:37:52,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:52,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:52,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980085980] [2025-03-04 10:37:52,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:52,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:52,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:52,358 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:52,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:37:52,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:37:52,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:37:52,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:52,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:52,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:37:52,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:52,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:37:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:57,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753034121] [2025-03-04 10:37:57,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980085980] [2025-03-04 10:37:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980085980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:37:57,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:37:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:37:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531617901] [2025-03-04 10:37:57,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:37:57,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:37:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:57,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:37:57,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=55, Unknown=1, NotChecked=0, Total=90 [2025-03-04 10:37:57,297 INFO L87 Difference]: Start difference. First operand 225 states and 293 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:57,408 INFO L93 Difference]: Finished difference Result 243 states and 314 transitions. [2025-03-04 10:37:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:37:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 10:37:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:57,409 INFO L225 Difference]: With dead ends: 243 [2025-03-04 10:37:57,409 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 10:37:57,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=41, Invalid=68, Unknown=1, NotChecked=0, Total=110 [2025-03-04 10:37:57,410 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 154 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:57,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 49 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 10:37:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 227. [2025-03-04 10:37:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 214 states have (on average 1.341121495327103) internal successors, (287), 226 states have internal predecessors, (287), 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-04 10:37:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 287 transitions. [2025-03-04 10:37:57,421 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 287 transitions. Word has length 20 [2025-03-04 10:37:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:57,421 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 287 transitions. [2025-03-04 10:37:57,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 287 transitions. [2025-03-04 10:37:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:37:57,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:57,423 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:57,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:37:57,623 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,SelfDestructingSolverStorable13 [2025-03-04 10:37:57,623 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:57,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1559902842, now seen corresponding path program 1 times [2025-03-04 10:37:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076514387] [2025-03-04 10:37:57,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:57,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:37:57,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:37:57,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:57,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:57,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005245457] [2025-03-04 10:37:57,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:57,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:57,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:57,635 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:57,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:37:57,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:37:57,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:37:57,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:57,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:57,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:37:57,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:57,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:37:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076514387] [2025-03-04 10:37:58,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005245457] [2025-03-04 10:37:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005245457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:37:58,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:37:58,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 10:37:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559944551] [2025-03-04 10:37:58,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:37:58,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:37:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:58,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:37:58,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:37:58,285 INFO L87 Difference]: Start difference. First operand 227 states and 287 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-04 10:37:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:58,386 INFO L93 Difference]: Finished difference Result 235 states and 293 transitions. [2025-03-04 10:37:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:37:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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 21 [2025-03-04 10:37:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:58,387 INFO L225 Difference]: With dead ends: 235 [2025-03-04 10:37:58,387 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 10:37:58,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:37:58,388 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 61 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:58,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 42 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 10:37:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 226. [2025-03-04 10:37:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 225 states have internal predecessors, (275), 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-04 10:37:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 275 transitions. [2025-03-04 10:37:58,398 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 275 transitions. Word has length 21 [2025-03-04 10:37:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:58,399 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 275 transitions. [2025-03-04 10:37:58,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-04 10:37:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 275 transitions. [2025-03-04 10:37:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:37:58,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:58,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:58,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:37:58,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:37:58,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:58,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1255892518, now seen corresponding path program 1 times [2025-03-04 10:37:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:58,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797642837] [2025-03-04 10:37:58,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:58,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:37:58,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:37:58,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:58,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:58,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797642837] [2025-03-04 10:37:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797642837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:37:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426411078] [2025-03-04 10:37:58,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:58,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:58,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:58,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:58,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:37:58,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:37:58,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:37:58,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:58,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:58,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:37:58,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:37:58,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426411078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:37:58,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-04 10:37:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419919629] [2025-03-04 10:37:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:58,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:37:58,708 INFO L87 Difference]: Start difference. First operand 226 states and 275 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:58,748 INFO L93 Difference]: Finished difference Result 261 states and 314 transitions. [2025-03-04 10:37:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:58,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 10:37:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:58,749 INFO L225 Difference]: With dead ends: 261 [2025-03-04 10:37:58,749 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 10:37:58,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:37:58,750 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:58,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 10:37:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 10:37:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 203 states have (on average 1.2857142857142858) internal successors, (261), 213 states have internal predecessors, (261), 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-04 10:37:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 261 transitions. [2025-03-04 10:37:58,758 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 261 transitions. Word has length 21 [2025-03-04 10:37:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:58,758 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 261 transitions. [2025-03-04 10:37:58,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 261 transitions. [2025-03-04 10:37:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:37:58,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:58,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-04 10:37:58,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:37:58,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:37:58,962 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:58,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash 460941960, now seen corresponding path program 1 times [2025-03-04 10:37:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:58,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946833642] [2025-03-04 10:37:58,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:58,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:58,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:37:58,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:37:58,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:58,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:59,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946833642] [2025-03-04 10:37:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946833642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:37:59,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817357423] [2025-03-04 10:37:59,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:59,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:59,010 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:59,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:37:59,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:37:59,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:37:59,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:37:59,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:37:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817357423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:37:59,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:37:59,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-03-04 10:37:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550746719] [2025-03-04 10:37:59,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:37:59,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:37:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:59,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:37:59,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:37:59,096 INFO L87 Difference]: Start difference. First operand 214 states and 261 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 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-04 10:37:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:59,207 INFO L93 Difference]: Finished difference Result 399 states and 477 transitions. [2025-03-04 10:37:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:37:59,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 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 23 [2025-03-04 10:37:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:59,209 INFO L225 Difference]: With dead ends: 399 [2025-03-04 10:37:59,209 INFO L226 Difference]: Without dead ends: 397 [2025-03-04 10:37:59,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:37:59,210 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 143 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:59,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 146 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-04 10:37:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 230. [2025-03-04 10:37:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 219 states have (on average 1.2922374429223744) internal successors, (283), 229 states have internal predecessors, (283), 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-04 10:37:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 283 transitions. [2025-03-04 10:37:59,220 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 283 transitions. Word has length 23 [2025-03-04 10:37:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:59,220 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 283 transitions. [2025-03-04 10:37:59,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 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-04 10:37:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 283 transitions. [2025-03-04 10:37:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:37:59,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:59,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:59,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:37:59,423 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,SelfDestructingSolverStorable16 [2025-03-04 10:37:59,423 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:59,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1050574455, now seen corresponding path program 1 times [2025-03-04 10:37:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:59,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887154038] [2025-03-04 10:37:59,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:59,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:37:59,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:37:59,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:59,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887154038] [2025-03-04 10:37:59,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887154038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:37:59,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542372225] [2025-03-04 10:37:59,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:59,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:59,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:59,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:37:59,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:37:59,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:37:59,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:37:59,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:37:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:37:59,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542372225] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:37:59,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:37:59,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 10 [2025-03-04 10:37:59,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520154824] [2025-03-04 10:37:59,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:59,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:37:59,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:59,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:37:59,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:37:59,625 INFO L87 Difference]: Start difference. First operand 230 states and 283 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-04 10:37:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:59,654 INFO L93 Difference]: Finished difference Result 230 states and 283 transitions. [2025-03-04 10:37:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:37:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 24 [2025-03-04 10:37:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:59,655 INFO L225 Difference]: With dead ends: 230 [2025-03-04 10:37:59,655 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 10:37:59,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:37:59,656 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:59,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 10:37:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 10:37:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 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-04 10:37:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2025-03-04 10:37:59,660 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2025-03-04 10:37:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:59,660 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2025-03-04 10:37:59,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-04 10:37:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2025-03-04 10:37:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:37:59,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:59,661 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2025-03-04 10:37:59,667 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-04 10:37:59,861 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,SelfDestructingSolverStorable17 [2025-03-04 10:37:59,862 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:37:59,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1930769002, now seen corresponding path program 2 times [2025-03-04 10:37:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:59,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392775423] [2025-03-04 10:37:59,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:37:59,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:59,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:37:59,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:37:59,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:37:59,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:59,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392775423] [2025-03-04 10:37:59,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392775423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:37:59,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955352494] [2025-03-04 10:37:59,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:37:59,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:59,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:59,920 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:59,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:37:59,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:37:59,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:37:59,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:37:59,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:37:59,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955352494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:00,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:38:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373264681] [2025-03-04 10:38:00,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:38:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:00,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:38:00,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:38:00,050 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 states have internal predecessors, (75), 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-04 10:38:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:00,094 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2025-03-04 10:38:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:38:00,094 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 states have internal predecessors, (75), 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 35 [2025-03-04 10:38:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:00,096 INFO L225 Difference]: With dead ends: 83 [2025-03-04 10:38:00,096 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 10:38:00,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:38:00,096 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:00,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 10:38:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2025-03-04 10:38:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 78 states have internal predecessors, (82), 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-04 10:38:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-04 10:38:00,101 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 35 [2025-03-04 10:38:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:00,102 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-04 10:38:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.25) internal successors, (75), 13 states have internal predecessors, (75), 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-04 10:38:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-04 10:38:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:38:00,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:00,103 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-04 10:38:00,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:38:00,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:00,303 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:38:00,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash -821080504, now seen corresponding path program 2 times [2025-03-04 10:38:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:00,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915800183] [2025-03-04 10:38:00,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:38:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:00,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:38:00,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:38:00,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:38:00,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:00,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915800183] [2025-03-04 10:38:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915800183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708528492] [2025-03-04 10:38:00,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:38:00,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:00,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:00,414 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:00,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:38:00,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:38:00,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 51 statements. [2025-03-04 10:38:00,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:38:00,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:00,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:38:00,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-04 10:38:00,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-04 10:38:00,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708528492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:00,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:00,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 14 [2025-03-04 10:38:00,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683436764] [2025-03-04 10:38:00,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:00,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:38:00,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:00,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:38:00,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:38:00,693 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 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-04 10:38:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:00,893 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-03-04 10:38:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:38:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 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 51 [2025-03-04 10:38:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:00,894 INFO L225 Difference]: With dead ends: 79 [2025-03-04 10:38:00,894 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 10:38:00,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=641, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:38:00,894 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:00,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 10:38:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-04 10:38:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 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-04 10:38:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2025-03-04 10:38:00,898 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 51 [2025-03-04 10:38:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:00,898 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2025-03-04 10:38:00,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 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-04 10:38:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2025-03-04 10:38:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:38:00,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:00,899 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1] [2025-03-04 10:38:00,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:01,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:01,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:38:01,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1086788598, now seen corresponding path program 3 times [2025-03-04 10:38:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:01,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463681365] [2025-03-04 10:38:01,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:38:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:01,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 11 equivalence classes. [2025-03-04 10:38:01,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:38:01,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:38:01,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:01,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463681365] [2025-03-04 10:38:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463681365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597568725] [2025-03-04 10:38:01,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:38:01,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:01,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:01,252 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:01,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:38:01,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 11 equivalence classes. [2025-03-04 10:38:01,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:38:01,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:38:01,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:01,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:38:01,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:01,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:01,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597568725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:01,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:01,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-04 10:38:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887741333] [2025-03-04 10:38:01,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:01,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:38:01,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:01,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:38:01,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:38:01,565 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand has 25 states, 24 states have (on average 6.625) internal successors, (159), 25 states have internal predecessors, (159), 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-04 10:38:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:01,656 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2025-03-04 10:38:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:38:01,657 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.625) internal successors, (159), 25 states have internal predecessors, (159), 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 77 [2025-03-04 10:38:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:01,658 INFO L225 Difference]: With dead ends: 163 [2025-03-04 10:38:01,658 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 10:38:01,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:38:01,658 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:01,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 101 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 10:38:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 10:38:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.0062111801242235) internal successors, (162), 161 states have internal predecessors, (162), 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-04 10:38:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2025-03-04 10:38:01,666 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 77 [2025-03-04 10:38:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:01,666 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2025-03-04 10:38:01,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.625) internal successors, (159), 25 states have internal predecessors, (159), 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-04 10:38:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2025-03-04 10:38:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 10:38:01,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:01,668 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1] [2025-03-04 10:38:01,675 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-04 10:38:01,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:01,871 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:38:01,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:01,871 INFO L85 PathProgramCache]: Analyzing trace with hash -720091318, now seen corresponding path program 4 times [2025-03-04 10:38:01,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298381239] [2025-03-04 10:38:01,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:38:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:01,878 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 161 statements into 2 equivalence classes. [2025-03-04 10:38:01,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 10:38:01,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:38:01,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:02,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:02,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298381239] [2025-03-04 10:38:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298381239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:02,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972456196] [2025-03-04 10:38:02,493 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:38:02,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:02,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:02,499 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:02,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:38:02,527 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 161 statements into 2 equivalence classes. [2025-03-04 10:38:02,563 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 10:38:02,564 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:38:02,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:02,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:38:02,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:02,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:03,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972456196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:03,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:03,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 10:38:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498317733] [2025-03-04 10:38:03,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:03,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 10:38:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:03,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 10:38:03,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:38:03,321 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand has 48 states, 47 states have (on average 6.829787234042553) internal successors, (321), 48 states have internal predecessors, (321), 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-04 10:38:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:03,440 INFO L93 Difference]: Finished difference Result 219 states and 226 transitions. [2025-03-04 10:38:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:38:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.829787234042553) internal successors, (321), 48 states have internal predecessors, (321), 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 161 [2025-03-04 10:38:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:03,441 INFO L225 Difference]: With dead ends: 219 [2025-03-04 10:38:03,441 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:38:03,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:38:03,445 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:03,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:38:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-04 10:38:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.0046082949308757) internal successors, (218), 217 states have internal predecessors, (218), 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-04 10:38:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2025-03-04 10:38:03,454 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 161 [2025-03-04 10:38:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:03,454 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2025-03-04 10:38:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.829787234042553) internal successors, (321), 48 states have internal predecessors, (321), 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-04 10:38:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2025-03-04 10:38:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-04 10:38:03,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:03,456 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1] [2025-03-04 10:38:03,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:38:03,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:03,660 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:38:03,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2075816246, now seen corresponding path program 5 times [2025-03-04 10:38:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:03,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000551340] [2025-03-04 10:38:03,661 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:38:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:03,666 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 217 statements into 31 equivalence classes. [2025-03-04 10:38:03,688 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 10:38:03,688 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-04 10:38:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:38:03,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378508732] [2025-03-04 10:38:03,690 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:38:03,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:03,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:03,695 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:03,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:38:03,715 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 217 statements into 31 equivalence classes. [2025-03-04 10:38:03,757 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 10:38:03,758 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-04 10:38:03,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:38:03,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:38:03,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-04 10:38:03,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 10:38:03,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:03,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:38:03,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:38:03,828 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:38:03,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-04 10:38:03,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-04 10:38:03,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-04 10:38:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-04 10:38:03,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:04,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:04,037 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:04,075 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:38:04,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:38:04 BoogieIcfgContainer [2025-03-04 10:38:04,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:38:04,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:38:04,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:38:04,078 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:38:04,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:37:48" (3/4) ... [2025-03-04 10:38:04,078 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 10:38:04,133 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-03-04 10:38:04,192 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:38:04,192 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:38:04,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:38:04,193 INFO L158 Benchmark]: Toolchain (without parser) took 16516.23ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 129.9MB in the beginning and 144.6MB in the end (delta: -14.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2025-03-04 10:38:04,193 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:38:04,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.87ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 119.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:38:04,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.25ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 118.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:38:04,193 INFO L158 Benchmark]: Boogie Preprocessor took 22.38ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 117.5MB in the end (delta: 830.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:38:04,194 INFO L158 Benchmark]: IcfgBuilder took 227.92ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 103.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:38:04,194 INFO L158 Benchmark]: TraceAbstraction took 15986.54ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 103.3MB in the beginning and 155.1MB in the end (delta: -51.8MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2025-03-04 10:38:04,194 INFO L158 Benchmark]: Witness Printer took 114.94ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 144.6MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:38:04,195 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.28ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.87ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 119.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.25ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 118.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.38ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 117.5MB in the end (delta: 830.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 227.92ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 103.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15986.54ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 103.3MB in the beginning and 155.1MB in the end (delta: -51.8MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 114.94ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 144.6MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 39]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int A, B; [L24] int r, d, p, q; [L25] A = __VERIFIER_nondet_int() [L26] B = 1 [L28] r = A [L29] d = B [L30] p = 1 [L31] q = 0 VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2, p=1, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4, p=2, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8, p=4, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16, p=8, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=32, p=16, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=64, p=32, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=128, p=64, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=256, p=128, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=512, p=256, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1024, p=512, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2048, p=1024, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4096, p=2048, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8192, p=4096, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16384, p=8192, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=32768, p=16384, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=65536, p=32768, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=131072, p=65536, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=262144, p=131072, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=524288, p=262144, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1048576, p=524288, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2097152, p=1048576, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4194304, p=2097152, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8388608, p=4194304, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16777216, p=8388608, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=33554432, p=16777216, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=67108864, p=33554432, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=134217728, p=67108864, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=268435456, p=134217728, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=536870912, p=268435456, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1073741824, p=536870912, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L39] 2 * d VAL [A=0, B=1, p=1073741824, q=0, r=0] - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 23, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 908 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908 mSDsluCounter, 1396 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 892 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1355 IncrementalHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 504 mSDtfsCounter, 1355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 850 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=17, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 381 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1524 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 1398 ConstructedInterpolants, 86 QuantifiedInterpolants, 6221 SizeOfPredicates, 14 NumberOfNonLiveVariables, 941 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 41 InterpolantComputations, 13 PerfectInterpolantSequences, 260/7021 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 10:38:04,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)