./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b855c2333aba0768da7f98c0f43af3ba5efb2578eeec0e9146f1a7f4f307c07a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:38:02,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:38:02,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:38:02,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:38:02,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:38:02,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:38:02,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:38:02,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:38:02,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:38:02,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:38:02,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:38:02,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:38:02,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:38:02,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:38:02,563 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:38:02,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:38:02,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:38:02,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:38:02,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:38:02,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:38:02,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:38:02,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:38:02,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:38:02,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:02,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:38:02,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:38:02,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:38:02,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:38:02,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:38:02,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:38:02,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:38:02,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:38:02,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:38:02,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:38:02,566 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b855c2333aba0768da7f98c0f43af3ba5efb2578eeec0e9146f1a7f4f307c07a [2025-03-17 14:38:02,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:38:02,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:38:02,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:38:02,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:38:02,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:38:02,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2025-03-17 14:38:03,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd357b7f/c1b8e8db7f1d49eab788a4a7b81b1229/FLAG9400aab1e [2025-03-17 14:38:04,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:38:04,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2025-03-17 14:38:04,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd357b7f/c1b8e8db7f1d49eab788a4a7b81b1229/FLAG9400aab1e [2025-03-17 14:38:04,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd357b7f/c1b8e8db7f1d49eab788a4a7b81b1229 [2025-03-17 14:38:04,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:38:04,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:38:04,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:04,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:38:04,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:38:04,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4c90b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04, skipping insertion in model container [2025-03-17 14:38:04,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:38:04,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:04,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:38:04,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:04,591 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:38:04,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04 WrapperNode [2025-03-17 14:38:04,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:04,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:04,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:38:04,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:38:04,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,621 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2025-03-17 14:38:04,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:04,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:38:04,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:38:04,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:38:04,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,638 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 1 writes are split as follows [0, 1]. [2025-03-17 14:38:04,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,642 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:38:04,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:38:04,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:38:04,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:38:04,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (1/1) ... [2025-03-17 14:38:04,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:04,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:04,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:38:04,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:38:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:38:04,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:38:04,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:38:04,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:38:04,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:38:04,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:38:04,879 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-17 14:38:04,887 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 14:38:04,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:38:04,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:38:04,896 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:38:04,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:04 BoogieIcfgContainer [2025-03-17 14:38:04,900 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:38:04,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:38:04,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:38:04,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:38:04,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:38:04" (1/3) ... [2025-03-17 14:38:04,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dc5955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:04, skipping insertion in model container [2025-03-17 14:38:04,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:04" (2/3) ... [2025-03-17 14:38:04,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dc5955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:04, skipping insertion in model container [2025-03-17 14:38:04,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:04" (3/3) ... [2025-03-17 14:38:04,910 INFO L128 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2025-03-17 14:38:04,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:38:04,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_of_struct_ptr_flag_init.i that has 1 procedures, 27 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-17 14:38:04,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:38:04,982 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;@6037120d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:38:04,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:38:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 20 states have (on average 1.65) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:38:04,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:04,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:38:04,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:04,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash 62527, now seen corresponding path program 1 times [2025-03-17 14:38:04,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:04,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692543609] [2025-03-17 14:38:05,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:05,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:38:05,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:38:05,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:05,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:05,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692543609] [2025-03-17 14:38:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692543609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:05,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:05,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:05,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617401175] [2025-03-17 14:38:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:05,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:05,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:05,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:05,208 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.65) internal successors, (33), 26 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) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:05,239 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-17 14:38:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:05,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 14:38:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:05,246 INFO L225 Difference]: With dead ends: 40 [2025-03-17 14:38:05,246 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 14:38:05,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-03-17 14:38:05,252 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:05,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 14:38:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 14:38:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-17 14:38:05,279 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 3 [2025-03-17 14:38:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:05,280 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-17 14:38:05,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-17 14:38:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:38:05,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:05,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:38:05,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:38:05,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:05,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1938335, now seen corresponding path program 1 times [2025-03-17 14:38:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813359932] [2025-03-17 14:38:05,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:05,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:38:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:38:05,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:05,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813359932] [2025-03-17 14:38:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813359932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919911878] [2025-03-17 14:38:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:05,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:05,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:05,386 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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-03-17 14:38:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:05,401 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-17 14:38:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:05,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-03-17 14:38:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:05,402 INFO L225 Difference]: With dead ends: 25 [2025-03-17 14:38:05,402 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 14:38:05,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-03-17 14:38:05,403 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:05,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 14:38:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 14:38:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-17 14:38:05,406 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 4 [2025-03-17 14:38:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:05,406 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-17 14:38:05,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-03-17 14:38:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-03-17 14:38:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:05,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:05,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:05,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:38:05,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1857999096, now seen corresponding path program 1 times [2025-03-17 14:38:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98938895] [2025-03-17 14:38:05,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:05,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:05,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:05,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:05,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:05,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:05,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98938895] [2025-03-17 14:38:05,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98938895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:05,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:05,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:05,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538508784] [2025-03-17 14:38:05,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:05,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:05,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:05,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:05,454 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:05,497 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-17 14:38:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:05,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:38:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:05,498 INFO L225 Difference]: With dead ends: 45 [2025-03-17 14:38:05,498 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 14:38:05,498 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-03-17 14:38:05,499 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:05,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 14:38:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2025-03-17 14:38:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-17 14:38:05,502 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 6 [2025-03-17 14:38:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:05,502 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-17 14:38:05,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-17 14:38:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:38:05,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:05,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 14:38:05,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:38:05,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:05,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1910365057, now seen corresponding path program 1 times [2025-03-17 14:38:05,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:05,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955344925] [2025-03-17 14:38:05,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:05,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:38:05,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:38:05,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:05,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:05,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955344925] [2025-03-17 14:38:05,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955344925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877732720] [2025-03-17 14:38:05,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:05,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:05,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:05,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:05,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:38:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:38:05,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:38:05,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:05,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:05,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:05,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:05,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877732720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:05,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:05,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:38:05,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949155167] [2025-03-17 14:38:05,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:05,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:38:05,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:05,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:38:05,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:05,768 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:05,815 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2025-03-17 14:38:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:38:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:38:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:05,817 INFO L225 Difference]: With dead ends: 39 [2025-03-17 14:38:05,817 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 14:38:05,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:05,818 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:05,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 14:38:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 14:38:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2025-03-17 14:38:05,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 7 [2025-03-17 14:38:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:05,824 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-03-17 14:38:05,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2025-03-17 14:38:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:38:05,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:05,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:38:05,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:38:06,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:06,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:06,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1365762407, now seen corresponding path program 1 times [2025-03-17 14:38:06,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:06,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980113925] [2025-03-17 14:38:06,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:06,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:06,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:38:06,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:38:06,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:06,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:06,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980113925] [2025-03-17 14:38:06,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980113925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:06,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:06,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:06,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697079738] [2025-03-17 14:38:06,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:06,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:06,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:06,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:06,105 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:06,113 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2025-03-17 14:38:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 11 [2025-03-17 14:38:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:06,116 INFO L225 Difference]: With dead ends: 59 [2025-03-17 14:38:06,116 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 14:38:06,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:06,130 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:06,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 14:38:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 14:38:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-17 14:38:06,137 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 11 [2025-03-17 14:38:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:06,139 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-17 14:38:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-17 14:38:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:38:06,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:06,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:06,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:38:06,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:06,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash -317483913, now seen corresponding path program 1 times [2025-03-17 14:38:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150643102] [2025-03-17 14:38:06,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:06,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:38:06,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:38:06,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:06,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150643102] [2025-03-17 14:38:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150643102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121186978] [2025-03-17 14:38:06,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:06,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:06,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:06,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:06,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:38:06,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:38:06,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:38:06,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:06,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:06,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:38:06,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:06,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121186978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:06,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:06,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 14:38:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199723541] [2025-03-17 14:38:06,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:06,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:38:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:06,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:38:06,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:38:06,437 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:06,483 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-03-17 14:38:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:38:06,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 14 [2025-03-17 14:38:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:06,484 INFO L225 Difference]: With dead ends: 59 [2025-03-17 14:38:06,484 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 14:38:06,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:38:06,485 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:06,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 14:38:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 14:38:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-17 14:38:06,494 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 14 [2025-03-17 14:38:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:06,494 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-17 14:38:06,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-17 14:38:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:38:06,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:06,495 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2025-03-17 14:38:06,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:06,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 14:38:06,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:06,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 95403295, now seen corresponding path program 2 times [2025-03-17 14:38:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225726772] [2025-03-17 14:38:06,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:06,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 14:38:06,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-17 14:38:06,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:06,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:38:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:06,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225726772] [2025-03-17 14:38:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225726772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:06,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867398464] [2025-03-17 14:38:06,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:06,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:06,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:06,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:06,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:38:06,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 14:38:06,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-17 14:38:06,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:06,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:06,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:06,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:38:06,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:38:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867398464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:06,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:38:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092717715] [2025-03-17 14:38:06,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:06,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:38:06,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:06,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:38:06,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:38:06,860 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:06,875 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-03-17 14:38:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 14:38:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:06,876 INFO L225 Difference]: With dead ends: 38 [2025-03-17 14:38:06,876 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 14:38:06,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:06,877 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 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-03-17 14:38:06,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 14:38:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-03-17 14:38:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 31 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-03-17 14:38:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-17 14:38:06,882 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 16 [2025-03-17 14:38:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:06,883 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-17 14:38:06,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-17 14:38:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:38:06,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:06,883 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:38:06,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:38:07,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:07,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:07,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1564737847, now seen corresponding path program 2 times [2025-03-17 14:38:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:07,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653120185] [2025-03-17 14:38:07,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:07,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:07,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 14:38:07,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:38:07,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:38:07,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:38:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653120185] [2025-03-17 14:38:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653120185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996452468] [2025-03-17 14:38:07,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:07,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:07,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:07,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:07,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:38:07,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 14:38:07,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:38:07,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:38:07,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:07,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:38:07,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:07,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:07,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996452468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:07,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:07,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 20 [2025-03-17 14:38:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928362751] [2025-03-17 14:38:07,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:07,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:38:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:07,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:38:07,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:38:07,529 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:07,661 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2025-03-17 14:38:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 14:38:07,661 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 14:38:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:07,662 INFO L225 Difference]: With dead ends: 69 [2025-03-17 14:38:07,662 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 14:38:07,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:38:07,663 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:07,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 152 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 14:38:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2025-03-17 14:38:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-17 14:38:07,666 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2025-03-17 14:38:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-17 14:38:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-17 14:38:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 14:38:07,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:07,667 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:07,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:38:07,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:07,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:07,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2120342122, now seen corresponding path program 1 times [2025-03-17 14:38:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:07,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10774991] [2025-03-17 14:38:07,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:07,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:07,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:38:07,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:38:07,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:07,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 14:38:07,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10774991] [2025-03-17 14:38:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10774991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275587778] [2025-03-17 14:38:07,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:07,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:07,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:07,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:07,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:38:08,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:38:08,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:38:08,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:08,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:08,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:38:08,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:38:08,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:38:08,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275587778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:08,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:08,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 16] total 35 [2025-03-17 14:38:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771346023] [2025-03-17 14:38:08,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:08,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 14:38:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:08,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 14:38:08,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 14:38:08,616 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:08,721 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2025-03-17 14:38:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 14:38:08,721 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 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-03-17 14:38:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:08,722 INFO L225 Difference]: With dead ends: 95 [2025-03-17 14:38:08,722 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:38:08,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 14:38:08,723 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:08,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:38:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2025-03-17 14:38:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.123076923076923) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2025-03-17 14:38:08,728 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 33 [2025-03-17 14:38:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:08,728 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2025-03-17 14:38:08,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2025-03-17 14:38:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 14:38:08,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:08,729 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:38:08,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:38:08,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:08,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1247607070, now seen corresponding path program 1 times [2025-03-17 14:38:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114001902] [2025-03-17 14:38:08,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:08,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:38:08,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:38:08,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:08,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-17 14:38:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114001902] [2025-03-17 14:38:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114001902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:09,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:09,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635915207] [2025-03-17 14:38:09,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:09,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:09,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:09,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:09,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:09,047 INFO L87 Difference]: Start difference. First operand 68 states and 73 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-03-17 14:38:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:09,067 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2025-03-17 14:38:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:09,068 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 57 [2025-03-17 14:38:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:09,068 INFO L225 Difference]: With dead ends: 69 [2025-03-17 14:38:09,069 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 14:38:09,069 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-03-17 14:38:09,070 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:09,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 14:38:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-17 14:38:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2025-03-17 14:38:09,074 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 57 [2025-03-17 14:38:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:09,074 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2025-03-17 14:38:09,075 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-03-17 14:38:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2025-03-17 14:38:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 14:38:09,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:09,077 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:09,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:38:09,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:09,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash -396832909, now seen corresponding path program 2 times [2025-03-17 14:38:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661236274] [2025-03-17 14:38:09,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:09,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-17 14:38:09,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 62 statements. [2025-03-17 14:38:09,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:09,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-17 14:38:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661236274] [2025-03-17 14:38:09,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661236274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:09,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:09,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:09,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550329929] [2025-03-17 14:38:09,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:09,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:09,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:09,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:09,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:09,126 INFO L87 Difference]: Start difference. First operand 67 states and 72 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-03-17 14:38:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:09,148 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-17 14:38:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:09,148 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 62 [2025-03-17 14:38:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:09,149 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:38:09,149 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 14:38:09,149 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-03-17 14:38:09,149 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:09,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 14:38:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 14:38:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-03-17 14:38:09,155 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 62 [2025-03-17 14:38:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:09,157 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-03-17 14:38:09,157 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-03-17 14:38:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-03-17 14:38:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 14:38:09,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:09,158 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:09,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:38:09,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:09,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:09,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1936106192, now seen corresponding path program 1 times [2025-03-17 14:38:09,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:09,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127617598] [2025-03-17 14:38:09,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:09,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 14:38:09,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 14:38:09,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:09,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:38:09,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:09,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127617598] [2025-03-17 14:38:09,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127617598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:09,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676701745] [2025-03-17 14:38:09,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:09,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:09,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:09,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:09,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:38:10,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 14:38:10,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 14:38:10,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:10,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:10,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 14:38:10,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:38:10,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:38:11,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676701745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:11,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:11,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2025-03-17 14:38:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198512596] [2025-03-17 14:38:11,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:11,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-03-17 14:38:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:11,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-03-17 14:38:11,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=6850, Unknown=0, NotChecked=0, Total=8930 [2025-03-17 14:38:11,659 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:11,838 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2025-03-17 14:38:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-17 14:38:11,838 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 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 67 [2025-03-17 14:38:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:11,839 INFO L225 Difference]: With dead ends: 149 [2025-03-17 14:38:11,839 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 14:38:11,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4799 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=6850, Unknown=0, NotChecked=0, Total=8930 [2025-03-17 14:38:11,842 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:11,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 14:38:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 14:38:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.0666666666666667) internal successors, (128), 121 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2025-03-17 14:38:11,854 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 67 [2025-03-17 14:38:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:11,854 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2025-03-17 14:38:11,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2025-03-17 14:38:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 14:38:11,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:11,856 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:11,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:12,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:12,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:12,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:12,057 INFO L85 PathProgramCache]: Analyzing trace with hash -525240528, now seen corresponding path program 2 times [2025-03-17 14:38:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:12,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099563244] [2025-03-17 14:38:12,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:12,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-17 14:38:12,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 14:38:12,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:38:12,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-03-17 14:38:12,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099563244] [2025-03-17 14:38:12,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099563244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059175297] [2025-03-17 14:38:12,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:12,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:12,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:12,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:12,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:38:12,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-17 14:38:12,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 14:38:12,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:38:12,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-17 14:38:12,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:38:13,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:38:16,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059175297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:16,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:16,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 64, 64] total 132 [2025-03-17 14:38:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794344868] [2025-03-17 14:38:16,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:16,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-03-17 14:38:16,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:16,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-03-17 14:38:16,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4168, Invalid=13124, Unknown=0, NotChecked=0, Total=17292 [2025-03-17 14:38:16,474 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 132 states, 132 states have (on average 1.6818181818181819) internal successors, (222), 132 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:16,821 INFO L93 Difference]: Finished difference Result 244 states and 288 transitions. [2025-03-17 14:38:16,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-17 14:38:16,822 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.6818181818181819) internal successors, (222), 132 states have internal predecessors, (222), 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 115 [2025-03-17 14:38:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:16,823 INFO L225 Difference]: With dead ends: 244 [2025-03-17 14:38:16,823 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 14:38:16,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4773 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4168, Invalid=13124, Unknown=0, NotChecked=0, Total=17292 [2025-03-17 14:38:16,828 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:16,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 159 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:38:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 14:38:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-17 14:38:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.0324074074074074) internal successors, (223), 216 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 223 transitions. [2025-03-17 14:38:16,845 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 223 transitions. Word has length 115 [2025-03-17 14:38:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:16,845 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 223 transitions. [2025-03-17 14:38:16,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.6818181818181819) internal successors, (222), 132 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 223 transitions. [2025-03-17 14:38:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-17 14:38:16,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:16,848 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:38:16,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:38:17,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:17,052 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:38:17,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1273477814, now seen corresponding path program 1 times [2025-03-17 14:38:17,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:17,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646656162] [2025-03-17 14:38:17,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:17,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:17,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 14:38:17,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 14:38:17,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:17,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5934 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2025-03-17 14:38:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646656162] [2025-03-17 14:38:17,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646656162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:17,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:17,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421729881] [2025-03-17 14:38:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:17,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:17,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:17,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:17,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:17,310 INFO L87 Difference]: Start difference. First operand 217 states and 223 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-03-17 14:38:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:17,329 INFO L93 Difference]: Finished difference Result 217 states and 223 transitions. [2025-03-17 14:38:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:17,329 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 212 [2025-03-17 14:38:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:17,330 INFO L225 Difference]: With dead ends: 217 [2025-03-17 14:38:17,330 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:38:17,330 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-03-17 14:38:17,331 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:17,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:38:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:38:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:38:17,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2025-03-17 14:38:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:17,332 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:38:17,332 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-03-17 14:38:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:38:17,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:38:17,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 14:38:17,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 14:38:17,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 14:38:17,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 14:38:17,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 14:38:17,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 14:38:17,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:38:17,338 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:17,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:38:17,817 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:38:17,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:38:17 BoogieIcfgContainer [2025-03-17 14:38:17,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:38:17,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:38:17,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:38:17,826 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:38:17,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:04" (3/4) ... [2025-03-17 14:38:17,827 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:38:17,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 14:38:17,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 14:38:17,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:38:17,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:38:17,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:38:17,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:38:17,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:38:17,891 INFO L158 Benchmark]: Toolchain (without parser) took 13460.42ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.8MB in the beginning and 180.4MB in the end (delta: -56.6MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2025-03-17 14:38:17,891 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:17,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.26ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:17,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.26ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:17,892 INFO L158 Benchmark]: Boogie Preprocessor took 21.01ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:17,892 INFO L158 Benchmark]: IcfgBuilder took 251.42ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 96.9MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:38:17,893 INFO L158 Benchmark]: TraceAbstraction took 12923.48ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 96.2MB in the beginning and 184.8MB in the end (delta: -88.6MB). Peak memory consumption was 166.6MB. Max. memory is 16.1GB. [2025-03-17 14:38:17,893 INFO L158 Benchmark]: Witness Printer took 65.01ms. Allocated memory is still 335.5MB. Free memory was 184.8MB in the beginning and 180.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:17,895 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.13ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.26ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.26ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.01ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 251.42ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 96.9MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12923.48ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 96.2MB in the beginning and 184.8MB in the end (delta: -88.6MB). Peak memory consumption was 166.6MB. Max. memory is 16.1GB. * Witness Printer took 65.01ms. Allocated memory is still 335.5MB. Free memory was 184.8MB in the beginning and 180.4MB in the end (delta: 4.4MB). 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: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: 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, 27 locations, 33 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 14, TraceHistogramMax: 63, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 1286 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1035 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1163 IncrementalHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 251 mSDtfsCounter, 1163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9901 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=13, InterpolantAutomatonStates: 295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 899 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1143 ConstructedInterpolants, 0 QuantifiedInterpolants, 3321 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2226 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 8268/12319 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 6 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((size <= 100000) && (0 <= i)) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:38:17,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE