./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/xcsp/AllInterval-005.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-005.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 a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:48:16,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:48:16,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:48:16,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:48:16,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:48:16,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:48:16,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:48:16,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:48:16,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:48:16,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:48:16,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:48:16,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:48:16,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:48:16,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:48:16,851 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:48:16,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:48:16,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:48:16,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:48:16,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:48:16,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:48:16,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:48:16,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:48:16,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:48:16,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:48:16,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:48:16,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:48:16,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:16,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:48:16,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:48:16,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:48:16,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:48:16,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:48:16,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:48:16,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:48:16,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:48:16,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:48:16,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:48:16,854 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 -> a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 [2025-03-09 02:48:17,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:48:17,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:48:17,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:48:17,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:48:17,061 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:48:17,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-005.c [2025-03-09 02:48:18,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c27e430b/7d32568629a143a6842db9acecb7ac60/FLAG67a33107e [2025-03-09 02:48:18,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:48:18,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c [2025-03-09 02:48:18,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c27e430b/7d32568629a143a6842db9acecb7ac60/FLAG67a33107e [2025-03-09 02:48:18,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c27e430b/7d32568629a143a6842db9acecb7ac60 [2025-03-09 02:48:18,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:48:18,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:48:18,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:18,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:48:18,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:48:18,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4481a9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18, skipping insertion in model container [2025-03-09 02:48:18,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:48:18,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:18,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:48:18,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:18,690 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:48:18,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18 WrapperNode [2025-03-09 02:48:18,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:18,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:18,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:48:18,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:48:18,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,714 INFO L138 Inliner]: procedures = 13, calls = 46, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-03-09 02:48:18,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:18,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:48:18,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:48:18,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:48:18,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,730 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:48:18,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,734 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:48:18,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:48:18,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:48:18,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:48:18,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (1/1) ... [2025-03-09 02:48:18,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:18,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:18,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:48:18,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:48:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:48:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:48:18,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:48:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:48:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-03-09 02:48:18,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-03-09 02:48:18,828 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:48:18,830 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:48:18,969 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-03-09 02:48:18,969 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:48:18,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:48:18,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:48:18,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:18 BoogieIcfgContainer [2025-03-09 02:48:18,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:48:18,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:48:18,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:48:18,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:48:18,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:48:18" (1/3) ... [2025-03-09 02:48:18,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2614af46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:18, skipping insertion in model container [2025-03-09 02:48:18,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:18" (2/3) ... [2025-03-09 02:48:18,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2614af46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:18, skipping insertion in model container [2025-03-09 02:48:18,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:18" (3/3) ... [2025-03-09 02:48:18,987 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2025-03-09 02:48:19,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:48:19,003 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-005.c that has 2 procedures, 99 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-09 02:48:19,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:48:19,069 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;@2601af34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:48:19,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 02:48:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 59 states have internal predecessors, (64), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 02:48:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-09 02:48:19,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:19,085 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:19,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1139443252, now seen corresponding path program 1 times [2025-03-09 02:48:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056309471] [2025-03-09 02:48:19,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:19,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-09 02:48:19,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-09 02:48:19,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:19,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-09 02:48:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:19,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056309471] [2025-03-09 02:48:19,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056309471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:19,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293440468] [2025-03-09 02:48:19,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:19,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:19,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:19,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:19,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:48:19,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-09 02:48:19,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-09 02:48:19,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:19,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:19,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 02:48:19,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-09 02:48:19,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293440468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:19,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-09 02:48:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318450772] [2025-03-09 02:48:19,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:19,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:48:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:19,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:48:19,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:48:19,501 INFO L87 Difference]: Start difference. First operand has 99 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 59 states have internal predecessors, (64), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-09 02:48:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:19,535 INFO L93 Difference]: Finished difference Result 191 states and 311 transitions. [2025-03-09 02:48:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:48:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 183 [2025-03-09 02:48:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:19,543 INFO L225 Difference]: With dead ends: 191 [2025-03-09 02:48:19,543 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 02:48:19,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:48:19,549 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:19,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 02:48:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-09 02:48:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 53 states have internal predecessors, (56), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2025-03-09 02:48:19,580 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 183 [2025-03-09 02:48:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:19,581 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2025-03-09 02:48:19,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-09 02:48:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2025-03-09 02:48:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-09 02:48:19,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:19,584 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:19,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:48:19,784 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-09 02:48:19,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1598675308, now seen corresponding path program 1 times [2025-03-09 02:48:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:19,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635955428] [2025-03-09 02:48:19,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:19,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-09 02:48:19,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-09 02:48:19,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:19,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-09 02:48:20,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:20,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635955428] [2025-03-09 02:48:20,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635955428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:20,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851121821] [2025-03-09 02:48:20,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:20,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:20,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:20,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:48:20,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-09 02:48:20,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-09 02:48:20,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:20,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:20,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:20,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-09 02:48:20,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-09 02:48:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851121821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:20,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 02:48:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127920164] [2025-03-09 02:48:20,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:20,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:48:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:20,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:48:20,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:20,801 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 6 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 5 states have call predecessors, (100), 6 states have call successors, (100) [2025-03-09 02:48:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:20,981 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2025-03-09 02:48:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:20,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 6 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 5 states have call predecessors, (100), 6 states have call successors, (100) Word has length 183 [2025-03-09 02:48:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:20,983 INFO L225 Difference]: With dead ends: 92 [2025-03-09 02:48:20,983 INFO L226 Difference]: Without dead ends: 91 [2025-03-09 02:48:20,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:20,983 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:20,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 438 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-09 02:48:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-09 02:48:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 52 states have internal predecessors, (55), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-03-09 02:48:20,995 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 183 [2025-03-09 02:48:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:20,996 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-03-09 02:48:20,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 6 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 5 states have call predecessors, (100), 6 states have call successors, (100) [2025-03-09 02:48:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-03-09 02:48:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-09 02:48:20,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:20,998 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:21,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:48:21,198 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-09 02:48:21,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:21,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1980673022, now seen corresponding path program 1 times [2025-03-09 02:48:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:21,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365505631] [2025-03-09 02:48:21,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:21,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-09 02:48:21,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 02:48:21,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:21,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-09 02:48:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365505631] [2025-03-09 02:48:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365505631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456518333] [2025-03-09 02:48:21,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:21,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:21,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:21,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:21,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:48:21,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-09 02:48:21,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-09 02:48:21,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:21,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:21,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:21,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-09 02:48:21,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-09 02:48:21,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456518333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:21,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-09 02:48:21,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643527537] [2025-03-09 02:48:21,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:21,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:48:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:21,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:48:21,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:21,857 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (65), 1 states have call predecessors, (65), 2 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) [2025-03-09 02:48:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:22,006 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2025-03-09 02:48:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:22,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (65), 1 states have call predecessors, (65), 2 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) Word has length 184 [2025-03-09 02:48:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:22,008 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:48:22,008 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 02:48:22,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:22,009 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:22,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 02:48:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 02:48:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 51 states have internal predecessors, (54), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2025-03-09 02:48:22,027 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 184 [2025-03-09 02:48:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:22,027 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2025-03-09 02:48:22,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (65), 1 states have call predecessors, (65), 2 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) [2025-03-09 02:48:22,027 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2025-03-09 02:48:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-09 02:48:22,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:22,032 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:22,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:22,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:22,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:22,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash 756262556, now seen corresponding path program 1 times [2025-03-09 02:48:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:22,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494550475] [2025-03-09 02:48:22,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:22,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-09 02:48:22,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-09 02:48:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-09 02:48:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494550475] [2025-03-09 02:48:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494550475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:22,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:22,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:48:22,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176014808] [2025-03-09 02:48:22,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:22,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:22,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:22,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:22,313 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-09 02:48:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:22,343 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2025-03-09 02:48:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 186 [2025-03-09 02:48:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:22,345 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:48:22,345 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 02:48:22,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:22,346 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:22,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 02:48:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-09 02:48:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 47 states have internal predecessors, (50), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2025-03-09 02:48:22,357 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 186 [2025-03-09 02:48:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:22,359 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2025-03-09 02:48:22,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-09 02:48:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2025-03-09 02:48:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-09 02:48:22,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:22,360 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:22,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:48:22,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1969302769, now seen corresponding path program 1 times [2025-03-09 02:48:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15925716] [2025-03-09 02:48:22,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:22,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-09 02:48:22,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-09 02:48:22,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:22,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 186 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-03-09 02:48:22,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15925716] [2025-03-09 02:48:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15925716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360208999] [2025-03-09 02:48:22,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:22,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:22,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:22,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:22,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:48:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-09 02:48:22,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-09 02:48:22,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:22,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:22,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:48:22,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-09 02:48:22,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-09 02:48:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360208999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:23,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-09 02:48:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454150129] [2025-03-09 02:48:23,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:48:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:23,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:48:23,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:48:23,032 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (98), 1 states have call predecessors, (98), 2 states have return successors, (98), 4 states have call predecessors, (98), 5 states have call successors, (98) [2025-03-09 02:48:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:23,309 INFO L93 Difference]: Finished difference Result 86 states and 124 transitions. [2025-03-09 02:48:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:48:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (98), 1 states have call predecessors, (98), 2 states have return successors, (98), 4 states have call predecessors, (98), 5 states have call successors, (98) Word has length 187 [2025-03-09 02:48:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:23,311 INFO L225 Difference]: With dead ends: 86 [2025-03-09 02:48:23,311 INFO L226 Difference]: Without dead ends: 85 [2025-03-09 02:48:23,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:48:23,312 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:23,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 512 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-09 02:48:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-09 02:48:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 46 states have internal predecessors, (49), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2025-03-09 02:48:23,330 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 187 [2025-03-09 02:48:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:23,330 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2025-03-09 02:48:23,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (98), 1 states have call predecessors, (98), 2 states have return successors, (98), 4 states have call predecessors, (98), 5 states have call successors, (98) [2025-03-09 02:48:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2025-03-09 02:48:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-09 02:48:23,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:23,332 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:23,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:23,533 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-09 02:48:23,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash 157596687, now seen corresponding path program 1 times [2025-03-09 02:48:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171842480] [2025-03-09 02:48:23,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:23,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-09 02:48:23,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-09 02:48:23,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:23,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 6 proven. 96 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-09 02:48:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:23,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171842480] [2025-03-09 02:48:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171842480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:23,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37372264] [2025-03-09 02:48:23,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:23,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:23,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:23,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:23,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:48:23,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-09 02:48:23,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-09 02:48:23,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:23,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:48:23,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 132 proven. 240 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2025-03-09 02:48:24,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 132 proven. 240 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2025-03-09 02:48:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37372264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:24,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-09 02:48:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589381891] [2025-03-09 02:48:24,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:24,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:48:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:24,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:48:24,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:48:24,371 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 11 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (105), 11 states have call predecessors, (105), 11 states have call successors, (105) [2025-03-09 02:48:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:24,719 INFO L93 Difference]: Finished difference Result 89 states and 130 transitions. [2025-03-09 02:48:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:48:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 11 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (105), 11 states have call predecessors, (105), 11 states have call successors, (105) Word has length 192 [2025-03-09 02:48:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:24,721 INFO L225 Difference]: With dead ends: 89 [2025-03-09 02:48:24,722 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 02:48:24,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:48:24,723 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 27 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:24,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 567 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 02:48:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-03-09 02:48:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 38 states have (on average 1.263157894736842) internal successors, (48), 45 states have internal predecessors, (48), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2025-03-09 02:48:24,735 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 192 [2025-03-09 02:48:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:24,735 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2025-03-09 02:48:24,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 11 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (105), 11 states have call predecessors, (105), 11 states have call successors, (105) [2025-03-09 02:48:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2025-03-09 02:48:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-09 02:48:24,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:24,737 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:24,743 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-09 02:48:24,937 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-09 02:48:24,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:24,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:24,938 INFO L85 PathProgramCache]: Analyzing trace with hash 590530007, now seen corresponding path program 1 times [2025-03-09 02:48:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:24,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703434429] [2025-03-09 02:48:24,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:24,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:24,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-09 02:48:24,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-09 02:48:24,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:24,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 12 proven. 90 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-09 02:48:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703434429] [2025-03-09 02:48:25,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703434429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321953053] [2025-03-09 02:48:25,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:25,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:25,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:25,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:25,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:48:25,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-09 02:48:25,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-09 02:48:25,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:25,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:25,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:25,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 12 proven. 90 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-09 02:48:25,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 12 proven. 90 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-09 02:48:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321953053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:25,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:25,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-03-09 02:48:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420715003] [2025-03-09 02:48:25,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:25,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:48:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:25,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:48:25,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:48:25,508 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 8 states have call successors, (100), 1 states have call predecessors, (100), 2 states have return successors, (101), 7 states have call predecessors, (101), 8 states have call successors, (101) [2025-03-09 02:48:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:25,771 INFO L93 Difference]: Finished difference Result 84 states and 122 transitions. [2025-03-09 02:48:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:48:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 8 states have call successors, (100), 1 states have call predecessors, (100), 2 states have return successors, (101), 7 states have call predecessors, (101), 8 states have call successors, (101) Word has length 193 [2025-03-09 02:48:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:25,773 INFO L225 Difference]: With dead ends: 84 [2025-03-09 02:48:25,773 INFO L226 Difference]: Without dead ends: 83 [2025-03-09 02:48:25,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:48:25,773 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 21 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:25,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 600 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-09 02:48:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-09 02:48:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 38 states have (on average 1.236842105263158) internal successors, (47), 44 states have internal predecessors, (47), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-03-09 02:48:25,781 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 193 [2025-03-09 02:48:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:25,781 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-03-09 02:48:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 8 states have call successors, (100), 1 states have call predecessors, (100), 2 states have return successors, (101), 7 states have call predecessors, (101), 8 states have call successors, (101) [2025-03-09 02:48:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-03-09 02:48:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-09 02:48:25,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:25,784 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:25,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:25,984 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-09 02:48:25,985 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:25,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:25,985 INFO L85 PathProgramCache]: Analyzing trace with hash 293399020, now seen corresponding path program 1 times [2025-03-09 02:48:25,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:25,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021945378] [2025-03-09 02:48:25,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:25,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:25,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-09 02:48:26,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-09 02:48:26,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:26,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 18 proven. 180 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-03-09 02:48:26,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:26,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021945378] [2025-03-09 02:48:26,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021945378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:26,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029707144] [2025-03-09 02:48:26,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:26,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:26,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:26,175 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:26,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:48:26,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-09 02:48:26,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-09 02:48:26,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:26,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:26,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 02:48:26,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 132 proven. 240 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2025-03-09 02:48:26,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 132 proven. 240 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2025-03-09 02:48:26,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029707144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:26,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:26,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-09 02:48:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989431868] [2025-03-09 02:48:26,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:26,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 02:48:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:26,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 02:48:26,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:48:26,782 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 23 states have internal predecessors, (67), 11 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (105), 11 states have call predecessors, (105), 11 states have call successors, (105) [2025-03-09 02:48:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:27,205 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2025-03-09 02:48:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:48:27,205 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 23 states have internal predecessors, (67), 11 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (105), 11 states have call predecessors, (105), 11 states have call successors, (105) Word has length 196 [2025-03-09 02:48:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:27,206 INFO L225 Difference]: With dead ends: 87 [2025-03-09 02:48:27,206 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 02:48:27,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:48:27,207 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:27,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 614 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:48:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 02:48:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-09 02:48:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 43 states have internal predecessors, (46), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2025-03-09 02:48:27,214 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 196 [2025-03-09 02:48:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:27,214 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2025-03-09 02:48:27,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 23 states have internal predecessors, (67), 11 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (105), 11 states have call predecessors, (105), 11 states have call successors, (105) [2025-03-09 02:48:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2025-03-09 02:48:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-09 02:48:27,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:27,216 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:27,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:27,421 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-09 02:48:27,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:27,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1386174944, now seen corresponding path program 1 times [2025-03-09 02:48:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:27,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110468752] [2025-03-09 02:48:27,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:27,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:27,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-09 02:48:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-09 02:48:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 12 proven. 93 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110468752] [2025-03-09 02:48:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110468752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120912384] [2025-03-09 02:48:27,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:27,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:27,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:27,539 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:27,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:48:27,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-09 02:48:27,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-09 02:48:27,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:27,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:27,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:27,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 12 proven. 93 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:27,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 12 proven. 93 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120912384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:27,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 02:48:27,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786323071] [2025-03-09 02:48:27,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:27,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:48:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:27,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:48:27,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:27,883 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 6 states have call successors, (97), 1 states have call predecessors, (97), 2 states have return successors, (98), 6 states have call predecessors, (98), 6 states have call successors, (98) [2025-03-09 02:48:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:28,035 INFO L93 Difference]: Finished difference Result 82 states and 120 transitions. [2025-03-09 02:48:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 6 states have call successors, (97), 1 states have call predecessors, (97), 2 states have return successors, (98), 6 states have call predecessors, (98), 6 states have call successors, (98) Word has length 201 [2025-03-09 02:48:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:28,037 INFO L225 Difference]: With dead ends: 82 [2025-03-09 02:48:28,037 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 02:48:28,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:28,037 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:28,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 305 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 02:48:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-09 02:48:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2025-03-09 02:48:28,046 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 201 [2025-03-09 02:48:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:28,048 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2025-03-09 02:48:28,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 6 states have call successors, (97), 1 states have call predecessors, (97), 2 states have return successors, (98), 6 states have call predecessors, (98), 6 states have call successors, (98) [2025-03-09 02:48:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2025-03-09 02:48:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-09 02:48:28,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:28,050 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:28,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:28,253 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-09 02:48:28,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:28,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:28,254 INFO L85 PathProgramCache]: Analyzing trace with hash 21750298, now seen corresponding path program 1 times [2025-03-09 02:48:28,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:28,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139508667] [2025-03-09 02:48:28,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:28,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-09 02:48:28,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-09 02:48:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 18 proven. 87 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139508667] [2025-03-09 02:48:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139508667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311146952] [2025-03-09 02:48:28,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:28,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:28,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:28,386 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:28,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:48:28,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-09 02:48:28,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-09 02:48:28,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:28,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:28,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:28,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 18 proven. 87 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:28,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 18 proven. 87 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311146952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:28,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:28,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-09 02:48:28,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33175863] [2025-03-09 02:48:28,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:28,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:48:28,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:28,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:48:28,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:28,745 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (65), 1 states have call predecessors, (65), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2025-03-09 02:48:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:28,924 INFO L93 Difference]: Finished difference Result 81 states and 119 transitions. [2025-03-09 02:48:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:28,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (65), 1 states have call predecessors, (65), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) Word has length 202 [2025-03-09 02:48:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:28,926 INFO L225 Difference]: With dead ends: 81 [2025-03-09 02:48:28,926 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 02:48:28,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:28,927 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:28,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 02:48:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-09 02:48:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2025-03-09 02:48:28,936 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 202 [2025-03-09 02:48:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:28,936 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2025-03-09 02:48:28,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (65), 1 states have call predecessors, (65), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2025-03-09 02:48:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2025-03-09 02:48:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-09 02:48:28,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:28,938 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:28,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:29,138 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,SelfDestructingSolverStorable9 [2025-03-09 02:48:29,138 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -576940995, now seen corresponding path program 1 times [2025-03-09 02:48:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092577905] [2025-03-09 02:48:29,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:29,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-09 02:48:29,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-09 02:48:29,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:29,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 12 proven. 93 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:29,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092577905] [2025-03-09 02:48:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092577905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971440204] [2025-03-09 02:48:29,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:29,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:29,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:29,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:48:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-09 02:48:29,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-09 02:48:29,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:29,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:29,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:48:29,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 12 proven. 93 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:29,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 12 proven. 93 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-09 02:48:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971440204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:29,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-09 02:48:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427803617] [2025-03-09 02:48:29,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:29,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:48:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:29,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:48:29,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:29,588 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (66), 1 states have call predecessors, (66), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2025-03-09 02:48:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:29,762 INFO L93 Difference]: Finished difference Result 80 states and 118 transitions. [2025-03-09 02:48:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:48:29,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (66), 1 states have call predecessors, (66), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) Word has length 205 [2025-03-09 02:48:29,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:29,764 INFO L225 Difference]: With dead ends: 80 [2025-03-09 02:48:29,764 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 02:48:29,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:29,765 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 18 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:29,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 283 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 02:48:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-09 02:48:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2025-03-09 02:48:29,774 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 205 [2025-03-09 02:48:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:29,775 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 117 transitions. [2025-03-09 02:48:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (66), 1 states have call predecessors, (66), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2025-03-09 02:48:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 117 transitions. [2025-03-09 02:48:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-09 02:48:29,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:29,778 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:29,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 02:48:29,982 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,SelfDestructingSolverStorable10 [2025-03-09 02:48:29,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:29,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash -184356837, now seen corresponding path program 1 times [2025-03-09 02:48:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:29,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691722427] [2025-03-09 02:48:29,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:29,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:29,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-09 02:48:29,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-09 02:48:29,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:29,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691722427] [2025-03-09 02:48:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691722427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819630839] [2025-03-09 02:48:30,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:30,095 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:30,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:48:30,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-09 02:48:30,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-09 02:48:30,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:30,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:30,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:30,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:30,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819630839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:30,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 02:48:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168371929] [2025-03-09 02:48:30,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:30,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:48:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:30,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:48:30,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:30,445 INFO L87 Difference]: Start difference. First operand 79 states and 117 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 6 states have call successors, (96), 1 states have call predecessors, (96), 2 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) [2025-03-09 02:48:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:30,586 INFO L93 Difference]: Finished difference Result 79 states and 117 transitions. [2025-03-09 02:48:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:30,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 6 states have call successors, (96), 1 states have call predecessors, (96), 2 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) Word has length 210 [2025-03-09 02:48:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:30,589 INFO L225 Difference]: With dead ends: 79 [2025-03-09 02:48:30,589 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 02:48:30,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:30,589 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 20 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:30,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 322 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 02:48:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-09 02:48:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2025-03-09 02:48:30,595 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 210 [2025-03-09 02:48:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:30,597 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2025-03-09 02:48:30,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 6 states have call successors, (96), 1 states have call predecessors, (96), 2 states have return successors, (97), 6 states have call predecessors, (97), 6 states have call successors, (97) [2025-03-09 02:48:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2025-03-09 02:48:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-09 02:48:30,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:30,598 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:30,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:30,798 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,SelfDestructingSolverStorable11 [2025-03-09 02:48:30,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1420094669, now seen corresponding path program 1 times [2025-03-09 02:48:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942759515] [2025-03-09 02:48:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:30,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-09 02:48:30,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-09 02:48:30,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:30,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:30,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:30,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942759515] [2025-03-09 02:48:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942759515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:30,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102081289] [2025-03-09 02:48:30,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:30,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:30,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:30,929 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:30,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:48:30,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-09 02:48:30,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-09 02:48:30,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:30,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:30,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:30,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:31,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:31,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102081289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:31,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:31,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-09 02:48:31,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652475040] [2025-03-09 02:48:31,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:31,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:48:31,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:31,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:48:31,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:48:31,268 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (97), 1 states have call predecessors, (97), 2 states have return successors, (98), 6 states have call predecessors, (98), 6 states have call successors, (98) [2025-03-09 02:48:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:31,488 INFO L93 Difference]: Finished difference Result 78 states and 116 transitions. [2025-03-09 02:48:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:48:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (97), 1 states have call predecessors, (97), 2 states have return successors, (98), 6 states have call predecessors, (98), 6 states have call successors, (98) Word has length 211 [2025-03-09 02:48:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:31,490 INFO L225 Difference]: With dead ends: 78 [2025-03-09 02:48:31,490 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 02:48:31,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:48:31,490 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:31,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 341 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 02:48:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 02:48:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:48:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2025-03-09 02:48:31,498 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 211 [2025-03-09 02:48:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:31,498 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2025-03-09 02:48:31,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (97), 1 states have call predecessors, (97), 2 states have return successors, (98), 6 states have call predecessors, (98), 6 states have call successors, (98) [2025-03-09 02:48:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2025-03-09 02:48:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-09 02:48:31,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:31,500 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:31,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:31,700 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,SelfDestructingSolverStorable12 [2025-03-09 02:48:31,701 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:48:31,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash -612437512, now seen corresponding path program 1 times [2025-03-09 02:48:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:31,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692196905] [2025-03-09 02:48:31,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:31,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-09 02:48:31,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-09 02:48:31,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:31,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:31,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692196905] [2025-03-09 02:48:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692196905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:31,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596659357] [2025-03-09 02:48:31,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:31,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:31,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:31,829 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:31,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:48:31,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-09 02:48:31,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-09 02:48:31,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:31,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:48:31,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:32,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-09 02:48:32,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596659357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:32,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:32,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-09 02:48:32,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40670744] [2025-03-09 02:48:32,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:32,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:48:32,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:32,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:48:32,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:32,158 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (66), 1 states have call predecessors, (66), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2025-03-09 02:48:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:32,310 INFO L93 Difference]: Finished difference Result 77 states and 115 transitions. [2025-03-09 02:48:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:48:32,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (66), 1 states have call predecessors, (66), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) Word has length 214 [2025-03-09 02:48:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:32,311 INFO L225 Difference]: With dead ends: 77 [2025-03-09 02:48:32,311 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:48:32,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 423 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:32,313 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 27 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:32,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 268 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:48:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:48:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:48:32,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2025-03-09 02:48:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:32,314 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:48:32,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (66), 1 states have call predecessors, (66), 2 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2025-03-09 02:48:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:48:32,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:48:32,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-09 02:48:32,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-09 02:48:32,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-09 02:48:32,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-09 02:48:32,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-09 02:48:32,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-09 02:48:32,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:32,519 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,SelfDestructingSolverStorable13 [2025-03-09 02:48:32,522 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:32,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:48:32,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:48:32,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:48:32 BoogieIcfgContainer [2025-03-09 02:48:32,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:48:32,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:48:32,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:48:32,981 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:48:32,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:18" (3/4) ... [2025-03-09 02:48:32,983 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:48:32,987 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume [2025-03-09 02:48:32,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:48:32,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:48:32,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:48:32,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:48:33,045 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:48:33,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:48:33,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:48:33,046 INFO L158 Benchmark]: Toolchain (without parser) took 14539.52ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 111.2MB in the beginning and 279.9MB in the end (delta: -168.7MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:33,046 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:33,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.82ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 99.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:33,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.69ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:33,047 INFO L158 Benchmark]: Boogie Preprocessor took 21.48ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:33,047 INFO L158 Benchmark]: IcfgBuilder took 241.87ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 79.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:48:33,047 INFO L158 Benchmark]: TraceAbstraction took 13999.27ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 79.7MB in the beginning and 285.1MB in the end (delta: -205.3MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2025-03-09 02:48:33,047 INFO L158 Benchmark]: Witness Printer took 64.87ms. Allocated memory is still 343.9MB. Free memory was 285.1MB in the beginning and 279.9MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:33,048 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.41ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.82ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 99.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.69ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.48ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 241.87ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 79.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13999.27ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 79.7MB in the beginning and 285.1MB in the end (delta: -205.3MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. * Witness Printer took 64.87ms. Allocated memory is still 343.9MB. Free memory was 285.1MB in the beginning and 279.9MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 178 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 14, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 5274 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4124 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4192 IncrementalHoareTripleChecker+Invalid, 4359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 1150 mSDtfsCounter, 4192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5013 GetRequests, 4863 SyntacticMatches, 9 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=0, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 5308 NumberOfCodeBlocks, 5308 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 7647 ConstructedInterpolants, 0 QuantifiedInterpolants, 17033 SizeOfPredicates, 17 NumberOfNonLiveVariables, 4915 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 39 InterpolantComputations, 2 PerfectInterpolantSequences, 90861/95004 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 02:48:33,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE