./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/who-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/who-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash e0b6053e1bcaf28528cb48e3712d575ac5a666d224e39ce4315a9d6b0f4fb21c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:00:43,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:00:43,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 19:00:43,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:00:43,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:00:43,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:00:43,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:00:43,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:00:43,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:00:43,586 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:00:43,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:00:43,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:00:43,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:00:43,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:00:43,586 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:00:43,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:00:43,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:00:43,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:00:43,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:00:43,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:00:43,588 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:00:43,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:00:43,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:00:43,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:00:43,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:00:43,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:00:43,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:00:43,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:00:43,589 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0b6053e1bcaf28528cb48e3712d575ac5a666d224e39ce4315a9d6b0f4fb21c [2025-03-17 19:00:43,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:00:43,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:00:43,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:00:43,831 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:00:43,831 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:00:43,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/who-2.i [2025-03-17 19:00:44,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3a153e8/7e051a533b7842f6868910a2963f8dd3/FLAGaaf90c0e8 [2025-03-17 19:00:45,291 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:00:45,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/who-2.i [2025-03-17 19:00:45,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3a153e8/7e051a533b7842f6868910a2963f8dd3/FLAGaaf90c0e8 [2025-03-17 19:00:45,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3a153e8/7e051a533b7842f6868910a2963f8dd3 [2025-03-17 19:00:45,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:00:45,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:00:45,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:00:45,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:00:45,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:00:45,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:00:45" (1/1) ... [2025-03-17 19:00:45,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba29674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:45, skipping insertion in model container [2025-03-17 19:00:45,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:00:45" (1/1) ... [2025-03-17 19:00:45,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:00:46,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:00:46,442 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:00:46,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:00:46,683 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 19:00:46,688 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:00:46,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46 WrapperNode [2025-03-17 19:00:46,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:00:46,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:00:46,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:00:46,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:00:46,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,772 INFO L138 Inliner]: procedures = 639, calls = 723, calls flagged for inlining = 29, calls inlined = 28, statements flattened = 1971 [2025-03-17 19:00:46,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:00:46,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:00:46,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:00:46,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:00:46,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,833 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 19:00:46,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:00:46,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:00:46,917 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:00:46,917 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:00:46,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (1/1) ... [2025-03-17 19:00:46,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:00:46,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:46,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:00:46,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:00:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:00:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 19:00:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 19:00:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 19:00:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:00:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:00:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 19:00:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:00:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:00:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 19:00:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 19:00:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-17 19:00:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-17 19:00:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 19:00:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 19:00:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-17 19:00:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-17 19:00:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 19:00:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 19:00:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:00:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 19:00:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 19:00:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 19:00:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-17 19:00:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-17 19:00:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 19:00:47,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:00:47,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:00:49,317 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273: havoc getopt_long_#t~ret263#1; [2025-03-17 19:00:49,317 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2591: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-17 19:00:49,452 INFO L? ?]: Removed 576 outVars from TransFormulas that were not future-live. [2025-03-17 19:00:49,452 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:00:49,489 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:00:49,489 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:00:49,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:00:49 BoogieIcfgContainer [2025-03-17 19:00:49,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:00:49,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:00:49,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:00:49,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:00:49,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:00:45" (1/3) ... [2025-03-17 19:00:49,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba406a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:00:49, skipping insertion in model container [2025-03-17 19:00:49,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:00:46" (2/3) ... [2025-03-17 19:00:49,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba406a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:00:49, skipping insertion in model container [2025-03-17 19:00:49,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:00:49" (3/3) ... [2025-03-17 19:00:49,497 INFO L128 eAbstractionObserver]: Analyzing ICFG who-2.i [2025-03-17 19:00:49,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:00:49,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG who-2.i that has 6 procedures, 496 locations, 1 initial locations, 33 loop locations, and 70 error locations. [2025-03-17 19:00:49,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:00:49,570 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;@2dab3490, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:00:49,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-17 19:00:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 496 states, 400 states have (on average 1.7) internal successors, (680), 471 states have internal predecessors, (680), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 19:00:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 19:00:49,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:49,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 19:00:49,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:49,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash 848983, now seen corresponding path program 1 times [2025-03-17 19:00:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:49,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28346668] [2025-03-17 19:00:49,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:49,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:00:49,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:00:49,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:49,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:00:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28346668] [2025-03-17 19:00:50,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28346668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:50,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:00:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:00:50,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664906076] [2025-03-17 19:00:50,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:50,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:00:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:50,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:00:50,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:50,237 INFO L87 Difference]: Start difference. First operand has 496 states, 400 states have (on average 1.7) internal successors, (680), 471 states have internal predecessors, (680), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:00:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:50,377 INFO L93 Difference]: Finished difference Result 911 states and 1348 transitions. [2025-03-17 19:00:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:00:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 19:00:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:50,389 INFO L225 Difference]: With dead ends: 911 [2025-03-17 19:00:50,390 INFO L226 Difference]: Without dead ends: 416 [2025-03-17 19:00:50,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:50,399 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:50,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1117 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:00:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-17 19:00:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-03-17 19:00:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 347 states have (on average 1.6051873198847262) internal successors, (557), 398 states have internal predecessors, (557), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 585 transitions. [2025-03-17 19:00:50,455 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 585 transitions. Word has length 3 [2025-03-17 19:00:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:50,455 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 585 transitions. [2025-03-17 19:00:50,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:00:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 585 transitions. [2025-03-17 19:00:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 19:00:50,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:50,457 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:00:50,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:00:50,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:50,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -476966627, now seen corresponding path program 1 times [2025-03-17 19:00:50,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:50,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405086752] [2025-03-17 19:00:50,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:50,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:00:50,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:00:50,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:50,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:50,768 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-17 19:00:50,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:50,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405086752] [2025-03-17 19:00:50,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405086752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:00:50,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960112905] [2025-03-17 19:00:50,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:50,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:50,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:50,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:00:50,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:00:51,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:00:51,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:00:51,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:51,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:51,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:00:51,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:51,161 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-17 19:00:51,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:00:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960112905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:51,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:00:51,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-03-17 19:00:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72848857] [2025-03-17 19:00:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:51,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:00:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:51,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:00:51,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:51,164 INFO L87 Difference]: Start difference. First operand 416 states and 585 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:00:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:52,051 INFO L93 Difference]: Finished difference Result 416 states and 585 transitions. [2025-03-17 19:00:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:00:52,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 19:00:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:52,053 INFO L225 Difference]: With dead ends: 416 [2025-03-17 19:00:52,053 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 19:00:52,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:52,055 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:52,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1109 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 19:00:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 19:00:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-17 19:00:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 347 states have (on average 1.6023054755043227) internal successors, (556), 397 states have internal predecessors, (556), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 584 transitions. [2025-03-17 19:00:52,074 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 584 transitions. Word has length 6 [2025-03-17 19:00:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:52,074 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 584 transitions. [2025-03-17 19:00:52,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:00:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 584 transitions. [2025-03-17 19:00:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:00:52,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:52,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 19:00:52,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 19:00:52,282 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-17 19:00:52,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1901062759, now seen corresponding path program 1 times [2025-03-17 19:00:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812886997] [2025-03-17 19:00:52,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:52,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:00:52,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:00:52,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:52,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:52,546 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-17 19:00:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:52,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812886997] [2025-03-17 19:00:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812886997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:00:52,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:00:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217701071] [2025-03-17 19:00:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:52,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:00:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:52,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:00:52,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:52,548 INFO L87 Difference]: Start difference. First operand 415 states and 584 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:00:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:52,625 INFO L93 Difference]: Finished difference Result 415 states and 584 transitions. [2025-03-17 19:00:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:00:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 19:00:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:52,628 INFO L225 Difference]: With dead ends: 415 [2025-03-17 19:00:52,628 INFO L226 Difference]: Without dead ends: 414 [2025-03-17 19:00:52,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:52,629 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:52,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1110 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:00:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-17 19:00:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2025-03-17 19:00:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 345 states have (on average 1.6028985507246376) internal successors, (553), 394 states have internal predecessors, (553), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 581 transitions. [2025-03-17 19:00:52,649 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 581 transitions. Word has length 7 [2025-03-17 19:00:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:52,649 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 581 transitions. [2025-03-17 19:00:52,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:00:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 581 transitions. [2025-03-17 19:00:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 19:00:52,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:52,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:52,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:00:52,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:52,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash 26003901, now seen corresponding path program 1 times [2025-03-17 19:00:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856499553] [2025-03-17 19:00:52,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:52,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:00:52,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:00:52,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:52,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:52,948 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-17 19:00:52,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856499553] [2025-03-17 19:00:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856499553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:00:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476811345] [2025-03-17 19:00:52,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:52,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:52,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:52,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:00:52,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:00:53,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:00:53,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:00:53,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:53,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:53,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:00:53,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:53,318 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-17 19:00:53,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:00:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476811345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:00:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 19:00:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588307669] [2025-03-17 19:00:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:00:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:53,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:00:53,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:53,320 INFO L87 Difference]: Start difference. First operand 412 states and 581 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-17 19:00:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:53,956 INFO L93 Difference]: Finished difference Result 412 states and 581 transitions. [2025-03-17 19:00:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:00:53,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2025-03-17 19:00:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:53,958 INFO L225 Difference]: With dead ends: 412 [2025-03-17 19:00:53,958 INFO L226 Difference]: Without dead ends: 410 [2025-03-17 19:00:53,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:53,959 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 518 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:53,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 592 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 19:00:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-17 19:00:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-03-17 19:00:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 345 states have (on average 1.5971014492753624) internal successors, (551), 392 states have internal predecessors, (551), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 579 transitions. [2025-03-17 19:00:53,970 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 579 transitions. Word has length 11 [2025-03-17 19:00:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:53,971 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 579 transitions. [2025-03-17 19:00:53,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-17 19:00:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 579 transitions. [2025-03-17 19:00:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 19:00:53,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:53,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:53,980 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-17 19:00:54,171 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-17 19:00:54,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 806121715, now seen corresponding path program 1 times [2025-03-17 19:00:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:54,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535117105] [2025-03-17 19:00:54,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:54,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:00:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:00:54,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:54,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:54,407 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-17 19:00:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:54,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535117105] [2025-03-17 19:00:54,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535117105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:00:54,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139109536] [2025-03-17 19:00:54,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:54,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:54,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:00:54,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:00:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:00:54,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:00:54,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:54,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:54,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:00:54,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:54,792 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-17 19:00:54,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:00:54,825 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-17 19:00:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139109536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:00:54,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:00:54,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-17 19:00:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965596079] [2025-03-17 19:00:54,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:00:54,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:00:54,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:54,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:00:54,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:00:54,826 INFO L87 Difference]: Start difference. First operand 410 states and 579 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-17 19:00:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:54,910 INFO L93 Difference]: Finished difference Result 824 states and 1164 transitions. [2025-03-17 19:00:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:00:54,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 12 [2025-03-17 19:00:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:54,913 INFO L225 Difference]: With dead ends: 824 [2025-03-17 19:00:54,913 INFO L226 Difference]: Without dead ends: 419 [2025-03-17 19:00:54,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:00:54,914 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 4 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:54,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1658 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:00:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-17 19:00:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-03-17 19:00:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 354 states have (on average 1.5819209039548023) internal successors, (560), 401 states have internal predecessors, (560), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2025-03-17 19:00:54,928 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 12 [2025-03-17 19:00:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:54,928 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2025-03-17 19:00:54,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-17 19:00:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2025-03-17 19:00:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 19:00:54,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:54,929 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:54,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:00:55,133 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-17 19:00:55,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:55,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1784116525, now seen corresponding path program 2 times [2025-03-17 19:00:55,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:55,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106972845] [2025-03-17 19:00:55,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:00:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:55,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 19:00:55,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-03-17 19:00:55,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:00:55,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:00:55,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:55,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106972845] [2025-03-17 19:00:55,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106972845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:55,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:00:55,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:00:55,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959418998] [2025-03-17 19:00:55,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:55,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:00:55,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:55,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:00:55,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:55,439 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-17 19:00:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:56,348 INFO L93 Difference]: Finished difference Result 419 states and 588 transitions. [2025-03-17 19:00:56,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:00:56,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-17 19:00:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:56,351 INFO L225 Difference]: With dead ends: 419 [2025-03-17 19:00:56,351 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 19:00:56,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:56,352 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 517 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:56,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1661 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 19:00:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 19:00:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-03-17 19:00:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 354 states have (on average 1.576271186440678) internal successors, (558), 399 states have internal predecessors, (558), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 586 transitions. [2025-03-17 19:00:56,366 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 586 transitions. Word has length 21 [2025-03-17 19:00:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:56,366 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 586 transitions. [2025-03-17 19:00:56,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-17 19:00:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 586 transitions. [2025-03-17 19:00:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 19:00:56,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:56,366 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:00:56,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:56,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1806833314, now seen corresponding path program 1 times [2025-03-17 19:00:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:56,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429462966] [2025-03-17 19:00:56,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:56,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:56,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:00:56,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:00:56,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:56,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:00:56,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:56,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429462966] [2025-03-17 19:00:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429462966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:00:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:00:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372043043] [2025-03-17 19:00:56,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:56,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:00:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:56,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:00:56,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:56,622 INFO L87 Difference]: Start difference. First operand 417 states and 586 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:00:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:57,214 INFO L93 Difference]: Finished difference Result 818 states and 1157 transitions. [2025-03-17 19:00:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:00:57,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 26 [2025-03-17 19:00:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:57,217 INFO L225 Difference]: With dead ends: 818 [2025-03-17 19:00:57,217 INFO L226 Difference]: Without dead ends: 420 [2025-03-17 19:00:57,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:57,218 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:57,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1099 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 19:00:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-17 19:00:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-17 19:00:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 357 states have (on average 1.5714285714285714) internal successors, (561), 402 states have internal predecessors, (561), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 589 transitions. [2025-03-17 19:00:57,228 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 589 transitions. Word has length 26 [2025-03-17 19:00:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:57,228 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 589 transitions. [2025-03-17 19:00:57,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:00:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 589 transitions. [2025-03-17 19:00:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 19:00:57,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:57,229 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:57,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:00:57,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:57,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash -177591769, now seen corresponding path program 1 times [2025-03-17 19:00:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:57,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994315900] [2025-03-17 19:00:57,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:57,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:00:57,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:00:57,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:57,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:00:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994315900] [2025-03-17 19:00:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994315900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:57,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:00:57,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:00:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59090210] [2025-03-17 19:00:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:57,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:00:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:57,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:00:57,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:57,449 INFO L87 Difference]: Start difference. First operand 420 states and 589 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-17 19:00:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:57,548 INFO L93 Difference]: Finished difference Result 713 states and 1022 transitions. [2025-03-17 19:00:57,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:00:57,549 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), 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-17 19:00:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:57,552 INFO L225 Difference]: With dead ends: 713 [2025-03-17 19:00:57,552 INFO L226 Difference]: Without dead ends: 711 [2025-03-17 19:00:57,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:57,553 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 407 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:57,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1086 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:00:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-17 19:00:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 424. [2025-03-17 19:00:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 361 states have (on average 1.5678670360110802) internal successors, (566), 406 states have internal predecessors, (566), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 594 transitions. [2025-03-17 19:00:57,573 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 594 transitions. Word has length 27 [2025-03-17 19:00:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 594 transitions. [2025-03-17 19:00:57,574 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), 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-17 19:00:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 594 transitions. [2025-03-17 19:00:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 19:00:57,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:57,575 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:00:57,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:57,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1459398502, now seen corresponding path program 1 times [2025-03-17 19:00:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443836217] [2025-03-17 19:00:57,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:57,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:00:57,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:00:57,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:57,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:00:57,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443836217] [2025-03-17 19:00:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443836217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:00:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594035708] [2025-03-17 19:00:57,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:57,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:57,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:57,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:00:57,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:00:58,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:00:58,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:00:58,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:58,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:58,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:00:58,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 19:00:58,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:00:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594035708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:58,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:00:58,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 19:00:58,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879667540] [2025-03-17 19:00:58,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:58,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:00:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:58,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:00:58,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:58,270 INFO L87 Difference]: Start difference. First operand 424 states and 594 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-17 19:00:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:59,100 INFO L93 Difference]: Finished difference Result 424 states and 594 transitions. [2025-03-17 19:00:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:00:59,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 29 [2025-03-17 19:00:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:59,102 INFO L225 Difference]: With dead ends: 424 [2025-03-17 19:00:59,102 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 19:00:59,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:59,103 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 3 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:59,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1089 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 19:00:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 19:00:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-17 19:00:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 361 states have (on average 1.5650969529085872) internal successors, (565), 405 states have internal predecessors, (565), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:00:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 593 transitions. [2025-03-17 19:00:59,116 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 593 transitions. Word has length 29 [2025-03-17 19:00:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:59,117 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 593 transitions. [2025-03-17 19:00:59,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-17 19:00:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 593 transitions. [2025-03-17 19:00:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 19:00:59,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:59,118 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:59,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:00:59,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:59,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:00:59,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:59,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1459398662, now seen corresponding path program 1 times [2025-03-17 19:00:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:59,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714819212] [2025-03-17 19:00:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:59,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:00:59,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:00:59,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:59,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:00:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714819212] [2025-03-17 19:00:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714819212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:00:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519814149] [2025-03-17 19:00:59,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:59,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:59,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:59,538 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:00:59,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:00:59,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:00:59,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:00:59,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:59,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:59,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:00:59,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:00:59,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:01:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:01:00,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519814149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:01:00,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:01:00,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-03-17 19:01:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564187872] [2025-03-17 19:01:00,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:01:00,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 19:01:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:00,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 19:01:00,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:01:00,083 INFO L87 Difference]: Start difference. First operand 423 states and 593 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:01:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:02,023 INFO L93 Difference]: Finished difference Result 849 states and 1195 transitions. [2025-03-17 19:01:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:01:02,025 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-17 19:01:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:02,027 INFO L225 Difference]: With dead ends: 849 [2025-03-17 19:01:02,027 INFO L226 Difference]: Without dead ends: 440 [2025-03-17 19:01:02,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:01:02,028 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 5 mSDsluCounter, 3801 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:02,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4346 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 19:01:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-17 19:01:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-03-17 19:01:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 379 states have (on average 1.5356200527704484) internal successors, (582), 422 states have internal predecessors, (582), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:01:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2025-03-17 19:01:02,041 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 29 [2025-03-17 19:01:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:02,041 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2025-03-17 19:01:02,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:01:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2025-03-17 19:01:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 19:01:02,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:02,043 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:02,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:01:02,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 19:01:02,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:02,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1433232997, now seen corresponding path program 1 times [2025-03-17 19:01:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:02,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084281446] [2025-03-17 19:01:02,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:02,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:02,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:01:02,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:01:02,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:02,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 19:01:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084281446] [2025-03-17 19:01:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084281446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:02,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:01:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753835424] [2025-03-17 19:01:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:02,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:01:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:02,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:01:02,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:02,458 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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-17 19:01:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:03,359 INFO L93 Difference]: Finished difference Result 451 states and 623 transitions. [2025-03-17 19:01:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:01:03,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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 48 [2025-03-17 19:01:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:03,362 INFO L225 Difference]: With dead ends: 451 [2025-03-17 19:01:03,362 INFO L226 Difference]: Without dead ends: 450 [2025-03-17 19:01:03,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:03,363 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 1 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:03,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1093 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 19:01:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-17 19:01:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 449. [2025-03-17 19:01:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 388 states have (on average 1.5309278350515463) internal successors, (594), 431 states have internal predecessors, (594), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:01:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 622 transitions. [2025-03-17 19:01:03,374 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 622 transitions. Word has length 48 [2025-03-17 19:01:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:03,375 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 622 transitions. [2025-03-17 19:01:03,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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-17 19:01:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 622 transitions. [2025-03-17 19:01:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 19:01:03,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:03,376 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:03,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:01:03,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:03,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1433228032, now seen corresponding path program 1 times [2025-03-17 19:01:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:03,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228205612] [2025-03-17 19:01:03,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:03,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:01:03,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:01:03,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:03,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 19:01:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228205612] [2025-03-17 19:01:03,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228205612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:03,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:03,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:01:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511159649] [2025-03-17 19:01:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:03,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:01:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:03,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:01:03,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:03,592 INFO L87 Difference]: Start difference. First operand 449 states and 622 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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-17 19:01:04,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:01:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:04,803 INFO L93 Difference]: Finished difference Result 449 states and 622 transitions. [2025-03-17 19:01:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:01:04,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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 48 [2025-03-17 19:01:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:04,805 INFO L225 Difference]: With dead ends: 449 [2025-03-17 19:01:04,805 INFO L226 Difference]: Without dead ends: 448 [2025-03-17 19:01:04,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:04,806 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:04,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1095 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 19:01:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-17 19:01:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 444. [2025-03-17 19:01:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 384 states have (on average 1.53125) internal successors, (588), 426 states have internal predecessors, (588), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:01:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 616 transitions. [2025-03-17 19:01:04,820 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 616 transitions. Word has length 48 [2025-03-17 19:01:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:04,821 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 616 transitions. [2025-03-17 19:01:04,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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-17 19:01:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 616 transitions. [2025-03-17 19:01:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 19:01:04,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:04,822 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:01:04,822 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:04,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1591760277, now seen corresponding path program 1 times [2025-03-17 19:01:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869235599] [2025-03-17 19:01:04,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:04,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 19:01:04,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 19:01:04,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:04,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:01:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869235599] [2025-03-17 19:01:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869235599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:01:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995556110] [2025-03-17 19:01:05,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:05,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:05,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:01:05,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:01:05,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:01:05,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 19:01:05,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 19:01:05,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:05,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:05,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:01:05,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:01:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:01:05,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:01:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995556110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:01:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 19:01:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368750682] [2025-03-17 19:01:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:05,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:01:05,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:05,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:01:05,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:01:05,575 INFO L87 Difference]: Start difference. First operand 444 states and 616 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-17 19:01:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:05,701 INFO L93 Difference]: Finished difference Result 734 states and 1046 transitions. [2025-03-17 19:01:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:01:05,702 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 49 [2025-03-17 19:01:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:05,705 INFO L225 Difference]: With dead ends: 734 [2025-03-17 19:01:05,705 INFO L226 Difference]: Without dead ends: 733 [2025-03-17 19:01:05,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:01:05,706 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 813 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:05,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1641 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:01:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-17 19:01:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 443. [2025-03-17 19:01:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 384 states have (on average 1.5286458333333333) internal successors, (587), 425 states have internal predecessors, (587), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:01:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2025-03-17 19:01:05,718 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 49 [2025-03-17 19:01:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:05,718 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2025-03-17 19:01:05,718 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-17 19:01:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2025-03-17 19:01:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 19:01:05,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:05,719 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:05,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 19:01:05,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:05,920 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:05,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2099927571, now seen corresponding path program 1 times [2025-03-17 19:01:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576145420] [2025-03-17 19:01:05,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:06,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:01:06,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:01:06,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:06,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:01:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:06,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576145420] [2025-03-17 19:01:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576145420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:01:06,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324839734] [2025-03-17 19:01:06,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:01:06,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:01:06,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:01:06,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:01:06,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:01:06,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:06,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:06,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:01:06,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:01:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:01:06,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:01:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:01:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324839734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:01:06,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:01:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 19:01:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817166067] [2025-03-17 19:01:06,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:01:06,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:01:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:06,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:01:06,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:01:06,648 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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-17 19:01:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:06,868 INFO L93 Difference]: Finished difference Result 1604 states and 2337 transitions. [2025-03-17 19:01:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:01:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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 50 [2025-03-17 19:01:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:06,874 INFO L225 Difference]: With dead ends: 1604 [2025-03-17 19:01:06,874 INFO L226 Difference]: Without dead ends: 1603 [2025-03-17 19:01:06,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:01:06,875 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 1624 mSDsluCounter, 2982 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:06,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 3525 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:01:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-17 19:01:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 455. [2025-03-17 19:01:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 396 states have (on average 1.52020202020202) internal successors, (602), 437 states have internal predecessors, (602), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:01:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 630 transitions. [2025-03-17 19:01:06,892 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 630 transitions. Word has length 50 [2025-03-17 19:01:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:06,892 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 630 transitions. [2025-03-17 19:01:06,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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-17 19:01:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 630 transitions. [2025-03-17 19:01:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 19:01:06,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:06,893 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:06,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:01:07,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:07,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2057887851, now seen corresponding path program 1 times [2025-03-17 19:01:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250183950] [2025-03-17 19:01:07,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:07,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 19:01:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 19:01:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 19:01:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250183950] [2025-03-17 19:01:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250183950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:01:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334966144] [2025-03-17 19:01:07,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:01:07,321 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-17 19:01:07,323 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-17 19:01:07,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 19:01:07,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 19:01:07,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:07,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:07,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:01:07,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:01:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 19:01:07,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:01:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 19:01:07,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334966144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:01:07,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:01:07,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 19:01:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537618963] [2025-03-17 19:01:07,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:01:07,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:01:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:07,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:01:07,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:01:07,821 INFO L87 Difference]: Start difference. First operand 455 states and 630 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-17 19:01:10,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:01:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:10,757 INFO L93 Difference]: Finished difference Result 886 states and 1238 transitions. [2025-03-17 19:01:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:01:10,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 55 [2025-03-17 19:01:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:10,760 INFO L225 Difference]: With dead ends: 886 [2025-03-17 19:01:10,760 INFO L226 Difference]: Without dead ends: 473 [2025-03-17 19:01:10,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:01:10,761 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 4 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:10,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2183 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 19:01:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-17 19:01:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-03-17 19:01:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 414 states have (on average 1.497584541062802) internal successors, (620), 455 states have internal predecessors, (620), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:01:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 648 transitions. [2025-03-17 19:01:10,772 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 648 transitions. Word has length 55 [2025-03-17 19:01:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:10,773 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 648 transitions. [2025-03-17 19:01:10,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-17 19:01:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 648 transitions. [2025-03-17 19:01:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 19:01:10,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:10,773 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:10,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 19:01:10,974 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,SelfDestructingSolverStorable14 [2025-03-17 19:01:10,974 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1885530051, now seen corresponding path program 1 times [2025-03-17 19:01:10,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:10,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149795903] [2025-03-17 19:01:10,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:11,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 19:01:11,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 19:01:11,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:11,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:01:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:11,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149795903] [2025-03-17 19:01:11,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149795903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:11,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:11,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:01:11,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17980356] [2025-03-17 19:01:11,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:11,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:01:11,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:11,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:01:11,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:11,161 INFO L87 Difference]: Start difference. First operand 473 states and 648 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-17 19:01:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:11,272 INFO L93 Difference]: Finished difference Result 943 states and 1324 transitions. [2025-03-17 19:01:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:01:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 59 [2025-03-17 19:01:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:11,275 INFO L225 Difference]: With dead ends: 943 [2025-03-17 19:01:11,277 INFO L226 Difference]: Without dead ends: 568 [2025-03-17 19:01:11,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:11,278 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 119 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:11,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1042 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:01:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-17 19:01:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 515. [2025-03-17 19:01:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 455 states have (on average 1.4857142857142858) internal successors, (676), 496 states have internal predecessors, (676), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 706 transitions. [2025-03-17 19:01:11,293 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 706 transitions. Word has length 59 [2025-03-17 19:01:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:11,293 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 706 transitions. [2025-03-17 19:01:11,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-17 19:01:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 706 transitions. [2025-03-17 19:01:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 19:01:11,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:11,294 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:11,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:01:11,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:11,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash -481796351, now seen corresponding path program 1 times [2025-03-17 19:01:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:11,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380224159] [2025-03-17 19:01:11,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:11,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:01:11,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:01:11,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:11,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:01:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:11,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380224159] [2025-03-17 19:01:11,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380224159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:11,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:11,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:01:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952393044] [2025-03-17 19:01:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:01:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:01:11,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:11,534 INFO L87 Difference]: Start difference. First operand 515 states and 706 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:11,586 INFO L93 Difference]: Finished difference Result 517 states and 706 transitions. [2025-03-17 19:01:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:01:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2025-03-17 19:01:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:11,588 INFO L225 Difference]: With dead ends: 517 [2025-03-17 19:01:11,588 INFO L226 Difference]: Without dead ends: 515 [2025-03-17 19:01:11,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:11,589 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:11,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1093 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:01:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-17 19:01:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-17 19:01:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 455 states have (on average 1.4813186813186814) internal successors, (674), 496 states have internal predecessors, (674), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 704 transitions. [2025-03-17 19:01:11,622 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 704 transitions. Word has length 61 [2025-03-17 19:01:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:11,623 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 704 transitions. [2025-03-17 19:01:11,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 704 transitions. [2025-03-17 19:01:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 19:01:11,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:11,627 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:11,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 19:01:11,627 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:11,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash -837736735, now seen corresponding path program 2 times [2025-03-17 19:01:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:11,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727698752] [2025-03-17 19:01:11,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:01:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:11,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-17 19:01:11,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 62 statements. [2025-03-17 19:01:11,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:01:11,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-17 19:01:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727698752] [2025-03-17 19:01:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727698752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:01:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936871862] [2025-03-17 19:01:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:12,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:01:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:01:12,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:01:12,053 INFO L87 Difference]: Start difference. First operand 515 states and 704 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-17 19:01:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:13,140 INFO L93 Difference]: Finished difference Result 960 states and 1332 transitions. [2025-03-17 19:01:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:01:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 62 [2025-03-17 19:01:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:13,142 INFO L225 Difference]: With dead ends: 960 [2025-03-17 19:01:13,142 INFO L226 Difference]: Without dead ends: 515 [2025-03-17 19:01:13,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:01:13,143 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 523 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:13,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 2122 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 19:01:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-17 19:01:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-17 19:01:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 455 states have (on average 1.4791208791208792) internal successors, (673), 496 states have internal predecessors, (673), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 703 transitions. [2025-03-17 19:01:13,155 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 703 transitions. Word has length 62 [2025-03-17 19:01:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:13,155 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 703 transitions. [2025-03-17 19:01:13,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-17 19:01:13,155 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 703 transitions. [2025-03-17 19:01:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 19:01:13,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:13,156 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:13,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 19:01:13,156 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash -831330853, now seen corresponding path program 2 times [2025-03-17 19:01:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339690647] [2025-03-17 19:01:13,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:01:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:13,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 19:01:13,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-03-17 19:01:13,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:01:13,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 19:01:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:13,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339690647] [2025-03-17 19:01:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339690647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:01:13,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603939206] [2025-03-17 19:01:13,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:01:13,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:01:13,331 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-17 19:01:13,332 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-17 19:01:13,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 19:01:13,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-03-17 19:01:13,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:01:13,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:13,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:01:13,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:01:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 19:01:13,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:01:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 19:01:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603939206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:01:13,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:01:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 19:01:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960460233] [2025-03-17 19:01:13,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:01:13,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:01:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:13,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:01:13,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:01:13,912 INFO L87 Difference]: Start difference. First operand 515 states and 703 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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-17 19:01:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:15,200 INFO L93 Difference]: Finished difference Result 515 states and 703 transitions. [2025-03-17 19:01:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:01:15,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 73 [2025-03-17 19:01:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:15,202 INFO L225 Difference]: With dead ends: 515 [2025-03-17 19:01:15,202 INFO L226 Difference]: Without dead ends: 514 [2025-03-17 19:01:15,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:01:15,202 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1005 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:15,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 1120 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 19:01:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-17 19:01:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 499. [2025-03-17 19:01:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 440 states have (on average 1.490909090909091) internal successors, (656), 480 states have internal predecessors, (656), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 686 transitions. [2025-03-17 19:01:15,216 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 686 transitions. Word has length 73 [2025-03-17 19:01:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 686 transitions. [2025-03-17 19:01:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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-17 19:01:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 686 transitions. [2025-03-17 19:01:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 19:01:15,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:15,218 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:15,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 19:01:15,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:15,418 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1527835177, now seen corresponding path program 1 times [2025-03-17 19:01:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968195226] [2025-03-17 19:01:15,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:15,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 19:01:15,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 19:01:15,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:15,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-17 19:01:15,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968195226] [2025-03-17 19:01:15,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968195226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:01:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822661686] [2025-03-17 19:01:15,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:15,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:15,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:01:15,685 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-17 19:01:15,686 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-17 19:01:16,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 19:01:16,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 19:01:16,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:16,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:16,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1665 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:01:16,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:01:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-17 19:01:16,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:01:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-17 19:01:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822661686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:01:16,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:01:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 19:01:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336296251] [2025-03-17 19:01:16,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:01:16,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:01:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:16,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:01:16,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:01:16,337 INFO L87 Difference]: Start difference. First operand 499 states and 686 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-17 19:01:17,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:01:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:17,516 INFO L93 Difference]: Finished difference Result 978 states and 1356 transitions. [2025-03-17 19:01:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:01:17,516 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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 78 [2025-03-17 19:01:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:17,518 INFO L225 Difference]: With dead ends: 978 [2025-03-17 19:01:17,518 INFO L226 Difference]: Without dead ends: 517 [2025-03-17 19:01:17,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:01:17,519 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 4 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:17,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1091 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 19:01:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-17 19:01:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-17 19:01:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 458 states have (on average 1.4716157205240175) internal successors, (674), 498 states have internal predecessors, (674), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 704 transitions. [2025-03-17 19:01:17,533 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 704 transitions. Word has length 78 [2025-03-17 19:01:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:17,533 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 704 transitions. [2025-03-17 19:01:17,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-17 19:01:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 704 transitions. [2025-03-17 19:01:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 19:01:17,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:17,535 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:17,545 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-17 19:01:17,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:17,735 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:17,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1411302185, now seen corresponding path program 2 times [2025-03-17 19:01:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:17,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812073271] [2025-03-17 19:01:17,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:01:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:17,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 19:01:17,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 19:01:17,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:01:17,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 19:01:18,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:18,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812073271] [2025-03-17 19:01:18,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812073271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:01:18,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843339814] [2025-03-17 19:01:18,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:01:18,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:18,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:01:18,160 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-17 19:01:18,162 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-17 19:01:18,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 19:01:19,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 19:01:19,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:01:19,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:19,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1803 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:01:19,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:01:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 19:01:19,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:01:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 19:01:19,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843339814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:01:19,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:01:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 19:01:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121205630] [2025-03-17 19:01:19,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:01:19,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:01:19,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:19,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:01:19,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:01:19,539 INFO L87 Difference]: Start difference. First operand 517 states and 704 transitions. Second operand has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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-17 19:01:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:20,094 INFO L93 Difference]: Finished difference Result 3832 states and 5560 transitions. [2025-03-17 19:01:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:01:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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 96 [2025-03-17 19:01:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:20,105 INFO L225 Difference]: With dead ends: 3832 [2025-03-17 19:01:20,105 INFO L226 Difference]: Without dead ends: 3831 [2025-03-17 19:01:20,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:01:20,107 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 7688 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7758 SdHoareTripleChecker+Valid, 6156 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:20,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7758 Valid, 6156 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:01:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2025-03-17 19:01:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 541. [2025-03-17 19:01:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 482 states have (on average 1.4605809128630705) internal successors, (704), 522 states have internal predecessors, (704), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 734 transitions. [2025-03-17 19:01:20,142 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 734 transitions. Word has length 96 [2025-03-17 19:01:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:20,143 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 734 transitions. [2025-03-17 19:01:20,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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-17 19:01:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 734 transitions. [2025-03-17 19:01:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 19:01:20,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:20,143 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:20,156 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-17 19:01:20,344 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,SelfDestructingSolverStorable20 [2025-03-17 19:01:20,344 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:20,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash -513847691, now seen corresponding path program 1 times [2025-03-17 19:01:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:20,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935155590] [2025-03-17 19:01:20,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:20,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 19:01:20,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 19:01:20,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:20,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 19:01:20,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:20,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935155590] [2025-03-17 19:01:20,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935155590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:20,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:01:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380581438] [2025-03-17 19:01:20,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:20,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:01:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:20,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:01:20,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:20,574 INFO L87 Difference]: Start difference. First operand 541 states and 734 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:20,686 INFO L93 Difference]: Finished difference Result 593 states and 811 transitions. [2025-03-17 19:01:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:01:20,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-17 19:01:20,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:20,689 INFO L225 Difference]: With dead ends: 593 [2025-03-17 19:01:20,689 INFO L226 Difference]: Without dead ends: 588 [2025-03-17 19:01:20,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:20,693 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 188 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:20,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 911 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:01:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-17 19:01:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 536. [2025-03-17 19:01:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 482 states have (on average 1.450207468879668) internal successors, (699), 517 states have internal predecessors, (699), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 729 transitions. [2025-03-17 19:01:20,709 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 729 transitions. Word has length 101 [2025-03-17 19:01:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:20,709 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 729 transitions. [2025-03-17 19:01:20,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 729 transitions. [2025-03-17 19:01:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 19:01:20,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:20,710 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:20,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 19:01:20,710 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1250591300, now seen corresponding path program 1 times [2025-03-17 19:01:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:20,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702918577] [2025-03-17 19:01:20,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:20,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 19:01:20,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 19:01:20,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:20,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 19:01:20,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:20,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702918577] [2025-03-17 19:01:20,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702918577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:20,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:20,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:01:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928041139] [2025-03-17 19:01:20,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:20,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:01:20,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:20,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:01:20,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:20,958 INFO L87 Difference]: Start difference. First operand 536 states and 729 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:21,069 INFO L93 Difference]: Finished difference Result 588 states and 806 transitions. [2025-03-17 19:01:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:01:21,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-17 19:01:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:21,071 INFO L225 Difference]: With dead ends: 588 [2025-03-17 19:01:21,071 INFO L226 Difference]: Without dead ends: 583 [2025-03-17 19:01:21,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:21,072 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 186 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:21,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 921 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:01:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-17 19:01:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 519. [2025-03-17 19:01:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 470 states have (on average 1.4404255319148935) internal successors, (677), 500 states have internal predecessors, (677), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 707 transitions. [2025-03-17 19:01:21,088 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 707 transitions. Word has length 102 [2025-03-17 19:01:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:21,088 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 707 transitions. [2025-03-17 19:01:21,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 707 transitions. [2025-03-17 19:01:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 19:01:21,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:21,089 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:21,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 19:01:21,089 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:21,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 68687058, now seen corresponding path program 1 times [2025-03-17 19:01:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800883693] [2025-03-17 19:01:21,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:21,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 19:01:21,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 19:01:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 19:01:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800883693] [2025-03-17 19:01:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800883693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:01:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102700550] [2025-03-17 19:01:21,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:21,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:21,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:01:21,379 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:01:21,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 19:01:21,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 19:01:22,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 19:01:22,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:22,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:22,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:01:22,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:01:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 19:01:22,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:01:22,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102700550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:22,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:01:22,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 19:01:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289909056] [2025-03-17 19:01:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:22,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:01:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:22,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:01:22,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:01:22,057 INFO L87 Difference]: Start difference. First operand 519 states and 707 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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-17 19:01:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:22,197 INFO L93 Difference]: Finished difference Result 1003 states and 1409 transitions. [2025-03-17 19:01:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:01:22,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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 104 [2025-03-17 19:01:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:22,199 INFO L225 Difference]: With dead ends: 1003 [2025-03-17 19:01:22,199 INFO L226 Difference]: Without dead ends: 636 [2025-03-17 19:01:22,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:01:22,200 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 310 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:22,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1544 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:01:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-17 19:01:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 520. [2025-03-17 19:01:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 473 states have (on average 1.4334038054968288) internal successors, (678), 501 states have internal predecessors, (678), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 708 transitions. [2025-03-17 19:01:22,214 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 708 transitions. Word has length 104 [2025-03-17 19:01:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:22,214 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 708 transitions. [2025-03-17 19:01:22,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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-17 19:01:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 708 transitions. [2025-03-17 19:01:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 19:01:22,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:22,215 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:22,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:01:22,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 19:01:22,416 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:22,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1852449400, now seen corresponding path program 1 times [2025-03-17 19:01:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:22,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208768060] [2025-03-17 19:01:22,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:22,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 19:01:22,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 19:01:22,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:22,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-17 19:01:22,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:22,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208768060] [2025-03-17 19:01:22,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208768060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:22,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:01:22,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85024683] [2025-03-17 19:01:22,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:22,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:01:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:22,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:01:22,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:22,620 INFO L87 Difference]: Start difference. First operand 520 states and 708 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:22,671 INFO L93 Difference]: Finished difference Result 520 states and 708 transitions. [2025-03-17 19:01:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:01:22,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-03-17 19:01:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:22,673 INFO L225 Difference]: With dead ends: 520 [2025-03-17 19:01:22,673 INFO L226 Difference]: Without dead ends: 519 [2025-03-17 19:01:22,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:01:22,676 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:22,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1067 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:01:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-17 19:01:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2025-03-17 19:01:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 473 states have (on average 1.4312896405919662) internal successors, (677), 500 states have internal predecessors, (677), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:01:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 707 transitions. [2025-03-17 19:01:22,694 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 707 transitions. Word has length 107 [2025-03-17 19:01:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:22,695 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 707 transitions. [2025-03-17 19:01:22,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 707 transitions. [2025-03-17 19:01:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 19:01:22,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:22,698 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:22,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 19:01:22,698 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:22,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:22,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1591357284, now seen corresponding path program 1 times [2025-03-17 19:01:22,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:22,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553158426] [2025-03-17 19:01:22,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:22,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 19:01:23,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 19:01:23,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:23,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-17 19:01:23,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:23,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553158426] [2025-03-17 19:01:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553158426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:01:23,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:01:23,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:01:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154841462] [2025-03-17 19:01:23,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:01:23,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:01:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:01:23,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:01:23,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:01:23,268 INFO L87 Difference]: Start difference. First operand 519 states and 707 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:01:23,356 INFO L93 Difference]: Finished difference Result 925 states and 1289 transitions. [2025-03-17 19:01:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:01:23,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-03-17 19:01:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:01:23,360 INFO L225 Difference]: With dead ends: 925 [2025-03-17 19:01:23,360 INFO L226 Difference]: Without dead ends: 525 [2025-03-17 19:01:23,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:01:23,361 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 4 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:01:23,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1596 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:01:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-17 19:01:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 524. [2025-03-17 19:01:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 477 states have (on average 1.4318658280922432) internal successors, (683), 504 states have internal predecessors, (683), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 19:01:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 714 transitions. [2025-03-17 19:01:23,378 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 714 transitions. Word has length 108 [2025-03-17 19:01:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:01:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 714 transitions. [2025-03-17 19:01:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:01:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 714 transitions. [2025-03-17 19:01:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 19:01:23,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:01:23,380 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:01:23,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 19:01:23,380 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-03-17 19:01:23,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:01:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash 515484912, now seen corresponding path program 1 times [2025-03-17 19:01:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:01:23,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234880260] [2025-03-17 19:01:23,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:01:23,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 19:01:23,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 19:01:23,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:23,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-17 19:01:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:01:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234880260] [2025-03-17 19:01:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234880260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:01:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137727548] [2025-03-17 19:01:24,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:01:24,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:01:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:01:24,017 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:01:24,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 19:01:24,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 19:01:24,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 19:01:24,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:01:24,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:01:24,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-17 19:01:24,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:01:24,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:24,791 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 19:01:24,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-03-17 19:01:24,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:24,847 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 19:01:24,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 19:01:24,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:24,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:24,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:24,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:25,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,324 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-17 19:01:25,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-17 19:01:25,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:25,420 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-17 19:01:25,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-17 19:01:25,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 100 [2025-03-17 19:01:25,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:25,530 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-17 19:01:25,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2025-03-17 19:01:25,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 106 [2025-03-17 19:01:25,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:25,549 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-17 19:01:25,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 78 [2025-03-17 19:01:25,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-03-17 19:01:25,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:25,575 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-03-17 19:01:25,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2025-03-17 19:01:25,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 26 [2025-03-17 19:01:25,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 132 [2025-03-17 19:01:25,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:25,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-03-17 19:01:25,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:25,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 144 [2025-03-17 19:01:25,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:25,625 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-03-17 19:01:25,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 89 [2025-03-17 19:01:25,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:01:25,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-03-17 19:01:25,654 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-17 19:01:25,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2025-03-17 19:01:25,691 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:25,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:25,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:25,733 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:25,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:25,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:25,772 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:25,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:25,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:25,807 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:25,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:25,857 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:25,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:25,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:25,894 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:25,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:25,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:25,931 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:25,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:25,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:25,970 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:25,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:25,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:26,010 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 19:01:26,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 19:01:26,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 19:01:26,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-03-17 19:01:26,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:01:26,162 WARN L873 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memset_#ptr.base| Int)) (= (store |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|)) |c_#memory_int|)) is different from true [2025-03-17 19:01:26,182 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 19:01:26,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2025-03-17 19:01:26,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:01:26,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2025-03-17 19:01:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 241 trivial. 1 not checked. [2025-03-17 19:01:26,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:01:26,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8118 (Array Int Int)) (v_ArrVal_8116 (Array Int Int)) (v_ArrVal_8117 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store |c_#memory_int| .cse0 v_ArrVal_8116) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8117) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8118))) 11) 0) 33))) is different from false [2025-03-17 19:01:26,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8114 (Array Int Int)) (v_ArrVal_8115 (Array Int Int)) (v_ArrVal_8112 (Array Int Int)) (v_ArrVal_8113 (Array Int Int)) (v_ArrVal_8118 (Array Int Int)) (v_ArrVal_8116 (Array Int Int)) (v_ArrVal_8117 (Array Int Int))) (not (= (select (select (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8113))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8115))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8112) .cse1 v_ArrVal_8114) .cse2 v_ArrVal_8116) (select (select (store .cse3 .cse2 v_ArrVal_8117) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_8118))))))) 11) 0) 33))) is different from false [2025-03-17 19:01:26,944 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8114 (Array Int Int)) (v_ArrVal_8115 (Array Int Int)) (v_ArrVal_8112 (Array Int Int)) (v_ArrVal_8113 (Array Int Int)) (v_ArrVal_8118 (Array Int Int)) (v_ArrVal_8108 (Array Int Int)) (v_ArrVal_8116 (Array Int Int)) (v_ArrVal_8117 (Array Int Int)) (v_ArrVal_8109 (Array Int Int)) (v_ArrVal_8110 (Array Int Int)) (v_ArrVal_8111 (Array Int Int))) (not (= 33 (select (select (let ((.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8108))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_8110))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_8113))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_8115))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8109) .cse1 v_ArrVal_8111) .cse2 v_ArrVal_8112) .cse3 v_ArrVal_8114) .cse4 v_ArrVal_8116) (select (select (store .cse5 .cse4 v_ArrVal_8117) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_8118))))))))))) 11) 0)))) is different from false [2025-03-17 19:01:27,899 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8110 (Array Int Int)) (v_ArrVal_8111 (Array Int Int)) (v_ArrVal_8114 (Array Int Int)) (v_ArrVal_8104 (Array Int Int)) (v_ArrVal_8115 (Array Int Int)) (v_ArrVal_8112 (Array Int Int)) (v_ArrVal_8113 (Array Int Int)) (v_ArrVal_8107 (Array Int Int)) (v_ArrVal_8118 (Array Int Int)) (v_ArrVal_8108 (Array Int Int)) (v_ArrVal_8105 (Array Int Int)) (v_ArrVal_8116 (Array Int Int)) (v_ArrVal_8106 (Array Int Int)) (v_ArrVal_8117 (Array Int Int)) (v_ArrVal_8109 (Array Int Int))) (not (= 33 (select (select (let ((.cse8 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8104))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_8106))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_8108))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_8110))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_8113))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_8115))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8105) .cse1 v_ArrVal_8107) .cse2 v_ArrVal_8109) .cse3 v_ArrVal_8111) .cse4 v_ArrVal_8112) .cse5 v_ArrVal_8114) .cse6 v_ArrVal_8116) (select (select (store .cse7 .cse6 v_ArrVal_8117) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_8118))))))))))))))) 11) 0)))) is different from false [2025-03-17 19:01:28,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8110 (Array Int Int)) (v_ArrVal_8111 (Array Int Int)) (v_ArrVal_8103 (Array Int Int)) (v_ArrVal_8114 (Array Int Int)) (v_ArrVal_8104 (Array Int Int)) (v_ArrVal_8115 (Array Int Int)) (v_ArrVal_8112 (Array Int Int)) (v_ArrVal_8102 (Array Int Int)) (v_ArrVal_8113 (Array Int Int)) (v_ArrVal_8107 (Array Int Int)) (v_ArrVal_8118 (Array Int Int)) (v_ArrVal_8108 (Array Int Int)) (v_ArrVal_8105 (Array Int Int)) (v_ArrVal_8116 (Array Int Int)) (v_ArrVal_8106 (Array Int Int)) (v_ArrVal_8117 (Array Int Int)) (v_ArrVal_8109 (Array Int Int))) (not (= (select (select (let ((.cse9 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8102))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_8104))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_8106))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_8108))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_8110))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_8113))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse8 (store .cse10 .cse6 v_ArrVal_8115))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8103) .cse1 v_ArrVal_8105) .cse2 v_ArrVal_8107) .cse3 v_ArrVal_8109) .cse4 v_ArrVal_8111) .cse5 v_ArrVal_8112) .cse6 v_ArrVal_8114) .cse7 v_ArrVal_8116) (select (select (store .cse8 .cse7 v_ArrVal_8117) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_8118))))))))))))))))) 11) 0) 33))) is different from false [2025-03-17 19:01:31,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8110 (Array Int Int)) (v_ArrVal_8100 (Array Int Int)) (v_ArrVal_8111 (Array Int Int)) (v_ArrVal_8103 (Array Int Int)) (v_ArrVal_8114 (Array Int Int)) (v_ArrVal_8104 (Array Int Int)) (v_ArrVal_8115 (Array Int Int)) (v_ArrVal_8101 (Array Int Int)) (v_ArrVal_8112 (Array Int Int)) (v_ArrVal_8102 (Array Int Int)) (v_ArrVal_8113 (Array Int Int)) (v_ArrVal_8107 (Array Int Int)) (v_ArrVal_8118 (Array Int Int)) (v_ArrVal_8108 (Array Int Int)) (v_ArrVal_8105 (Array Int Int)) (v_ArrVal_8116 (Array Int Int)) (v_ArrVal_8106 (Array Int Int)) (v_ArrVal_8117 (Array Int Int)) (v_ArrVal_8109 (Array Int Int))) (not (= (select (select (let ((.cse10 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8100))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_8102))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_8104))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_8106))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_8108))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_8110))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_8113))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_8115))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (store (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8101) .cse1 v_ArrVal_8103) .cse2 v_ArrVal_8105) .cse3 v_ArrVal_8107) .cse4 v_ArrVal_8109) .cse5 v_ArrVal_8111) .cse6 v_ArrVal_8112) .cse7 v_ArrVal_8114) .cse8 v_ArrVal_8116) (select (select (store .cse9 .cse8 v_ArrVal_8117) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_8118))))))))))))))))))) 11) 0) 33))) is different from false [2025-03-17 19:01:31,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:01:31,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53236 treesize of output 28685