./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_compareModified_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_compareModified_ground.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 ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:21:36,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:21:36,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:21:36,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:21:36,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:21:36,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:21:36,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:21:36,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:21:36,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:21:36,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:21:36,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:21:36,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:21:36,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:21:36,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:21:36,854 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:21:36,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:21:36,855 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:21:36,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:21:36,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:21:36,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:21:36,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:21:36,857 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:21:36,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:21:36,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:21:36,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:21:36,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:21:36,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:21:36,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:21:36,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:21:36,858 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 -> ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e [2025-03-04 10:21:37,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:21:37,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:21:37,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:21:37,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:21:37,110 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:21:37,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2025-03-04 10:21:38,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581bd269d/59a4687bceb34b2bb469abad9bb85a57/FLAGb0eef7654 [2025-03-04 10:21:38,535 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:21:38,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2025-03-04 10:21:38,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581bd269d/59a4687bceb34b2bb469abad9bb85a57/FLAGb0eef7654 [2025-03-04 10:21:38,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581bd269d/59a4687bceb34b2bb469abad9bb85a57 [2025-03-04 10:21:38,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:21:38,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:21:38,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:21:38,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:21:38,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:21:38,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a3d967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38, skipping insertion in model container [2025-03-04 10:21:38,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:21:38,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:21:38,710 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:21:38,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:21:38,745 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:21:38,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38 WrapperNode [2025-03-04 10:21:38,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:21:38,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:21:38,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:21:38,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:21:38,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,774 INFO L138 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2025-03-04 10:21:38,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:21:38,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:21:38,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:21:38,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:21:38,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,798 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 3, 5]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2025-03-04 10:21:38,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:21:38,813 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:21:38,813 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:21:38,813 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:21:38,814 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (1/1) ... [2025-03-04 10:21:38,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:21:38,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:38,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:21:38,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:21:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:21:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:21:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:21:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:21:38,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:21:38,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:21:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:21:38,929 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:21:38,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:21:39,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-04 10:21:39,088 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 10:21:39,088 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:21:39,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:21:39,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:21:39,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:21:39 BoogieIcfgContainer [2025-03-04 10:21:39,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:21:39,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:21:39,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:21:39,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:21:39,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:21:38" (1/3) ... [2025-03-04 10:21:39,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705a938b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:21:39, skipping insertion in model container [2025-03-04 10:21:39,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:21:38" (2/3) ... [2025-03-04 10:21:39,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705a938b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:21:39, skipping insertion in model container [2025-03-04 10:21:39,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:21:39" (3/3) ... [2025-03-04 10:21:39,102 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_compareModified_ground.i [2025-03-04 10:21:39,113 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:21:39,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_compareModified_ground.i that has 2 procedures, 40 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-04 10:21:39,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:21:39,166 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;@4a9d2997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:21:39,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:21:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:21:39,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:39,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:21:39,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:39,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2092287, now seen corresponding path program 1 times [2025-03-04 10:21:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317961269] [2025-03-04 10:21:39,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:39,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:21:39,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:21:39,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:39,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:21:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317961269] [2025-03-04 10:21:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317961269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:39,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:21:39,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:21:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064685630] [2025-03-04 10:21:39,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:39,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:21:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:39,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:21:39,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:21:39,426 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-04 10:21:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:39,471 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2025-03-04 10:21:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:21:39,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-04 10:21:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:39,477 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:21:39,477 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:21:39,480 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-04 10:21:39,483 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:39,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:21:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 10:21:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.5) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-04 10:21:39,515 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 4 [2025-03-04 10:21:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:39,516 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-04 10:21:39,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-04 10:21:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-04 10:21:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:21:39,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:39,517 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:21:39,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:21:39,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2093185311, now seen corresponding path program 1 times [2025-03-04 10:21:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111375860] [2025-03-04 10:21:39,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:21:39,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:21:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:21:39,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111375860] [2025-03-04 10:21:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111375860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700518856] [2025-03-04 10:21:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:39,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:39,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:39,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:21:39,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:21:39,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:21:39,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:39,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:39,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:21:39,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:21:39,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:21:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700518856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:39,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:21:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:21:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644995234] [2025-03-04 10:21:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:39,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:21:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:39,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:21:39,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:21:39,773 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:39,818 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-04 10:21:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:21:39,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:21:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:39,820 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:21:39,820 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:21:39,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:21:39,821 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:39,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:21:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:21:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-04 10:21:39,825 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 7 [2025-03-04 10:21:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:39,825 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-04 10:21:39,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-04 10:21:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:21:39,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:39,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 10:21:39,832 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-04 10:21:40,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:40,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:40,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash -464235199, now seen corresponding path program 1 times [2025-03-04 10:21:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:40,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243889033] [2025-03-04 10:21:40,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:40,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:21:40,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:21:40,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:40,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:40,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243889033] [2025-03-04 10:21:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243889033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:40,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:21:40,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:21:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598417444] [2025-03-04 10:21:40,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:40,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:21:40,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:40,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:21:40,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:21:40,075 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:40,085 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-03-04 10:21:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:21:40,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:21:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:40,087 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:21:40,087 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:21:40,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:21:40,088 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 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-04 10:21:40,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:21:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-04 10:21:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-04 10:21:40,093 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 8 [2025-03-04 10:21:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:40,093 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-04 10:21:40,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-03-04 10:21:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:21:40,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:40,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:40,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:21:40,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash 541831834, now seen corresponding path program 1 times [2025-03-04 10:21:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:40,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69329821] [2025-03-04 10:21:40,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:40,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:21:40,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:21:40,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:40,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:21:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69329821] [2025-03-04 10:21:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69329821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927567254] [2025-03-04 10:21:40,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:40,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:40,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:40,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:40,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:21:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:21:40,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:21:40,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:40,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:40,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:21:40,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:40,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:21:40,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927567254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:40,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:21:40,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:21:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77012777] [2025-03-04 10:21:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:40,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:21:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:40,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:21:40,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:21:40,248 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:40,263 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-04 10:21:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:21:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:21:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:40,264 INFO L225 Difference]: With dead ends: 33 [2025-03-04 10:21:40,264 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:21:40,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:21:40,264 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:40,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:21:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 10:21:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-04 10:21:40,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 10 [2025-03-04 10:21:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:40,271 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-04 10:21:40,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-04 10:21:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:21:40,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:40,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:40,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:21:40,472 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,SelfDestructingSolverStorable3 [2025-03-04 10:21:40,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:40,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash -383082337, now seen corresponding path program 1 times [2025-03-04 10:21:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:40,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600095242] [2025-03-04 10:21:40,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:40,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:40,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:21:40,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:21:40,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:40,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:21:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600095242] [2025-03-04 10:21:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600095242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276579589] [2025-03-04 10:21:40,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:40,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:40,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:40,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:40,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:21:40,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:21:40,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:21:40,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:40,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:40,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:21:40,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:40,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:21:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276579589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:21:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:21:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129113077] [2025-03-04 10:21:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:40,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:21:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:40,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:21:40,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:21:40,600 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:40,617 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-03-04 10:21:40,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:21:40,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:21:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:40,619 INFO L225 Difference]: With dead ends: 58 [2025-03-04 10:21:40,620 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:21:40,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:21:40,620 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:40,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:21:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 10:21:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-04 10:21:40,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2025-03-04 10:21:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:40,623 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-04 10:21:40,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-04 10:21:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:21:40,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:40,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:40,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:21:40,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:40,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1472919070, now seen corresponding path program 1 times [2025-03-04 10:21:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767605852] [2025-03-04 10:21:40,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:40,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:21:40,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:21:40,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:40,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:21:40,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767605852] [2025-03-04 10:21:40,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767605852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577926899] [2025-03-04 10:21:40,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:40,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:40,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:40,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:40,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:21:40,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:21:40,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:21:40,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:40,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:40,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:21:40,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:21:40,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:21:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577926899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:40,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:21:40,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:21:40,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71747173] [2025-03-04 10:21:40,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:40,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:21:40,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:40,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:21:40,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:21:40,938 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:40,951 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-03-04 10:21:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:21:40,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 10:21:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:40,952 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:21:40,952 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:21:40,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:21:40,953 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:40,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:21:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-03-04 10:21:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.36) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-04 10:21:40,959 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2025-03-04 10:21:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:40,960 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-04 10:21:40,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:21:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-04 10:21:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:21:40,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:40,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:40,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:21:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:41,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:41,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1494040414, now seen corresponding path program 1 times [2025-03-04 10:21:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839037347] [2025-03-04 10:21:41,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:41,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:21:41,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:21:41,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:41,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:41,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:41,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839037347] [2025-03-04 10:21:41,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839037347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:41,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244832941] [2025-03-04 10:21:41,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:41,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:41,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:41,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:41,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:21:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:21:41,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:21:41,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:41,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:41,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:21:41,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:41,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:21:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244832941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:41,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:21:41,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-04 10:21:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613532881] [2025-03-04 10:21:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:41,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:21:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:41,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:21:41,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:21:41,293 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:21:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:41,300 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-03-04 10:21:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:21:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 10:21:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:41,303 INFO L225 Difference]: With dead ends: 57 [2025-03-04 10:21:41,303 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:21:41,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:21:41,304 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 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-04 10:21:41,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:21:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 10:21:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 34 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-04 10:21:41,306 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2025-03-04 10:21:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:41,306 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-04 10:21:41,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:21:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-04 10:21:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:21:41,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:41,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:41,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:21:41,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:41,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:41,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:41,508 INFO L85 PathProgramCache]: Analyzing trace with hash 988481789, now seen corresponding path program 1 times [2025-03-04 10:21:41,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:41,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543297582] [2025-03-04 10:21:41,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:41,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:41,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:21:41,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:21:41,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:41,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543297582] [2025-03-04 10:21:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543297582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435928328] [2025-03-04 10:21:41,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:41,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:41,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:41,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:41,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:21:41,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:21:41,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:21:41,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:41,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:41,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:21:41,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:41,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:21:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435928328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:21:41,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:21:41,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:21:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866260281] [2025-03-04 10:21:41,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:21:41,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:21:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:41,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:21:41,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:21:41,678 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:21:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:41,708 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-03-04 10:21:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:21:41,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 10:21:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:41,709 INFO L225 Difference]: With dead ends: 76 [2025-03-04 10:21:41,709 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 10:21:41,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:21:41,710 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:41,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 10:21:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 10:21:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 40 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:21:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-04 10:21:41,717 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 21 [2025-03-04 10:21:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-04 10:21:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:21:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-04 10:21:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:21:41,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:41,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:41,727 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-04 10:21:41,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:41,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash -216267715, now seen corresponding path program 2 times [2025-03-04 10:21:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336588598] [2025-03-04 10:21:41,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:21:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:41,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:21:41,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 27 statements. [2025-03-04 10:21:41,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:21:41,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:21:41,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336588598] [2025-03-04 10:21:41,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336588598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:41,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:21:41,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:21:41,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290105993] [2025-03-04 10:21:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:41,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:21:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:41,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:21:41,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:21:41,956 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:21:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:41,981 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-04 10:21:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:21:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 10:21:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:41,982 INFO L225 Difference]: With dead ends: 66 [2025-03-04 10:21:41,982 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 10:21:41,982 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-04 10:21:41,982 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:41,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 10:21:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2025-03-04 10:21:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 44 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:21:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2025-03-04 10:21:41,989 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 27 [2025-03-04 10:21:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:41,989 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2025-03-04 10:21:41,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:21:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2025-03-04 10:21:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:21:41,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:41,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:41,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:21:41,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:41,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 757614612, now seen corresponding path program 1 times [2025-03-04 10:21:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734736641] [2025-03-04 10:21:41,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:42,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:21:42,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:21:42,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:42,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:21:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734736641] [2025-03-04 10:21:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734736641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109444854] [2025-03-04 10:21:42,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:42,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:42,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:42,046 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:42,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:21:42,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:21:42,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:21:42,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:42,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:42,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:21:42,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:42,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:21:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:21:42,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109444854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:21:42,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:21:42,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2025-03-04 10:21:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582712014] [2025-03-04 10:21:42,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:21:42,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:21:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:42,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:21:42,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:21:42,266 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:21:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:42,439 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2025-03-04 10:21:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:21:42,440 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 10:21:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:42,441 INFO L225 Difference]: With dead ends: 115 [2025-03-04 10:21:42,441 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 10:21:42,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:21:42,442 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:42,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 248 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:21:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 10:21:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2025-03-04 10:21:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 65 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:21:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2025-03-04 10:21:42,449 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 28 [2025-03-04 10:21:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:42,450 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2025-03-04 10:21:42,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:21:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2025-03-04 10:21:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 10:21:42,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:42,452 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:42,460 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-04 10:21:42,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:42,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:42,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 812499509, now seen corresponding path program 2 times [2025-03-04 10:21:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:42,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821258583] [2025-03-04 10:21:42,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:21:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:42,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 10:21:42,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 45 statements. [2025-03-04 10:21:42,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:21:42,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 10:21:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821258583] [2025-03-04 10:21:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821258583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:21:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:21:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:21:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086578233] [2025-03-04 10:21:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:21:42,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:21:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:42,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:21:42,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:21:42,747 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:21:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:42,770 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-03-04 10:21:42,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:21:42,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-04 10:21:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:42,771 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:21:42,771 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 10:21:42,771 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-04 10:21:42,772 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:42,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:21:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 10:21:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-04 10:21:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:21:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2025-03-04 10:21:42,781 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 45 [2025-03-04 10:21:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:42,781 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2025-03-04 10:21:42,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:21:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2025-03-04 10:21:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:21:42,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:42,783 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:42,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:21:42,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:42,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1287722158, now seen corresponding path program 1 times [2025-03-04 10:21:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256055367] [2025-03-04 10:21:42,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:42,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:21:42,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:21:42,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:42,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-04 10:21:42,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:42,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256055367] [2025-03-04 10:21:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256055367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:42,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119222665] [2025-03-04 10:21:42,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:42,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:42,888 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:42,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:21:42,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:21:42,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:21:42,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:42,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:42,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:21:42,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:21:43,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:21:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:21:43,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119222665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:21:43,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:21:43,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 35 [2025-03-04 10:21:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869097421] [2025-03-04 10:21:43,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:21:43,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 10:21:43,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:43,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 10:21:43,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:21:43,379 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:21:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:43,816 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2025-03-04 10:21:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 10:21:43,817 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-03-04 10:21:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:43,817 INFO L225 Difference]: With dead ends: 168 [2025-03-04 10:21:43,817 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 10:21:43,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=855, Invalid=3177, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:21:43,819 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:43,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 278 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:21:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 10:21:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2025-03-04 10:21:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 100 states have (on average 1.14) internal successors, (114), 103 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:21:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2025-03-04 10:21:43,825 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 53 [2025-03-04 10:21:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:43,826 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2025-03-04 10:21:43,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:21:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2025-03-04 10:21:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 10:21:43,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:43,827 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:43,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:21:44,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:21:44,028 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:44,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash -979699886, now seen corresponding path program 2 times [2025-03-04 10:21:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:44,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398801973] [2025-03-04 10:21:44,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:21:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:44,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 10:21:44,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:21:44,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:21:44,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-04 10:21:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398801973] [2025-03-04 10:21:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398801973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205603263] [2025-03-04 10:21:44,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:21:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:44,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:44,222 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:44,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:21:44,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 10:21:44,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:21:44,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:21:44,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:44,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:21:44,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:21:44,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:21:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:21:45,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205603263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:21:45,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:21:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 68 [2025-03-04 10:21:45,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276665235] [2025-03-04 10:21:45,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:21:45,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-04 10:21:45,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:45,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-04 10:21:45,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1064, Invalid=3492, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:21:45,626 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 68 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 68 states have internal predecessors, (132), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:21:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:45,854 INFO L93 Difference]: Finished difference Result 217 states and 259 transitions. [2025-03-04 10:21:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-04 10:21:45,855 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 68 states have internal predecessors, (132), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-03-04 10:21:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:45,855 INFO L225 Difference]: With dead ends: 217 [2025-03-04 10:21:45,856 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 10:21:45,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1064, Invalid=3492, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:21:45,857 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:45,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 284 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:21:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 10:21:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-04 10:21:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 148 states have (on average 1.087837837837838) internal successors, (161), 150 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:21:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2025-03-04 10:21:45,865 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 82 [2025-03-04 10:21:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:45,865 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2025-03-04 10:21:45,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 68 states have internal predecessors, (132), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:21:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2025-03-04 10:21:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 10:21:45,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:45,866 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:45,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:21:46,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:21:46,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:46,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1449328567, now seen corresponding path program 1 times [2025-03-04 10:21:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:46,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604067789] [2025-03-04 10:21:46,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:46,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 10:21:46,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 10:21:46,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:46,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1434 trivial. 0 not checked. [2025-03-04 10:21:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604067789] [2025-03-04 10:21:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604067789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007552286] [2025-03-04 10:21:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:21:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:46,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:46,308 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:46,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:21:46,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 10:21:46,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 10:21:46,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:21:46,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:46,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 10:21:46,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:21:47,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:21:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:21:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007552286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:21:50,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:21:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 65, 65] total 132 [2025-03-04 10:21:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312173817] [2025-03-04 10:21:50,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:21:50,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-03-04 10:21:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:21:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-03-04 10:21:50,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4174, Invalid=13118, Unknown=0, NotChecked=0, Total=17292 [2025-03-04 10:21:50,223 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand has 132 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:21:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:21:54,233 INFO L93 Difference]: Finished difference Result 330 states and 393 transitions. [2025-03-04 10:21:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-04 10:21:54,234 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2025-03-04 10:21:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:21:54,235 INFO L225 Difference]: With dead ends: 330 [2025-03-04 10:21:54,235 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 10:21:54,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17613 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=12769, Invalid=53023, Unknown=0, NotChecked=0, Total=65792 [2025-03-04 10:21:54,244 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:21:54,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 317 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:21:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 10:21:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2025-03-04 10:21:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 254 states have (on average 1.0590551181102361) internal successors, (269), 256 states have internal predecessors, (269), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:21:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 277 transitions. [2025-03-04 10:21:54,262 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 277 transitions. Word has length 131 [2025-03-04 10:21:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:21:54,263 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 277 transitions. [2025-03-04 10:21:54,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:21:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 277 transitions. [2025-03-04 10:21:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 10:21:54,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:21:54,266 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:21:54,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:21:54,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:21:54,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:21:54,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:21:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1300750198, now seen corresponding path program 2 times [2025-03-04 10:21:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:21:54,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404419903] [2025-03-04 10:21:54,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:21:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:21:54,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 232 statements into 2 equivalence classes. [2025-03-04 10:21:54,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 10:21:54,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:21:54,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5960 trivial. 0 not checked. [2025-03-04 10:21:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:21:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404419903] [2025-03-04 10:21:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404419903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:21:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858951212] [2025-03-04 10:21:54,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:21:54,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:21:54,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:21:54,817 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:21:54,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:21:54,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 232 statements into 2 equivalence classes. [2025-03-04 10:21:55,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 10:21:55,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:21:55,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:21:55,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-04 10:21:55,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:21:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 10:21:59,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 10:22:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858951212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:08,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 129, 129] total 260 [2025-03-04 10:22:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687357900] [2025-03-04 10:22:08,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 260 states [2025-03-04 10:22:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:08,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2025-03-04 10:22:08,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16520, Invalid=50820, Unknown=0, NotChecked=0, Total=67340 [2025-03-04 10:22:08,647 INFO L87 Difference]: Start difference. First operand 262 states and 277 transitions. Second operand has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:22:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:09,312 INFO L93 Difference]: Finished difference Result 523 states and 617 transitions. [2025-03-04 10:22:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2025-03-04 10:22:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 232 [2025-03-04 10:22:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:09,314 INFO L225 Difference]: With dead ends: 523 [2025-03-04 10:22:09,314 INFO L226 Difference]: Without dead ends: 453 [2025-03-04 10:22:09,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19781 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=16520, Invalid=50820, Unknown=0, NotChecked=0, Total=67340 [2025-03-04 10:22:09,317 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:09,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 234 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:22:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-04 10:22:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-03-04 10:22:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 446 states have (on average 1.031390134529148) internal successors, (460), 447 states have internal predecessors, (460), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:22:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 468 transitions. [2025-03-04 10:22:09,330 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 468 transitions. Word has length 232 [2025-03-04 10:22:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:09,331 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 468 transitions. [2025-03-04 10:22:09,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:22:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 468 transitions. [2025-03-04 10:22:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 10:22:09,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:09,335 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:09,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:22:09,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:22:09,535 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:09,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1072137252, now seen corresponding path program 1 times [2025-03-04 10:22:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127831871] [2025-03-04 10:22:09,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:09,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 10:22:09,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 10:22:09,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:09,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 24173 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24169 trivial. 0 not checked. [2025-03-04 10:22:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:10,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127831871] [2025-03-04 10:22:10,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127831871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:10,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:10,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:10,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116927931] [2025-03-04 10:22:10,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:10,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:10,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:10,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:10,023 INFO L87 Difference]: Start difference. First operand 453 states and 468 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:10,047 INFO L93 Difference]: Finished difference Result 453 states and 468 transitions. [2025-03-04 10:22:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 424 [2025-03-04 10:22:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:10,050 INFO L225 Difference]: With dead ends: 453 [2025-03-04 10:22:10,051 INFO L226 Difference]: Without dead ends: 452 [2025-03-04 10:22:10,051 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-04 10:22:10,051 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 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-04 10:22:10,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-04 10:22:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2025-03-04 10:22:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 443 states have (on average 1.0293453724604966) internal successors, (456), 443 states have internal predecessors, (456), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:22:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 462 transitions. [2025-03-04 10:22:10,064 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 462 transitions. Word has length 424 [2025-03-04 10:22:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:10,065 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 462 transitions. [2025-03-04 10:22:10,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 462 transitions. [2025-03-04 10:22:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-04 10:22:10,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:10,068 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:10,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:22:10,068 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:10,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1724282672, now seen corresponding path program 1 times [2025-03-04 10:22:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:10,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856226607] [2025-03-04 10:22:10,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:10,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-04 10:22:10,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-04 10:22:10,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:10,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 24173 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24169 trivial. 0 not checked. [2025-03-04 10:22:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856226607] [2025-03-04 10:22:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856226607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616215961] [2025-03-04 10:22:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:10,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:10,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:10,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:10,518 INFO L87 Difference]: Start difference. First operand 448 states and 462 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:10,550 INFO L93 Difference]: Finished difference Result 448 states and 462 transitions. [2025-03-04 10:22:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 425 [2025-03-04 10:22:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:10,553 INFO L225 Difference]: With dead ends: 448 [2025-03-04 10:22:10,553 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:22:10,554 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-04 10:22:10,554 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 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-04 10:22:10,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:22:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:22:10,555 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-04 10:22:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:22:10,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 425 [2025-03-04 10:22:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:22:10,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:22:10,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:22:10,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 10:22:10,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 10:22:10,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 10:22:10,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 10:22:10,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 10:22:10,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 10:22:10,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 10:22:10,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 10:22:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:22:10,563 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:10,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:22:11,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:22:11,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:22:11 BoogieIcfgContainer [2025-03-04 10:22:11,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:22:11,587 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:22:11,587 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:22:11,587 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:22:11,587 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:21:39" (3/4) ... [2025-03-04 10:22:11,589 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:22:11,593 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:22:11,595 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 10:22:11,595 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:22:11,595 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:22:11,595 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:22:11,651 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:22:11,652 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:22:11,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:22:11,652 INFO L158 Benchmark]: Toolchain (without parser) took 33097.89ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 122.1MB in the beginning and 204.6MB in the end (delta: -82.5MB). Peak memory consumption was 176.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:11,652 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:22:11,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.34ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 110.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:11,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.21ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:22:11,653 INFO L158 Benchmark]: Boogie Preprocessor took 36.31ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 108.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:11,653 INFO L158 Benchmark]: IcfgBuilder took 282.53ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 94.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:11,653 INFO L158 Benchmark]: TraceAbstraction took 32489.71ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 93.6MB in the beginning and 209.0MB in the end (delta: -115.3MB). Peak memory consumption was 247.7MB. Max. memory is 16.1GB. [2025-03-04 10:22:11,653 INFO L158 Benchmark]: Witness Printer took 64.84ms. Allocated memory is still 427.8MB. Free memory was 209.0MB in the beginning and 204.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:11,656 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.76ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.34ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 110.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.21ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.31ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 108.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 282.53ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 94.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 32489.71ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 93.6MB in the beginning and 209.0MB in the end (delta: -115.3MB). Peak memory consumption was 247.7MB. Max. memory is 16.1GB. * Witness Printer took 64.84ms. Allocated memory is still 427.8MB. Free memory was 209.0MB in the beginning and 204.6MB in the end (delta: 4.3MB). 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: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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 2 procedures, 40 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 17, TraceHistogramMax: 127, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 2354 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1824 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1443 IncrementalHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 530 mSDtfsCounter, 1443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1381 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 711 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39618 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=15, InterpolantAutomatonStates: 556, 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, 17 MinimizatonAttempts, 37 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 2157 NumberOfCodeBlocks, 2112 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2670 ConstructedInterpolants, 0 QuantifiedInterpolants, 4640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3527 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 56516/72079 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 8 specifications checked. All of them hold - InvariantResult [Line: 41]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((i == 0) && (j == 0)) || ((i == 0) && (1 <= j))) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:22:11,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE