./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/rewnifrev.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/rewnifrev.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 62ffb246c1e6cc2a3d3d5a08bb5a65a9894a173aba5be4caac9150f1d27ccfed --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:20:28,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:20:28,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:20:28,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:20:28,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:20:28,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:20:28,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:20:28,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:20:28,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:20:28,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:20:28,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:20:28,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:20:28,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:20:28,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:20:28,749 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:20:28,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:20:28,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:20:28,749 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:20:28,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:20:28,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:20:28,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:20:28,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:20:28,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:20:28,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:20:28,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:20:28,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:20:28,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:20:28,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:20:28,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:20:28,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:20:28,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:20:28,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:20:28,751 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:20:28,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:20:28,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:20:28,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:20:28,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:20:28,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:20:28,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:20:28,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:20:28,752 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-jdk21/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 -> 62ffb246c1e6cc2a3d3d5a08bb5a65a9894a173aba5be4caac9150f1d27ccfed [2025-01-10 01:20:28,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:20:28,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:20:28,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:20:28,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:20:28,969 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:20:28,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/rewnifrev.c [2025-01-10 01:20:30,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b5f18c43/8cbea7a4fec740bda59074af8d4d6634/FLAG252946799 [2025-01-10 01:20:30,485 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:20:30,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/rewnifrev.c [2025-01-10 01:20:30,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b5f18c43/8cbea7a4fec740bda59074af8d4d6634/FLAG252946799 [2025-01-10 01:20:30,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b5f18c43/8cbea7a4fec740bda59074af8d4d6634 [2025-01-10 01:20:30,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:20:30,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:20:30,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:20:30,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:20:30,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:20:30,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:30,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2f087f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30, skipping insertion in model container [2025-01-10 01:20:30,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:30,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:20:30,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:20:30,952 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:20:30,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:20:30,982 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:20:30,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30 WrapperNode [2025-01-10 01:20:30,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:20:30,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:20:30,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:20:30,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:20:30,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:30,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,009 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2025-01-10 01:20:31,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:20:31,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:20:31,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:20:31,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:20:31,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,027 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:20:31,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:20:31,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:20:31,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:20:31,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:20:31,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (1/1) ... [2025-01-10 01:20:31,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:20:31,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:31,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:20:31,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:20:31,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:20:31,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:20:31,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:20:31,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:20:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:20:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:20:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:20:31,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:20:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:20:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:20:31,123 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:20:31,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:20:31,240 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-10 01:20:31,240 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:20:31,250 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:20:31,250 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:20:31,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:20:31 BoogieIcfgContainer [2025-01-10 01:20:31,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:20:31,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:20:31,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:20:31,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:20:31,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:20:30" (1/3) ... [2025-01-10 01:20:31,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f90dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:20:31, skipping insertion in model container [2025-01-10 01:20:31,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:30" (2/3) ... [2025-01-10 01:20:31,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f90dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:20:31, skipping insertion in model container [2025-01-10 01:20:31,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:20:31" (3/3) ... [2025-01-10 01:20:31,258 INFO L128 eAbstractionObserver]: Analyzing ICFG rewnifrev.c [2025-01-10 01:20:31,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:20:31,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rewnifrev.c that has 1 procedures, 39 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-01-10 01:20:31,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:20:31,326 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;@367b8165, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:20:31,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 01:20:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 38 states have internal predecessors, (43), 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-01-10 01:20:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:20:31,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:31,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:20:31,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:31,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2025-01-10 01:20:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:31,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632691137] [2025-01-10 01:20:31,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:31,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:20:31,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:20:31,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:31,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632691137] [2025-01-10 01:20:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632691137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:31,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:20:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765627615] [2025-01-10 01:20:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:31,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:20:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:31,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:20:31,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:20:31,524 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-10 01:20:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:31,552 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2025-01-10 01:20:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:20:31,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:20:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:31,560 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:20:31,560 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:20:31,562 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-01-10 01:20:31,565 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:31,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:20:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:20:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.619047619047619) internal successors, (34), 31 states have internal predecessors, (34), 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-01-10 01:20:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-01-10 01:20:31,587 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 4 [2025-01-10 01:20:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:31,587 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-01-10 01:20:31,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-10 01:20:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-01-10 01:20:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:20:31,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:31,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:20:31,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:20:31,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:31,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash 28693763, now seen corresponding path program 1 times [2025-01-10 01:20:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664131778] [2025-01-10 01:20:31,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:31,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:20:31,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:20:31,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:31,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:31,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:31,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664131778] [2025-01-10 01:20:31,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664131778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:31,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:31,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:20:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475546478] [2025-01-10 01:20:31,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:31,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:20:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:31,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:20:31,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:20:31,622 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 01:20:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:31,635 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-01-10 01:20:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:20:31,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:20:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:31,635 INFO L225 Difference]: With dead ends: 32 [2025-01-10 01:20:31,635 INFO L226 Difference]: Without dead ends: 31 [2025-01-10 01:20:31,636 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-01-10 01:20:31,636 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:31,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-10 01:20:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-10 01:20:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-01-10 01:20:31,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 5 [2025-01-10 01:20:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:31,639 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-01-10 01:20:31,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 01:20:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-01-10 01:20:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:20:31,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:31,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:20:31,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:31,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1804903845, now seen corresponding path program 1 times [2025-01-10 01:20:31,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:31,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613063781] [2025-01-10 01:20:31,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:31,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:31,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:20:31,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:20:31,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:31,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:31,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613063781] [2025-01-10 01:20:31,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613063781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:31,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:31,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:20:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267969021] [2025-01-10 01:20:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:31,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:20:31,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:31,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:20:31,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:20:31,680 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:31,727 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-01-10 01:20:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:20:31,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:20:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:31,728 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:20:31,728 INFO L226 Difference]: Without dead ends: 31 [2025-01-10 01:20:31,729 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-01-10 01:20:31,730 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:31,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-10 01:20:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-01-10 01:20:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 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-01-10 01:20:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-01-10 01:20:31,733 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 7 [2025-01-10 01:20:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:31,733 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-01-10 01:20:31,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 01:20:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-01-10 01:20:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:20:31,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:31,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:31,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:20:31,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 117444394, now seen corresponding path program 1 times [2025-01-10 01:20:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530247348] [2025-01-10 01:20:31,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:31,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:20:31,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:20:31,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:31,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:31,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530247348] [2025-01-10 01:20:31,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530247348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:31,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:31,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179614785] [2025-01-10 01:20:31,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:31,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:31,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:31,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:31,771 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:31,829 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-01-10 01:20:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:31,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:20:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:31,830 INFO L225 Difference]: With dead ends: 41 [2025-01-10 01:20:31,830 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:20:31,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:20:31,830 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:31,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 21 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:20:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-01-10 01:20:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-01-10 01:20:31,837 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 8 [2025-01-10 01:20:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:31,838 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-01-10 01:20:31,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-01-10 01:20:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:20:31,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:31,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:31,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:20:31,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:31,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1218840652, now seen corresponding path program 1 times [2025-01-10 01:20:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:31,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589489182] [2025-01-10 01:20:31,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:31,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:20:31,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:20:31,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:31,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:31,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:31,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589489182] [2025-01-10 01:20:31,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589489182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:31,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:31,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:20:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919016730] [2025-01-10 01:20:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:31,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:31,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:31,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:31,901 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:31,967 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-01-10 01:20:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:20:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:31,968 INFO L225 Difference]: With dead ends: 60 [2025-01-10 01:20:31,969 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:20:31,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:20:31,970 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 39 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:31,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:20:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:20:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-01-10 01:20:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 35 states have internal predecessors, (38), 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-01-10 01:20:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-01-10 01:20:31,978 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2025-01-10 01:20:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:31,979 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-01-10 01:20:31,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-01-10 01:20:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:20:31,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:31,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:31,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:20:31,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:31,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash 106515470, now seen corresponding path program 1 times [2025-01-10 01:20:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815324047] [2025-01-10 01:20:31,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:31,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:20:32,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:20:32,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:32,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815324047] [2025-01-10 01:20:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815324047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:32,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974339682] [2025-01-10 01:20:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:32,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:32,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:32,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:32,103 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-01-10 01:20:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:32,139 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2025-01-10 01:20:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:32,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 01:20:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:32,140 INFO L225 Difference]: With dead ends: 40 [2025-01-10 01:20:32,140 INFO L226 Difference]: Without dead ends: 39 [2025-01-10 01:20:32,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:32,140 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:32,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-10 01:20:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-01-10 01:20:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-01-10 01:20:32,143 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 15 [2025-01-10 01:20:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:32,143 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-01-10 01:20:32,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-01-10 01:20:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-01-10 01:20:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:20:32,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:32,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:32,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:20:32,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:32,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash -992987660, now seen corresponding path program 1 times [2025-01-10 01:20:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977908749] [2025-01-10 01:20:32,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:32,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:20:32,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:20:32,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:32,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:32,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977908749] [2025-01-10 01:20:32,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977908749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:32,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:32,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753331323] [2025-01-10 01:20:32,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:32,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:32,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:32,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:32,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:32,191 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:32,231 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-01-10 01:20:32,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:32,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 01:20:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:32,232 INFO L225 Difference]: With dead ends: 38 [2025-01-10 01:20:32,232 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:20:32,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:32,233 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:32,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 24 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:20:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2025-01-10 01:20:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 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-01-10 01:20:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-01-10 01:20:32,239 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 16 [2025-01-10 01:20:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:32,239 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-01-10 01:20:32,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-01-10 01:20:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:20:32,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:32,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:32,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:20:32,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:32,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash -767060485, now seen corresponding path program 1 times [2025-01-10 01:20:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870581535] [2025-01-10 01:20:32,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:32,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:20:32,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:20:32,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:32,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:20:32,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:32,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870581535] [2025-01-10 01:20:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870581535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143190297] [2025-01-10 01:20:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:32,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:32,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:32,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:32,326 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:32,358 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-01-10 01:20:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-10 01:20:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:32,359 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:20:32,359 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:20:32,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:32,360 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:32,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:20:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-10 01:20:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-01-10 01:20:32,366 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 21 [2025-01-10 01:20:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:32,366 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-01-10 01:20:32,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-01-10 01:20:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-01-10 01:20:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:20:32,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:32,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:32,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:20:32,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:32,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1249229253, now seen corresponding path program 1 times [2025-01-10 01:20:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:32,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645778889] [2025-01-10 01:20:32,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:32,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:20:32,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:20:32,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:32,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:20:32,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645778889] [2025-01-10 01:20:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645778889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:32,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344289511] [2025-01-10 01:20:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:32,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:32,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:32,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:32,403 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:32,426 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-01-10 01:20:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-10 01:20:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:32,427 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:20:32,427 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:20:32,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:32,428 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:32,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:20:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-01-10 01:20:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 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-01-10 01:20:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-01-10 01:20:32,430 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 22 [2025-01-10 01:20:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:32,430 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-01-10 01:20:32,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-01-10 01:20:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:20:32,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:32,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:32,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:20:32,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:32,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1969873127, now seen corresponding path program 1 times [2025-01-10 01:20:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863042785] [2025-01-10 01:20:32,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:32,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:20:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:20:32,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:32,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:20:32,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:32,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863042785] [2025-01-10 01:20:32,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863042785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:32,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:32,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:20:32,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195629621] [2025-01-10 01:20:32,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:32,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:20:32,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:32,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:20:32,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:20:32,471 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-01-10 01:20:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:32,505 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-01-10 01:20:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:20:32,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-10 01:20:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:32,506 INFO L225 Difference]: With dead ends: 48 [2025-01-10 01:20:32,506 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:20:32,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:20:32,506 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:32,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:20:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 01:20:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 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-01-10 01:20:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-01-10 01:20:32,509 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2025-01-10 01:20:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:32,509 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-01-10 01:20:32,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-01-10 01:20:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-01-10 01:20:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 01:20:32,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:32,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:32,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:20:32,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -348878128, now seen corresponding path program 1 times [2025-01-10 01:20:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287728277] [2025-01-10 01:20:32,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:32,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:20:32,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:20:32,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:32,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:20:32,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:32,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287728277] [2025-01-10 01:20:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287728277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369885035] [2025-01-10 01:20:32,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:32,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:32,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:20:32,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:20:32,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:20:32,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:20:32,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:32,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:32,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:20:32,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:20:32,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:20:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369885035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:32,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:20:32,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:20:32,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267970342] [2025-01-10 01:20:32,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:32,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:20:32,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:32,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:20:32,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:20:32,677 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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-01-10 01:20:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:32,714 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-01-10 01:20:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:20:32,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-10 01:20:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:32,714 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:20:32,715 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:20:32,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:20:32,715 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:32,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:20:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-10 01:20:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-01-10 01:20:32,718 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2025-01-10 01:20:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:32,718 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-01-10 01:20:32,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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-01-10 01:20:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-01-10 01:20:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:20:32,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:32,719 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:32,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:20:32,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:20:32,919 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:32,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2069680007, now seen corresponding path program 1 times [2025-01-10 01:20:32,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:32,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800334978] [2025-01-10 01:20:32,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:32,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:20:32,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:20:32,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:32,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:20:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:32,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800334978] [2025-01-10 01:20:32,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800334978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:32,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531215053] [2025-01-10 01:20:32,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:32,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:32,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:32,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:20:32,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:20:33,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:20:33,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:20:33,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:33,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:33,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:20:33,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:20:33,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:20:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:20:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531215053] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:20:33,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:20:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:20:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74162198] [2025-01-10 01:20:33,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:20:33,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:20:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:33,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:20:33,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:20:33,091 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 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-01-10 01:20:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:33,140 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-01-10 01:20:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:20:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-10 01:20:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:33,140 INFO L225 Difference]: With dead ends: 51 [2025-01-10 01:20:33,140 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:20:33,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:20:33,141 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:33,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:20:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 01:20:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 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-01-10 01:20:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-01-10 01:20:33,144 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 34 [2025-01-10 01:20:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:33,144 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-01-10 01:20:33,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 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-01-10 01:20:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-01-10 01:20:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 01:20:33,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:33,145 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:33,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:20:33,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:33,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 01:20:33,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1977498277, now seen corresponding path program 2 times [2025-01-10 01:20:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543817546] [2025-01-10 01:20:33,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:20:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:33,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-10 01:20:33,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 49 statements. [2025-01-10 01:20:33,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:20:33,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 01:20:33,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543817546] [2025-01-10 01:20:33,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543817546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870129618] [2025-01-10 01:20:33,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:20:33,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:33,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:33,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:20:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:20:33,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-10 01:20:33,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 49 statements. [2025-01-10 01:20:33,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:20:33,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:33,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:20:33,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 01:20:33,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:20:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 01:20:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870129618] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:20:33,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:20:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 01:20:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897605723] [2025-01-10 01:20:33,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:20:33,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:20:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:33,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:20:33,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:20:33,605 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 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-01-10 01:20:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:33,700 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2025-01-10 01:20:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:20:33,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-01-10 01:20:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:33,701 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:20:33,701 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:20:33,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:20:33,701 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:33,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 21 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:20:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:20:33,702 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-01-10 01:20:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:20:33,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2025-01-10 01:20:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:33,702 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:20:33,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 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-01-10 01:20:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:20:33,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:20:33,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 01:20:33,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 01:20:33,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 01:20:33,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 01:20:33,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 01:20:33,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 01:20:33,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 01:20:33,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 01:20:33,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 01:20:33,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 01:20:33,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 01:20:33,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 01:20:33,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:20:33,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:33,909 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:33,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:20:33,998 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:20:34,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:20:34 BoogieIcfgContainer [2025-01-10 01:20:34,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:20:34,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:20:34,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:20:34,014 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:20:34,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:20:31" (3/4) ... [2025-01-10 01:20:34,016 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:20:34,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 01:20:34,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:20:34,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:20:34,030 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:20:34,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:20:34,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:20:34,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:20:34,092 INFO L158 Benchmark]: Toolchain (without parser) took 3268.08ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 95.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:20:34,092 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:20:34,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.05ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 99.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:20:34,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.62ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.8MB in the end (delta: 953.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:20:34,093 INFO L158 Benchmark]: Boogie Preprocessor took 22.76ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:20:34,093 INFO L158 Benchmark]: RCFGBuilder took 216.21ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 85.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:20:34,093 INFO L158 Benchmark]: TraceAbstraction took 2761.00ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 101.2MB in the end (delta: -16.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:20:34,093 INFO L158 Benchmark]: Witness Printer took 77.39ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 95.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:20:34,094 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.05ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 99.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.62ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.8MB in the end (delta: 953.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.76ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 216.21ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 85.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2761.00ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 101.2MB in the end (delta: -16.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 77.39ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 95.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 230 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 491 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 227 mSDtfsCounter, 491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=12, InterpolantAutomatonStates: 62, 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, 13 MinimizatonAttempts, 13 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 366 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 901 SizeOfPredicates, 2 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 190/257 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 12 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((2 <= SIZE) && (i <= 2147483648)) && (SIZE <= 99999)) && (MAX <= 100000)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((1 <= i) && (2 <= SIZE)) && (i <= 2147483646)) && (SIZE <= 99999)) && (MAX <= 100000)) || ((((i == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:20:34,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE