./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-09 05:57:30,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:57:30,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:57:30,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:57:30,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:57:30,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:57:30,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:57:30,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:57:30,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:57:30,719 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:57:30,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:57:30,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:57:30,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:57:30,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:57:30,719 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:57:30,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:57:30,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:57:30,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:57:30,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:57:30,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:57:30,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:57:30,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:57:30,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:57:30,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:57:30,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:57:30,722 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-09 05:57:30,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:57:30,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:57:30,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:57:30,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:57:30,938 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:57:30,939 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-09 05:57:32,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2349c3a11/763926e29d55415a950ce3b6aa5a181d/FLAGec29bc33e [2025-03-09 05:57:32,521 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:57:32,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/who-2.i [2025-03-09 05:57:32,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2349c3a11/763926e29d55415a950ce3b6aa5a181d/FLAGec29bc33e [2025-03-09 05:57:32,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2349c3a11/763926e29d55415a950ce3b6aa5a181d [2025-03-09 05:57:32,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:57:32,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:57:32,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:57:32,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:57:32,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:57:32,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:57:32" (1/1) ... [2025-03-09 05:57:32,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6225ad32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:32, skipping insertion in model container [2025-03-09 05:57:32,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:57:32" (1/1) ... [2025-03-09 05:57:32,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:57:33,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:57:33,471 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:57:33,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:57:33,739 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:57:33,745 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:57:33,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33 WrapperNode [2025-03-09 05:57:33,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:57:33,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:57:33,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:57:33,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:57:33,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,854 INFO L138 Inliner]: procedures = 639, calls = 723, calls flagged for inlining = 29, calls inlined = 28, statements flattened = 1971 [2025-03-09 05:57:33,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:57:33,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:57:33,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:57:33,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:57:33,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,907 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:57:33,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:57:34,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:57:34,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:57:34,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:57:34,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:34,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:57:34,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:34,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:57:34,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:57:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:57:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:57:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:57:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:57:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:57:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:57:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:57:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:57:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 05:57:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-09 05:57:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:57:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 05:57:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 05:57:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:57:34,375 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:57:34,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:57:35,794 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273: havoc getopt_long_#t~ret263#1; [2025-03-09 05:57:35,795 INFO L1307 $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-09 05:57:35,931 INFO L? ?]: Removed 611 outVars from TransFormulas that were not future-live. [2025-03-09 05:57:35,932 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:57:35,967 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:57:35,967 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:57:35,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:57:35 BoogieIcfgContainer [2025-03-09 05:57:35,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:57:35,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:57:35,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:57:35,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:57:35,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:57:32" (1/3) ... [2025-03-09 05:57:35,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668407c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:57:35, skipping insertion in model container [2025-03-09 05:57:35,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33" (2/3) ... [2025-03-09 05:57:35,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668407c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:57:35, skipping insertion in model container [2025-03-09 05:57:35,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:57:35" (3/3) ... [2025-03-09 05:57:35,974 INFO L128 eAbstractionObserver]: Analyzing ICFG who-2.i [2025-03-09 05:57:35,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:57:35,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG who-2.i that has 6 procedures, 511 locations, 1 initial locations, 33 loop locations, and 70 error locations. [2025-03-09 05:57:36,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:57:36,051 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;@609596f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:57:36,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-09 05:57:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 415 states have (on average 1.6746987951807228) internal successors, (695), 486 states have internal predecessors, (695), 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-09 05:57:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:57:36,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:36,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:57:36,062 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-09 05:57:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:36,066 INFO L85 PathProgramCache]: Analyzing trace with hash 27058111, now seen corresponding path program 1 times [2025-03-09 05:57:36,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:36,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557353463] [2025-03-09 05:57:36,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:36,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:57:36,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:57:36,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:36,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:36,680 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-09 05:57:36,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:36,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557353463] [2025-03-09 05:57:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557353463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:36,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:36,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:36,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867080797] [2025-03-09 05:57:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:36,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:36,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:36,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:36,704 INFO L87 Difference]: Start difference. First operand has 511 states, 415 states have (on average 1.6746987951807228) internal successors, (695), 486 states have internal predecessors, (695), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:57:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:36,847 INFO L93 Difference]: Finished difference Result 934 states and 1371 transitions. [2025-03-09 05:57:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 05:57:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:36,856 INFO L225 Difference]: With dead ends: 934 [2025-03-09 05:57:36,856 INFO L226 Difference]: Without dead ends: 424 [2025-03-09 05:57:36,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:36,863 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1135 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-09 05:57:36,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1135 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-09 05:57:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-03-09 05:57:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 355 states have (on average 1.591549295774648) internal successors, (565), 406 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-09 05:57:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 593 transitions. [2025-03-09 05:57:36,926 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 593 transitions. Word has length 4 [2025-03-09 05:57:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:36,927 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 593 transitions. [2025-03-09 05:57:36,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:57:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 593 transitions. [2025-03-09 05:57:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:57:36,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:36,928 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:57:36,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:57:36,929 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-09 05:57:36,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1364859412, now seen corresponding path program 1 times [2025-03-09 05:57:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103292664] [2025-03-09 05:57:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:37,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:57:37,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:57:37,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:37,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:37,243 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-09 05:57:37,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:37,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103292664] [2025-03-09 05:57:37,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103292664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:37,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356284964] [2025-03-09 05:57:37,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:37,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:37,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:37,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:57:37,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:57:37,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:57:37,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:37,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:37,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:37,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:37,637 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-09 05:57:37,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:37,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356284964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:37,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:57:37,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:57:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189465235] [2025-03-09 05:57:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:37,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:57:37,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:37,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:57:37,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:37,641 INFO L87 Difference]: Start difference. First operand 424 states and 593 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-09 05:57:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:37,727 INFO L93 Difference]: Finished difference Result 424 states and 593 transitions. [2025-03-09 05:57:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:57:37,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-09 05:57:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:37,732 INFO L225 Difference]: With dead ends: 424 [2025-03-09 05:57:37,732 INFO L226 Difference]: Without dead ends: 423 [2025-03-09 05:57:37,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-09 05:57:37,733 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:37,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1687 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-09 05:57:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-09 05:57:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 355 states have (on average 1.5887323943661973) internal successors, (564), 405 states have internal predecessors, (564), 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-09 05:57:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 592 transitions. [2025-03-09 05:57:37,755 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 592 transitions. Word has length 7 [2025-03-09 05:57:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:37,755 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 592 transitions. [2025-03-09 05:57:37,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-09 05:57:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 592 transitions. [2025-03-09 05:57:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:57:37,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:37,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:57:37,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:57:37,960 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-09 05:57:37,960 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-09 05:57:37,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash 639032001, now seen corresponding path program 1 times [2025-03-09 05:57:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:37,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619221359] [2025-03-09 05:57:37,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:38,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:57:38,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:57:38,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:38,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:38,195 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-09 05:57:38,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:38,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619221359] [2025-03-09 05:57:38,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619221359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:38,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:38,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541060237] [2025-03-09 05:57:38,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:38,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:38,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:38,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:38,197 INFO L87 Difference]: Start difference. First operand 423 states and 592 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:57:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:38,250 INFO L93 Difference]: Finished difference Result 423 states and 592 transitions. [2025-03-09 05:57:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:38,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 05:57:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:38,252 INFO L225 Difference]: With dead ends: 423 [2025-03-09 05:57:38,252 INFO L226 Difference]: Without dead ends: 422 [2025-03-09 05:57:38,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:38,253 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 0 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1126 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:38,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1126 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:57:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-09 05:57:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2025-03-09 05:57:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 353 states have (on average 1.5892351274787535) 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-09 05:57:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 589 transitions. [2025-03-09 05:57:38,263 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 589 transitions. Word has length 8 [2025-03-09 05:57:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:38,264 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 589 transitions. [2025-03-09 05:57:38,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:57:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 589 transitions. [2025-03-09 05:57:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:57:38,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:38,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:38,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:57:38,265 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-09 05:57:38,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1362134677, now seen corresponding path program 1 times [2025-03-09 05:57:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659545908] [2025-03-09 05:57:38,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:38,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:57:38,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:57:38,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:38,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:38,494 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-09 05:57:38,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659545908] [2025-03-09 05:57:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659545908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366952978] [2025-03-09 05:57:38,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:38,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:38,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:57:38,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:57:38,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:57:38,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:38,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:38,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:57:38,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:38,879 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-09 05:57:38,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:38,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366952978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:38,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:57:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:57:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002291497] [2025-03-09 05:57:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:38,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:38,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:38,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:38,881 INFO L87 Difference]: Start difference. First operand 420 states and 589 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-09 05:57:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:38,934 INFO L93 Difference]: Finished difference Result 420 states and 589 transitions. [2025-03-09 05:57:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:38,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-03-09 05:57:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:38,936 INFO L225 Difference]: With dead ends: 420 [2025-03-09 05:57:38,937 INFO L226 Difference]: Without dead ends: 418 [2025-03-09 05:57:38,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09 05:57:38,937 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 525 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 601 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:38,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 601 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:57:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-09 05:57:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-09 05:57:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 400 states have internal predecessors, (559), 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-09 05:57:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 587 transitions. [2025-03-09 05:57:38,947 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 587 transitions. Word has length 12 [2025-03-09 05:57:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:38,948 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 587 transitions. [2025-03-09 05:57:38,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-09 05:57:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 587 transitions. [2025-03-09 05:57:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:57:38,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:38,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:38,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:57:39,149 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-09 05:57:39,149 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-09 05:57:39,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash -723497166, now seen corresponding path program 1 times [2025-03-09 05:57:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107145364] [2025-03-09 05:57:39,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:39,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:57:39,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:57:39,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:39,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:39,366 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-09 05:57:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107145364] [2025-03-09 05:57:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107145364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128876640] [2025-03-09 05:57:39,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:39,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:39,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:39,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:39,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:57:39,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:57:39,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:57:39,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:39,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:39,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:39,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:39,774 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-09 05:57:39,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:39,801 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-09 05:57:39,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128876640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:39,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:57:39,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487431089] [2025-03-09 05:57:39,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:39,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:57:39,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:39,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:57:39,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:39,803 INFO L87 Difference]: Start difference. First operand 418 states and 587 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-09 05:57:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:39,887 INFO L93 Difference]: Finished difference Result 839 states and 1179 transitions. [2025-03-09 05:57:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:39,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 13 [2025-03-09 05:57:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:39,890 INFO L225 Difference]: With dead ends: 839 [2025-03-09 05:57:39,890 INFO L226 Difference]: Without dead ends: 427 [2025-03-09 05:57:39,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-09 05:57:39,891 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 4 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1682 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-09 05:57:39,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1682 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-09 05:57:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-03-09 05:57:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 362 states have (on average 1.569060773480663) internal successors, (568), 409 states have internal predecessors, (568), 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-09 05:57:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 596 transitions. [2025-03-09 05:57:39,901 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 596 transitions. Word has length 13 [2025-03-09 05:57:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:39,901 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 596 transitions. [2025-03-09 05:57:39,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-09 05:57:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 596 transitions. [2025-03-09 05:57:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:57:39,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:39,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:39,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:40,103 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-09 05:57:40,103 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-09 05:57:40,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1676497029, now seen corresponding path program 2 times [2025-03-09 05:57:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920120947] [2025-03-09 05:57:40,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:40,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:57:40,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:57:40,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:57:40,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:40,461 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-09 05:57:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:40,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920120947] [2025-03-09 05:57:40,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920120947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:40,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:40,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:57:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29768339] [2025-03-09 05:57:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:40,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:57:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:40,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:57:40,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:40,464 INFO L87 Difference]: Start difference. First operand 427 states and 596 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-09 05:57:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:40,573 INFO L93 Difference]: Finished difference Result 427 states and 596 transitions. [2025-03-09 05:57:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:57:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-03-09 05:57:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:40,575 INFO L225 Difference]: With dead ends: 427 [2025-03-09 05:57:40,576 INFO L226 Difference]: Without dead ends: 425 [2025-03-09 05:57:40,576 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-09 05:57:40,576 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 524 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1686 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:40,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1686 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-09 05:57:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-03-09 05:57:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 362 states have (on average 1.5635359116022098) internal successors, (566), 407 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-09 05:57:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 594 transitions. [2025-03-09 05:57:40,595 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 594 transitions. Word has length 22 [2025-03-09 05:57:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:40,595 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 594 transitions. [2025-03-09 05:57:40,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-09 05:57:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 594 transitions. [2025-03-09 05:57:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:57:40,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:40,596 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-09 05:57:40,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:57:40,596 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-09 05:57:40,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1667084451, now seen corresponding path program 1 times [2025-03-09 05:57:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:40,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647721239] [2025-03-09 05:57:40,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:40,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:57:40,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:57:40,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:40,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:40,834 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-09 05:57:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647721239] [2025-03-09 05:57:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647721239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:57:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936274838] [2025-03-09 05:57:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:40,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:40,835 INFO L87 Difference]: Start difference. First operand 425 states and 594 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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-09 05:57:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:40,887 INFO L93 Difference]: Finished difference Result 833 states and 1172 transitions. [2025-03-09 05:57:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-09 05:57:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:40,890 INFO L225 Difference]: With dead ends: 833 [2025-03-09 05:57:40,890 INFO L226 Difference]: Without dead ends: 428 [2025-03-09 05:57:40,890 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-09 05:57:40,891 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 2 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1115 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:40,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1115 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:57:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-09 05:57:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-03-09 05:57:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 365 states have (on average 1.558904109589041) internal successors, (569), 410 states have internal predecessors, (569), 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-09 05:57:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 597 transitions. [2025-03-09 05:57:40,903 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 597 transitions. Word has length 27 [2025-03-09 05:57:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:40,904 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 597 transitions. [2025-03-09 05:57:40,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-09 05:57:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 597 transitions. [2025-03-09 05:57:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 05:57:40,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:40,904 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:40,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:57:40,905 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-09 05:57:40,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash -140344289, now seen corresponding path program 1 times [2025-03-09 05:57:40,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:40,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751260468] [2025-03-09 05:57:40,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:40,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:57:40,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:57:40,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:40,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:41,140 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-09 05:57:41,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:41,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751260468] [2025-03-09 05:57:41,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751260468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:41,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:41,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898985678] [2025-03-09 05:57:41,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:41,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:41,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:41,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:41,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:41,142 INFO L87 Difference]: Start difference. First operand 428 states and 597 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-09 05:57:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:41,228 INFO L93 Difference]: Finished difference Result 726 states and 1035 transitions. [2025-03-09 05:57:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:41,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 28 [2025-03-09 05:57:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:41,231 INFO L225 Difference]: With dead ends: 726 [2025-03-09 05:57:41,231 INFO L226 Difference]: Without dead ends: 724 [2025-03-09 05:57:41,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:41,232 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 412 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1102 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-09 05:57:41,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1102 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-09 05:57:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 432. [2025-03-09 05:57:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 369 states have (on average 1.5555555555555556) internal successors, (574), 414 states have internal predecessors, (574), 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-09 05:57:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 602 transitions. [2025-03-09 05:57:41,246 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 602 transitions. Word has length 28 [2025-03-09 05:57:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:41,247 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 602 transitions. [2025-03-09 05:57:41,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-09 05:57:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 602 transitions. [2025-03-09 05:57:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:57:41,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:41,247 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, 1] [2025-03-09 05:57:41,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:57:41,248 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-09 05:57:41,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1400478146, now seen corresponding path program 1 times [2025-03-09 05:57:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:41,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995862669] [2025-03-09 05:57:41,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:41,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:57:41,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:57:41,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:41,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:41,443 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-09 05:57:41,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995862669] [2025-03-09 05:57:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995862669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:41,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:41,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:41,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683758049] [2025-03-09 05:57:41,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:41,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:41,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:41,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:41,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:41,445 INFO L87 Difference]: Start difference. First operand 432 states and 602 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-09 05:57:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:41,512 INFO L93 Difference]: Finished difference Result 445 states and 617 transitions. [2025-03-09 05:57:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:41,513 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 30 [2025-03-09 05:57:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:41,515 INFO L225 Difference]: With dead ends: 445 [2025-03-09 05:57:41,516 INFO L226 Difference]: Without dead ends: 443 [2025-03-09 05:57:41,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:41,516 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 3 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:41,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1112 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-09 05:57:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2025-03-09 05:57:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 378 states have (on average 1.552910052910053) internal successors, (587), 423 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-09 05:57:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 615 transitions. [2025-03-09 05:57:41,531 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 615 transitions. Word has length 30 [2025-03-09 05:57:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:41,531 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 615 transitions. [2025-03-09 05:57:41,531 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-09 05:57:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 615 transitions. [2025-03-09 05:57:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:57:41,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:41,533 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:41,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:57:41,534 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-09 05:57:41,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1400477986, now seen corresponding path program 1 times [2025-03-09 05:57:41,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:41,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870870686] [2025-03-09 05:57:41,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:41,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:41,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:57:41,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:57:41,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:41,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:41,769 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-09 05:57:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870870686] [2025-03-09 05:57:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870870686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860723706] [2025-03-09 05:57:41,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:41,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:41,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:41,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:41,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:57:42,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:57:42,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:57:42,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:42,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:42,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:57:42,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:42,236 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-09 05:57:42,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:42,316 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-09 05:57:42,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860723706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:42,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:42,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:57:42,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153114613] [2025-03-09 05:57:42,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:42,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:57:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:42,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:57:42,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:57:42,318 INFO L87 Difference]: Start difference. First operand 441 states and 615 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-09 05:57:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:42,469 INFO L93 Difference]: Finished difference Result 884 states and 1238 transitions. [2025-03-09 05:57:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:57:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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 30 [2025-03-09 05:57:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:42,472 INFO L225 Difference]: With dead ends: 884 [2025-03-09 05:57:42,472 INFO L226 Difference]: Without dead ends: 458 [2025-03-09 05:57:42,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 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-09 05:57:42,473 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 5 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:42,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2762 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-09 05:57:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2025-03-09 05:57:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 396 states have (on average 1.5227272727272727) internal successors, (603), 440 states have internal predecessors, (603), 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-09 05:57:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 631 transitions. [2025-03-09 05:57:42,486 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 631 transitions. Word has length 30 [2025-03-09 05:57:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:42,487 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 631 transitions. [2025-03-09 05:57:42,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-09 05:57:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 631 transitions. [2025-03-09 05:57:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:57:42,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:42,488 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-09 05:57:42,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:42,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:42,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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-09 05:57:42,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1481813343, now seen corresponding path program 1 times [2025-03-09 05:57:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:42,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009141405] [2025-03-09 05:57:42,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:42,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:57:42,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:57:42,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:42,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:42,925 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-09 05:57:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009141405] [2025-03-09 05:57:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009141405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275958271] [2025-03-09 05:57:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:42,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:42,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:42,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:42,927 INFO L87 Difference]: Start difference. First operand 458 states and 631 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-09 05:57:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:42,987 INFO L93 Difference]: Finished difference Result 458 states and 631 transitions. [2025-03-09 05:57:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:42,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-09 05:57:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:42,990 INFO L225 Difference]: With dead ends: 458 [2025-03-09 05:57:42,990 INFO L226 Difference]: Without dead ends: 457 [2025-03-09 05:57:42,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:42,990 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:42,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1113 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:57:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-09 05:57:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 453. [2025-03-09 05:57:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 392 states have (on average 1.5229591836734695) internal successors, (597), 435 states have internal predecessors, (597), 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-09 05:57:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 625 transitions. [2025-03-09 05:57:43,005 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 625 transitions. Word has length 49 [2025-03-09 05:57:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:43,005 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 625 transitions. [2025-03-09 05:57:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-09 05:57:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 625 transitions. [2025-03-09 05:57:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:57:43,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:43,006 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, 1] [2025-03-09 05:57:43,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:57:43,006 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-09 05:57:43,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:43,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1419790845, now seen corresponding path program 1 times [2025-03-09 05:57:43,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:43,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998837651] [2025-03-09 05:57:43,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:43,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:57:43,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:57:43,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:43,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:43,216 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-09 05:57:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998837651] [2025-03-09 05:57:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998837651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696260749] [2025-03-09 05:57:43,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:43,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:43,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 05:57:43,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:57:43,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:57:43,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:43,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:43,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:43,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:43,720 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-09 05:57:43,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696260749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:43,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:57:43,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:57:43,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164132675] [2025-03-09 05:57:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:43,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:57:43,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:43,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:57:43,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:43,721 INFO L87 Difference]: Start difference. First operand 453 states and 625 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-09 05:57:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:43,840 INFO L93 Difference]: Finished difference Result 749 states and 1061 transitions. [2025-03-09 05:57:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:57:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-09 05:57:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:43,843 INFO L225 Difference]: With dead ends: 749 [2025-03-09 05:57:43,845 INFO L226 Difference]: Without dead ends: 748 [2025-03-09 05:57:43,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-09 05:57:43,847 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 823 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:43,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1511 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-09 05:57:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 452. [2025-03-09 05:57:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 392 states have (on average 1.5204081632653061) internal successors, (596), 434 states have internal predecessors, (596), 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-09 05:57:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 624 transitions. [2025-03-09 05:57:43,863 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 624 transitions. Word has length 50 [2025-03-09 05:57:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:43,864 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 624 transitions. [2025-03-09 05:57:43,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-09 05:57:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 624 transitions. [2025-03-09 05:57:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 05:57:43,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:43,866 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, 1] [2025-03-09 05:57:43,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:57:44,067 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,SelfDestructingSolverStorable11 [2025-03-09 05:57:44,067 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-09 05:57:44,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:44,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1063842452, now seen corresponding path program 1 times [2025-03-09 05:57:44,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:44,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569443398] [2025-03-09 05:57:44,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:44,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:44,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:57:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:57:44,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:44,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:44,296 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-09 05:57:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569443398] [2025-03-09 05:57:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569443398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198819003] [2025-03-09 05:57:44,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:44,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:44,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:44,299 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 05:57:44,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:57:44,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:57:44,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:44,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:44,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:44,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:44,790 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-09 05:57:44,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:44,811 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-09 05:57:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198819003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:44,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:44,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:57:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968592134] [2025-03-09 05:57:44,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:44,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:57:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:44,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:57:44,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:44,813 INFO L87 Difference]: Start difference. First operand 452 states and 624 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-09 05:57:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:45,076 INFO L93 Difference]: Finished difference Result 1633 states and 2366 transitions. [2025-03-09 05:57:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:45,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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 51 [2025-03-09 05:57:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:45,082 INFO L225 Difference]: With dead ends: 1633 [2025-03-09 05:57:45,082 INFO L226 Difference]: Without dead ends: 1632 [2025-03-09 05:57:45,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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-09 05:57:45,083 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 1686 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 4403 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:45,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 4403 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:57:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-03-09 05:57:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 464. [2025-03-09 05:57:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 404 states have (on average 1.5123762376237624) internal successors, (611), 446 states have internal predecessors, (611), 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-09 05:57:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 639 transitions. [2025-03-09 05:57:45,104 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 639 transitions. Word has length 51 [2025-03-09 05:57:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:45,104 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 639 transitions. [2025-03-09 05:57:45,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-09 05:57:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 639 transitions. [2025-03-09 05:57:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:57:45,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:45,105 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:45,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:45,310 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-09 05:57:45,310 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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-09 05:57:45,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash 456076053, now seen corresponding path program 1 times [2025-03-09 05:57:45,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:45,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313880278] [2025-03-09 05:57:45,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:45,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:57:45,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:57:45,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:45,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:57:45,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:45,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313880278] [2025-03-09 05:57:45,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313880278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:45,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857751355] [2025-03-09 05:57:45,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:45,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:45,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:45,539 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:45,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 05:57:45,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:57:46,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:57:46,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:46,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:46,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:46,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:57:46,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:57:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857751355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:46,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:57:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039143162] [2025-03-09 05:57:46,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:46,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:57:46,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:46,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:57:46,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:46,050 INFO L87 Difference]: Start difference. First operand 464 states and 639 transitions. Second operand has 7 states, 7 states have (on average 5.0) 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-09 05:57:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:46,124 INFO L93 Difference]: Finished difference Result 903 states and 1255 transitions. [2025-03-09 05:57:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) 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 55 [2025-03-09 05:57:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:46,126 INFO L225 Difference]: With dead ends: 903 [2025-03-09 05:57:46,126 INFO L226 Difference]: Without dead ends: 482 [2025-03-09 05:57:46,127 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-09 05:57:46,128 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 4 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:46,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1665 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-09 05:57:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-03-09 05:57:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 422 states have (on average 1.490521327014218) internal successors, (629), 464 states have internal predecessors, (629), 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-09 05:57:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 657 transitions. [2025-03-09 05:57:46,141 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 657 transitions. Word has length 55 [2025-03-09 05:57:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:46,142 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 657 transitions. [2025-03-09 05:57:46,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) 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-09 05:57:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 657 transitions. [2025-03-09 05:57:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 05:57:46,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:46,143 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] [2025-03-09 05:57:46,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 05:57:46,343 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-09 05:57:46,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-09 05:57:46,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1541979733, now seen corresponding path program 1 times [2025-03-09 05:57:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:46,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134014176] [2025-03-09 05:57:46,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:46,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:46,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 05:57:46,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 05:57:46,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:46,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:46,567 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-09 05:57:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134014176] [2025-03-09 05:57:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134014176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:46,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:46,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108265450] [2025-03-09 05:57:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:46,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:46,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:46,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:46,569 INFO L87 Difference]: Start difference. First operand 482 states and 657 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-09 05:57:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:46,697 INFO L93 Difference]: Finished difference Result 959 states and 1340 transitions. [2025-03-09 05:57:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:46,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 60 [2025-03-09 05:57:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:46,701 INFO L225 Difference]: With dead ends: 959 [2025-03-09 05:57:46,702 INFO L226 Difference]: Without dead ends: 577 [2025-03-09 05:57:46,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:46,703 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 118 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1083 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-09 05:57:46,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1083 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-09 05:57:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 524. [2025-03-09 05:57:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.4794816414686824) internal successors, (685), 505 states have internal predecessors, (685), 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-09 05:57:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 715 transitions. [2025-03-09 05:57:46,721 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 715 transitions. Word has length 60 [2025-03-09 05:57:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:46,722 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 715 transitions. [2025-03-09 05:57:46,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-09 05:57:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 715 transitions. [2025-03-09 05:57:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 05:57:46,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:46,722 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, 1] [2025-03-09 05:57:46,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 05:57:46,723 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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-09 05:57:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash -78782007, now seen corresponding path program 1 times [2025-03-09 05:57:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522664626] [2025-03-09 05:57:46,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:46,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:46,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:57:46,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:57:46,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:46,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:46,953 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-09 05:57:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:46,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522664626] [2025-03-09 05:57:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522664626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:46,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:46,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:46,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888953968] [2025-03-09 05:57:46,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:46,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:46,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:46,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:46,955 INFO L87 Difference]: Start difference. First operand 524 states and 715 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-09 05:57:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:47,012 INFO L93 Difference]: Finished difference Result 526 states and 715 transitions. [2025-03-09 05:57:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 62 [2025-03-09 05:57:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:47,015 INFO L225 Difference]: With dead ends: 526 [2025-03-09 05:57:47,016 INFO L226 Difference]: Without dead ends: 524 [2025-03-09 05:57:47,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:47,017 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1111 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-09 05:57:47,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1111 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:57:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-09 05:57:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-09 05:57:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.4751619870410366) internal successors, (683), 505 states have internal predecessors, (683), 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-09 05:57:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 713 transitions. [2025-03-09 05:57:47,035 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 713 transitions. Word has length 62 [2025-03-09 05:57:47,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:47,035 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 713 transitions. [2025-03-09 05:57:47,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-09 05:57:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 713 transitions. [2025-03-09 05:57:47,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:57:47,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:47,036 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, 1] [2025-03-09 05:57:47,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 05:57:47,037 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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-09 05:57:47,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash 296358176, now seen corresponding path program 2 times [2025-03-09 05:57:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:47,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914360439] [2025-03-09 05:57:47,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:47,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-09 05:57:47,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-03-09 05:57:47,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:57:47,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:47,370 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-09 05:57:47,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:47,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914360439] [2025-03-09 05:57:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914360439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:57:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317478660] [2025-03-09 05:57:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:47,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:57:47,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:47,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:57:47,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:47,373 INFO L87 Difference]: Start difference. First operand 524 states and 713 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-09 05:57:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:47,513 INFO L93 Difference]: Finished difference Result 976 states and 1348 transitions. [2025-03-09 05:57:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:47,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 63 [2025-03-09 05:57:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:47,516 INFO L225 Difference]: With dead ends: 976 [2025-03-09 05:57:47,516 INFO L226 Difference]: Without dead ends: 524 [2025-03-09 05:57:47,517 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-09 05:57:47,517 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 531 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:47,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2157 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-09 05:57:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-09 05:57:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.4730021598272138) internal successors, (682), 505 states have internal predecessors, (682), 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-09 05:57:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 712 transitions. [2025-03-09 05:57:47,532 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 712 transitions. Word has length 63 [2025-03-09 05:57:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:47,532 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 712 transitions. [2025-03-09 05:57:47,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-09 05:57:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 712 transitions. [2025-03-09 05:57:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 05:57:47,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:47,532 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:47,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 05:57:47,533 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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-09 05:57:47,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1659592763, now seen corresponding path program 2 times [2025-03-09 05:57:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:47,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73372999] [2025-03-09 05:57:47,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:47,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:57:47,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:57:47,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:57:47,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-09 05:57:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73372999] [2025-03-09 05:57:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73372999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948321756] [2025-03-09 05:57:47,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:47,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:47,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 05:57:48,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:57:49,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:57:49,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:57:49,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:49,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:57:49,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:57:49,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:57:50,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948321756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:50,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:50,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:57:50,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965155465] [2025-03-09 05:57:50,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:50,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:57:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:50,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:57:50,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:57:50,034 INFO L87 Difference]: Start difference. First operand 524 states and 712 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-09 05:57:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:50,405 INFO L93 Difference]: Finished difference Result 1031 states and 1417 transitions. [2025-03-09 05:57:50,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 05:57:50,406 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-09 05:57:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:50,408 INFO L225 Difference]: With dead ends: 1031 [2025-03-09 05:57:50,408 INFO L226 Difference]: Without dead ends: 559 [2025-03-09 05:57:50,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 05:57:50,412 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 9 mSDsluCounter, 3843 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4395 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:50,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4395 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:57:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-09 05:57:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-09 05:57:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 499 states have (on average 1.43687374749499) internal successors, (717), 540 states have internal predecessors, (717), 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-09 05:57:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 747 transitions. [2025-03-09 05:57:50,428 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 747 transitions. Word has length 73 [2025-03-09 05:57:50,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:50,428 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 747 transitions. [2025-03-09 05:57:50,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-09 05:57:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 747 transitions. [2025-03-09 05:57:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 05:57:50,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:50,430 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, 1] [2025-03-09 05:57:50,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:50,631 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,SelfDestructingSolverStorable17 [2025-03-09 05:57:50,632 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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-09 05:57:50,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:50,632 INFO L85 PathProgramCache]: Analyzing trace with hash 4116104, now seen corresponding path program 1 times [2025-03-09 05:57:50,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:50,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165008519] [2025-03-09 05:57:50,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:50,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:50,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:57:50,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:57:50,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:50,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:51,022 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-09 05:57:51,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165008519] [2025-03-09 05:57:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165008519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274587267] [2025-03-09 05:57:51,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:51,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:51,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:51,026 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:51,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 05:57:51,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:57:51,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:57:51,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:51,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:51,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:57:51,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:51,644 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-09 05:57:51,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:51,704 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-09 05:57:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274587267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:51,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 05:57:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550011394] [2025-03-09 05:57:51,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:51,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:57:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:51,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:57:51,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:57:51,706 INFO L87 Difference]: Start difference. First operand 559 states and 747 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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-09 05:57:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:52,302 INFO L93 Difference]: Finished difference Result 3924 states and 5653 transitions. [2025-03-09 05:57:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:57:52,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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 97 [2025-03-09 05:57:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:52,313 INFO L225 Difference]: With dead ends: 3924 [2025-03-09 05:57:52,314 INFO L226 Difference]: Without dead ends: 3923 [2025-03-09 05:57:52,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 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-09 05:57:52,315 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 5338 mSDsluCounter, 7066 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5408 SdHoareTripleChecker+Valid, 7617 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:52,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5408 Valid, 7617 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:57:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2025-03-09 05:57:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 583. [2025-03-09 05:57:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 523 states have (on average 1.4282982791586998) internal successors, (747), 564 states have internal predecessors, (747), 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-09 05:57:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 777 transitions. [2025-03-09 05:57:52,354 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 777 transitions. Word has length 97 [2025-03-09 05:57:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:52,354 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 777 transitions. [2025-03-09 05:57:52,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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-09 05:57:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 777 transitions. [2025-03-09 05:57:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:57:52,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:52,355 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-09 05:57:52,366 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-09 05:57:52,558 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-09 05:57:52,559 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_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-09 05:57:52,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -498643718, now seen corresponding path program 1 times [2025-03-09 05:57:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143646770] [2025-03-09 05:57:52,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:52,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:57:52,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:57:52,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:52,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:52,763 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-09 05:57:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:52,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143646770] [2025-03-09 05:57:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143646770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:52,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:52,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360947905] [2025-03-09 05:57:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:52,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:52,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:52,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:52,765 INFO L87 Difference]: Start difference. First operand 583 states and 777 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-09 05:57:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:52,887 INFO L93 Difference]: Finished difference Result 961 states and 1331 transitions. [2025-03-09 05:57:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:52,888 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-09 05:57:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:52,891 INFO L225 Difference]: With dead ends: 961 [2025-03-09 05:57:52,891 INFO L226 Difference]: Without dead ends: 635 [2025-03-09 05:57:52,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:52,892 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 74 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:52,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1092 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-09 05:57:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 586. [2025-03-09 05:57:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 528 states have (on average 1.4223484848484849) internal successors, (751), 567 states have internal predecessors, (751), 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-09 05:57:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 781 transitions. [2025-03-09 05:57:52,911 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 781 transitions. Word has length 102 [2025-03-09 05:57:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:52,911 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 781 transitions. [2025-03-09 05:57:52,911 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-09 05:57:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 781 transitions. [2025-03-09 05:57:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:57:52,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:52,912 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-09 05:57:52,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 05:57:52,912 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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-09 05:57:52,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash -494367043, now seen corresponding path program 1 times [2025-03-09 05:57:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:52,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541167369] [2025-03-09 05:57:52,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:52,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:53,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:57:53,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:57:53,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:53,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:53,198 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-09 05:57:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541167369] [2025-03-09 05:57:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541167369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259725570] [2025-03-09 05:57:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:53,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:53,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:53,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:53,199 INFO L87 Difference]: Start difference. First operand 586 states and 781 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-09 05:57:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:53,310 INFO L93 Difference]: Finished difference Result 639 states and 859 transitions. [2025-03-09 05:57:53,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:53,310 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-09 05:57:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:53,313 INFO L225 Difference]: With dead ends: 639 [2025-03-09 05:57:53,313 INFO L226 Difference]: Without dead ends: 636 [2025-03-09 05:57:53,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:53,314 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 189 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:53,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 929 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-09 05:57:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 583. [2025-03-09 05:57:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 528 states have (on average 1.4166666666666667) internal successors, (748), 564 states have internal predecessors, (748), 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-09 05:57:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 778 transitions. [2025-03-09 05:57:53,337 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 778 transitions. Word has length 102 [2025-03-09 05:57:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:53,337 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 778 transitions. [2025-03-09 05:57:53,337 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-09 05:57:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 778 transitions. [2025-03-09 05:57:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:57:53,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:53,338 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, 1] [2025-03-09 05:57:53,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 05:57:53,339 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_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-09 05:57:53,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1721914447, now seen corresponding path program 1 times [2025-03-09 05:57:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563558254] [2025-03-09 05:57:53,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:53,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:57:53,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:57:53,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:53,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:53,568 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-09 05:57:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563558254] [2025-03-09 05:57:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563558254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:53,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302247674] [2025-03-09 05:57:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:53,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:53,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:53,569 INFO L87 Difference]: Start difference. First operand 583 states and 778 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-09 05:57:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:53,693 INFO L93 Difference]: Finished difference Result 963 states and 1333 transitions. [2025-03-09 05:57:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:53,694 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 103 [2025-03-09 05:57:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:53,696 INFO L225 Difference]: With dead ends: 963 [2025-03-09 05:57:53,696 INFO L226 Difference]: Without dead ends: 633 [2025-03-09 05:57:53,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:53,698 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 156 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:53,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1005 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-09 05:57:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 568. [2025-03-09 05:57:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 517 states have (on average 1.4081237911025144) internal successors, (728), 549 states have internal predecessors, (728), 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-09 05:57:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 758 transitions. [2025-03-09 05:57:53,721 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 758 transitions. Word has length 103 [2025-03-09 05:57:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:53,722 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 758 transitions. [2025-03-09 05:57:53,722 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-09 05:57:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 758 transitions. [2025-03-09 05:57:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:57:53,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:53,723 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, 1] [2025-03-09 05:57:53,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 05:57:53,723 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-09 05:57:53,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1854491411, now seen corresponding path program 1 times [2025-03-09 05:57:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693844818] [2025-03-09 05:57:53,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:53,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:53,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:57:53,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:57:53,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:53,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:53,962 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-09 05:57:53,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:53,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693844818] [2025-03-09 05:57:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693844818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:53,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329968020] [2025-03-09 05:57:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:53,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:53,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:53,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:53,963 INFO L87 Difference]: Start difference. First operand 568 states and 758 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-09 05:57:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:54,078 INFO L93 Difference]: Finished difference Result 621 states and 836 transitions. [2025-03-09 05:57:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:54,079 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 103 [2025-03-09 05:57:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:54,081 INFO L225 Difference]: With dead ends: 621 [2025-03-09 05:57:54,081 INFO L226 Difference]: Without dead ends: 620 [2025-03-09 05:57:54,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:54,081 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 187 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:54,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 961 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-09 05:57:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 567. [2025-03-09 05:57:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 517 states have (on average 1.4061895551257253) internal successors, (727), 548 states have internal predecessors, (727), 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-09 05:57:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 757 transitions. [2025-03-09 05:57:54,097 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 757 transitions. Word has length 103 [2025-03-09 05:57:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:54,097 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 757 transitions. [2025-03-09 05:57:54,097 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-09 05:57:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 757 transitions. [2025-03-09 05:57:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 05:57:54,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:54,098 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, 1] [2025-03-09 05:57:54,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 05:57:54,098 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-09 05:57:54,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash 596109505, now seen corresponding path program 1 times [2025-03-09 05:57:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:54,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064224178] [2025-03-09 05:57:54,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:54,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:54,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 05:57:54,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 05:57:54,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:54,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:54,367 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-09 05:57:54,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064224178] [2025-03-09 05:57:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064224178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993157185] [2025-03-09 05:57:54,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:54,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:54,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:54,370 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:54,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 05:57:54,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 05:57:55,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 05:57:55,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:55,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:55,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:57:55,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:55,080 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-09 05:57:55,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:55,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993157185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:55,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:57:55,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-09 05:57:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413370980] [2025-03-09 05:57:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:55,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:57:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:55,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:57:55,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:55,081 INFO L87 Difference]: Start difference. First operand 567 states and 757 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-09 05:57:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:55,216 INFO L93 Difference]: Finished difference Result 1062 states and 1468 transitions. [2025-03-09 05:57:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:57:55,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 105 [2025-03-09 05:57:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:55,219 INFO L225 Difference]: With dead ends: 1062 [2025-03-09 05:57:55,219 INFO L226 Difference]: Without dead ends: 682 [2025-03-09 05:57:55,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 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-09 05:57:55,220 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 311 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:55,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1615 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-09 05:57:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 566. [2025-03-09 05:57:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 518 states have (on average 1.3976833976833978) internal successors, (724), 547 states have internal predecessors, (724), 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-09 05:57:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 754 transitions. [2025-03-09 05:57:55,237 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 754 transitions. Word has length 105 [2025-03-09 05:57:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:55,238 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 754 transitions. [2025-03-09 05:57:55,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-09 05:57:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 754 transitions. [2025-03-09 05:57:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 05:57:55,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:55,240 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, 1] [2025-03-09 05:57:55,252 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-09 05:57:55,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 05:57:55,441 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-09 05:57:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -990745217, now seen corresponding path program 1 times [2025-03-09 05:57:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178218064] [2025-03-09 05:57:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:55,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 05:57:55,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 05:57:55,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:55,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:55,670 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-09 05:57:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178218064] [2025-03-09 05:57:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178218064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:55,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:55,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624574588] [2025-03-09 05:57:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:55,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:55,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:55,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:55,671 INFO L87 Difference]: Start difference. First operand 566 states and 754 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-09 05:57:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:55,720 INFO L93 Difference]: Finished difference Result 566 states and 754 transitions. [2025-03-09 05:57:55,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:55,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 108 [2025-03-09 05:57:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:55,723 INFO L225 Difference]: With dead ends: 566 [2025-03-09 05:57:55,723 INFO L226 Difference]: Without dead ends: 565 [2025-03-09 05:57:55,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:55,723 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1085 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-09 05:57:55,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1085 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:57:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-09 05:57:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-03-09 05:57:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 518 states have (on average 1.3957528957528957) internal successors, (723), 546 states have internal predecessors, (723), 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-09 05:57:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 753 transitions. [2025-03-09 05:57:55,742 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 753 transitions. Word has length 108 [2025-03-09 05:57:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:55,742 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 753 transitions. [2025-03-09 05:57:55,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-09 05:57:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 753 transitions. [2025-03-09 05:57:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:57:55,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:55,743 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:55,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 05:57:55,744 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting bb_error_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [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-09 05:57:55,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1738577036, now seen corresponding path program 1 times [2025-03-09 05:57:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:55,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839546945] [2025-03-09 05:57:55,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:55,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:57:55,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:57:55,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:55,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:56,021 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-09 05:57:56,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:56,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839546945] [2025-03-09 05:57:56,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839546945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:56,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:56,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:57:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486035909] [2025-03-09 05:57:56,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:56,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:57:56,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:56,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:57:56,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:57:56,024 INFO L87 Difference]: Start difference. First operand 565 states and 753 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:56,086 INFO L93 Difference]: Finished difference Result 574 states and 761 transitions. [2025-03-09 05:57:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:57:56,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110 [2025-03-09 05:57:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:56,088 INFO L225 Difference]: With dead ends: 574 [2025-03-09 05:57:56,089 INFO L226 Difference]: Without dead ends: 571 [2025-03-09 05:57:56,089 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-09 05:57:56,090 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 8 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:56,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1626 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:57:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-09 05:57:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 568. [2025-03-09 05:57:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 521 states have (on average 1.3934740882917467) internal successors, (726), 548 states have internal predecessors, (726), 17 states have call successors, (17), 6 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-09 05:57:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 756 transitions. [2025-03-09 05:57:56,106 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 756 transitions. Word has length 110 [2025-03-09 05:57:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:56,106 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 756 transitions. [2025-03-09 05:57:56,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 756 transitions. [2025-03-09 05:57:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:57:56,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:56,108 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:56,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 05:57:56,108 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting bb_error_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [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-09 05:57:56,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1738576075, now seen corresponding path program 1 times [2025-03-09 05:57:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482274125] [2025-03-09 05:57:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:56,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:57:56,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:57:56,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:56,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:56,789 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-09 05:57:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:56,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482274125] [2025-03-09 05:57:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482274125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:56,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:56,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:57:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272824987] [2025-03-09 05:57:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:56,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:57:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:56,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:57:56,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:57:56,794 INFO L87 Difference]: Start difference. First operand 568 states and 756 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:56,870 INFO L93 Difference]: Finished difference Result 988 states and 1351 transitions. [2025-03-09 05:57:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:57:56,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110 [2025-03-09 05:57:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:56,874 INFO L225 Difference]: With dead ends: 988 [2025-03-09 05:57:56,875 INFO L226 Difference]: Without dead ends: 574 [2025-03-09 05:57:56,876 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-09 05:57:56,876 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 4 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1623 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-09 05:57:56,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1623 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-09 05:57:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 573. [2025-03-09 05:57:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 525 states have (on average 1.3942857142857144) internal successors, (732), 552 states have internal predecessors, (732), 17 states have call successors, (17), 7 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-09 05:57:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 763 transitions. [2025-03-09 05:57:56,894 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 763 transitions. Word has length 110 [2025-03-09 05:57:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:56,895 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 763 transitions. [2025-03-09 05:57:56,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 763 transitions. [2025-03-09 05:57:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-09 05:57:56,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:56,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:56,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 05:57:56,896 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting bb_error_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [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-09 05:57:56,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2090005376, now seen corresponding path program 1 times [2025-03-09 05:57:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:56,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751483529] [2025-03-09 05:57:56,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:57,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 05:57:57,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 05:57:57,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:57,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:57:57,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:57,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751483529] [2025-03-09 05:57:57,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751483529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:57,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262156483] [2025-03-09 05:57:57,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:57,500 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:57,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 05:57:58,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 05:57:58,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 05:57:58,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:58,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:58,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1983 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-03-09 05:57:58,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:58,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:58,363 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-09 05:57:58,406 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 05:57:58,406 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-09 05:57:58,420 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-09 05:57:58,456 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-09 05:57:58,492 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-09 05:57:58,527 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-09 05:57:58,572 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-09 05:57:58,620 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-09 05:57:58,664 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-09 05:57:58,713 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-09 05:57:58,763 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-09 05:57:58,801 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-09 05:57:58,839 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-09 05:57:58,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:58,920 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-09 05:57:59,055 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-09 05:57:59,055 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-09 05:57:59,184 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-09 05:57:59,185 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-09 05:57:59,208 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 16 treesize of output 11 [2025-03-09 05:57:59,284 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-09 05:57:59,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:59,298 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-09 05:57:59,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:59,310 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-03-09 05:57:59,310 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 109 treesize of output 90 [2025-03-09 05:57:59,318 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 68 treesize of output 32 [2025-03-09 05:57:59,333 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-09 05:57:59,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:59,349 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-03-09 05:57:59,350 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 115 treesize of output 101 [2025-03-09 05:57:59,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:59,361 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-09 05:57:59,387 INFO L349 Elim1Store]: treesize reduction 68, result has 34.0 percent of original size [2025-03-09 05:57:59,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 73 [2025-03-09 05:57:59,437 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-09 05:57:59,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:59,460 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-09 05:57:59,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:59,473 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-09 05:57:59,474 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 98 treesize of output 84 [2025-03-09 05:57:59,483 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-09 05:57:59,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:57:59,495 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-09 05:57:59,495 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 104 treesize of output 90 [2025-03-09 05:57:59,605 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:57:59,606 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 110 treesize of output 99 [2025-03-09 05:57:59,613 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-09 05:57:59,808 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:57:59,808 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 110 treesize of output 99 [2025-03-09 05:57:59,816 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-09 05:58:00,040 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:58:00,040 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 110 treesize of output 99 [2025-03-09 05:58:00,050 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-09 05:58:00,216 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:58:00,217 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 110 treesize of output 99 [2025-03-09 05:58:00,251 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-09 05:58:00,413 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:58:00,413 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 110 treesize of output 99 [2025-03-09 05:58:00,447 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-09 05:58:00,581 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:58:00,582 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 110 treesize of output 99 [2025-03-09 05:58:00,611 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-09 05:58:00,738 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:58:00,738 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 110 treesize of output 99 [2025-03-09 05:58:00,745 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-09 05:58:00,927 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:58:00,927 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 110 treesize of output 99 [2025-03-09 05:58:00,934 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-09 05:58:01,095 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:58:01,096 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 110 treesize of output 99 [2025-03-09 05:58:01,103 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-09 05:58:01,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 86 treesize of output 30 [2025-03-09 05:58:01,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-09 05:58:01,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:01,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:01,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:01,647 INFO L349 Elim1Store]: treesize reduction 33, result has 49.2 percent of original size [2025-03-09 05:58:01,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 66 [2025-03-09 05:58:01,786 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-09 05:58:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-09 05:58:01,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:58:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262156483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:58:02,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:58:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15] total 19 [2025-03-09 05:58:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054490235] [2025-03-09 05:58:02,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:58:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 05:58:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:58:02,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 05:58:02,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=481, Unknown=3, NotChecked=0, Total=552 [2025-03-09 05:58:02,125 INFO L87 Difference]: Start difference. First operand 573 states and 763 transitions. Second operand has 19 states, 18 states have (on average 5.666666666666667) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 05:58:06,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 05:58:13,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 05:58:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:58:22,491 INFO L93 Difference]: Finished difference Result 1517 states and 2124 transitions. [2025-03-09 05:58:22,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 05:58:22,491 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.666666666666667) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 111 [2025-03-09 05:58:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:58:22,495 INFO L225 Difference]: With dead ends: 1517 [2025-03-09 05:58:22,495 INFO L226 Difference]: Without dead ends: 1096 [2025-03-09 05:58:22,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=253, Invalid=1303, Unknown=4, NotChecked=0, Total=1560 [2025-03-09 05:58:22,496 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 1856 mSDsluCounter, 6354 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 119 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1858 SdHoareTripleChecker+Valid, 6835 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2025-03-09 05:58:22,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1858 Valid, 6835 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2706 Invalid, 1 Unknown, 0 Unchecked, 14.8s Time] [2025-03-09 05:58:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-03-09 05:58:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 627. [2025-03-09 05:58:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 576 states have (on average 1.3940972222222223) internal successors, (803), 602 states have internal predecessors, (803), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 15 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-09 05:58:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 835 transitions. [2025-03-09 05:58:22,544 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 835 transitions. Word has length 111 [2025-03-09 05:58:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:58:22,544 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 835 transitions. [2025-03-09 05:58:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.666666666666667) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 05:58:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 835 transitions. [2025-03-09 05:58:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:58:22,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:58:22,545 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:58:22,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 05:58:22,745 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,SelfDestructingSolverStorable27 [2025-03-09 05:58:22,746 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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-09 05:58:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:58:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 385989555, now seen corresponding path program 1 times [2025-03-09 05:58:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:58:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143486984] [2025-03-09 05:58:22,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:58:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:58:22,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:58:22,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:58:22,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:58:22,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:58:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:58:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:58:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143486984] [2025-03-09 05:58:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143486984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:58:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387019797] [2025-03-09 05:58:23,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:58:23,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:58:23,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:58:23,046 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:58:23,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 05:58:23,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:58:23,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:58:23,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:58:23,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:58:23,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:58:23,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:58:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:58:23,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:58:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:58:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387019797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:58:23,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:58:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:58:23,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749816557] [2025-03-09 05:58:23,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:58:23,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:58:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:58:23,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:58:23,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:58:23,901 INFO L87 Difference]: Start difference. First operand 627 states and 835 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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-09 05:58:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:58:24,018 INFO L93 Difference]: Finished difference Result 730 states and 946 transitions. [2025-03-09 05:58:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:58:24,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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 110 [2025-03-09 05:58:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:58:24,021 INFO L225 Difference]: With dead ends: 730 [2025-03-09 05:58:24,021 INFO L226 Difference]: Without dead ends: 729 [2025-03-09 05:58:24,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 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-09 05:58:24,021 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 0 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:58:24,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1623 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:58:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-09 05:58:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2025-03-09 05:58:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 678 states have (on average 1.3436578171091444) internal successors, (911), 704 states have internal predecessors, (911), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 15 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-09 05:58:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 943 transitions. [2025-03-09 05:58:24,086 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 943 transitions. Word has length 110 [2025-03-09 05:58:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:58:24,086 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 943 transitions. [2025-03-09 05:58:24,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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-09 05:58:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 943 transitions. [2025-03-09 05:58:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-09 05:58:24,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:58:24,087 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 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-09 05:58:24,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 05:58:24,288 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,SelfDestructingSolverStorable28 [2025-03-09 05:58:24,289 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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-09 05:58:24,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:58:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1205661684, now seen corresponding path program 1 times [2025-03-09 05:58:24,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:58:24,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143119620] [2025-03-09 05:58:24,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:58:24,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:58:24,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 05:58:24,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 05:58:24,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:58:24,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:58:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:58:24,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:58:24,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143119620] [2025-03-09 05:58:24,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143119620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:58:24,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215931814] [2025-03-09 05:58:24,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:58:24,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:58:24,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:58:24,762 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:58:24,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 05:58:25,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 05:58:25,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 05:58:25,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:58:25,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:58:25,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 1927 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-09 05:58:25,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:58:25,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:25,514 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-09 05:58:25,542 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 05:58:25,543 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-09 05:58:25,549 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-09 05:58:25,571 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-09 05:58:25,598 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-09 05:58:25,624 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-09 05:58:25,646 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-09 05:58:25,672 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-09 05:58:25,699 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-09 05:58:25,723 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-09 05:58:25,749 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-09 05:58:25,769 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-09 05:58:25,789 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-09 05:58:25,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:25,834 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-09 05:58:25,912 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-09 05:58:25,912 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-09 05:58:25,971 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-09 05:58:26,017 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-09 05:58:26,017 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-09 05:58:26,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:26,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-03-09 05:58:26,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:26,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2025-03-09 05:58:26,120 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 109 [2025-03-09 05:58:26,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:26,129 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-09 05:58:26,149 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-09 05:58:26,150 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-09 05:58:26,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:26,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-03-09 05:58:26,174 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2025-03-09 05:58:26,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 93 [2025-03-09 05:58:26,179 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 71 treesize of output 35 [2025-03-09 05:58:26,183 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-09 05:58:26,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:26,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-03-09 05:58:26,253 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:26,263 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:26,263 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 32 treesize of output 23 [2025-03-09 05:58:26,369 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:26,392 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:26,392 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 32 treesize of output 23 [2025-03-09 05:58:26,468 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:26,486 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:26,486 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 32 treesize of output 23 [2025-03-09 05:58:26,565 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:26,584 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:26,585 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 32 treesize of output 23 [2025-03-09 05:58:26,659 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:26,669 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:26,669 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 32 treesize of output 23 [2025-03-09 05:58:26,765 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:26,788 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:26,789 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 32 treesize of output 23 [2025-03-09 05:58:26,863 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:26,888 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:26,888 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 32 treesize of output 23 [2025-03-09 05:58:26,977 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:26,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:27,001 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:27,001 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 32 treesize of output 23 [2025-03-09 05:58:27,077 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-09 05:58:27,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-09 05:58:27,096 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-09 05:58:27,096 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 32 treesize of output 23 [2025-03-09 05:58:27,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 24 [2025-03-09 05:58:27,178 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-09 05:58:27,306 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset_#t~loopctr286_10| Int) (|#Ultimate.C_memset_#ptr.base| Int)) (and (= (store |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_10| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memset_#t~loopctr286_10|))) is different from true [2025-03-09 05:58:27,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:58:27,329 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-09 05:58:27,330 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 1 case distinctions, treesize of input 22 treesize of output 29 [2025-03-09 05:58:27,456 INFO L349 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2025-03-09 05:58:27,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 64 [2025-03-09 05:58:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 241 trivial. 2 not checked. [2025-03-09 05:58:27,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:58:36,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9385 (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_9379))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9381))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9380) .cse1 v_ArrVal_9382) .cse2 v_ArrVal_9384) (select (select (store .cse3 .cse2 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_9385))))))) 11) 0) 33))) is different from false [2025-03-09 05:58:36,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9385 (Array Int Int))) (not (= (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_9375))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_9378))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_9379))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_9381))) (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_9376) .cse1 v_ArrVal_9377) .cse2 v_ArrVal_9380) .cse3 v_ArrVal_9382) .cse4 v_ArrVal_9384) (select (select (store .cse5 .cse4 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_9385))))))))))) 11) 0) 33))) is different from false [2025-03-09 05:58:36,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9373 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9374 (Array Int Int)) (v_ArrVal_9385 (Array Int Int)) (v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int))) (not (= (select (select (let ((.cse7 (+ (* 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|) .cse7))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9373))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_9375))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_9378))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_9379))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_9381))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9374) .cse1 v_ArrVal_9376) .cse2 v_ArrVal_9377) .cse3 v_ArrVal_9380) .cse4 v_ArrVal_9382) .cse5 v_ArrVal_9384) (select (select (store .cse6 .cse5 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_9385))))))))))))) 11) 0) 33))) is different from false [2025-03-09 05:58:36,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9371 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9372 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9373 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9374 (Array Int Int)) (v_ArrVal_9385 (Array Int Int)) (v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int))) (not (= (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_9372))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_9373))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_9375))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_9378))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_9379))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_9381))) (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_9371) .cse1 v_ArrVal_9374) .cse2 v_ArrVal_9376) .cse3 v_ArrVal_9377) .cse4 v_ArrVal_9380) .cse5 v_ArrVal_9382) .cse6 v_ArrVal_9384) (select (select (store .cse7 .cse6 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_9385))))))))))))))) 11) 0) 33))) is different from false [2025-03-09 05:58:37,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9371 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9372 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9373 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9374 (Array Int Int)) (v_ArrVal_9385 (Array Int Int)) (v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9369 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int))) (not (= 33 (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_9369))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_9372))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_9373))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_9375))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_9378))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_9379))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse8 (store .cse10 .cse6 v_ArrVal_9381))) (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_9370) .cse1 v_ArrVal_9371) .cse2 v_ArrVal_9374) .cse3 v_ArrVal_9376) .cse4 v_ArrVal_9377) .cse5 v_ArrVal_9380) .cse6 v_ArrVal_9382) .cse7 v_ArrVal_9384) (select (select (store .cse8 .cse7 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_9385))))))))))))))))) 11) 0)))) is different from false [2025-03-09 05:58:40,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9371 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9372 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9373 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9374 (Array Int Int)) (v_ArrVal_9385 (Array Int Int)) (v_ArrVal_9368 (Array Int Int)) (v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9369 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9367 (Array Int Int)) (v_ArrVal_9378 (Array Int Int))) (not (= 33 (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_9368))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_9369))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_9372))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_9373))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_9375))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_9378))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_9379))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_9381))) (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_9367) .cse1 v_ArrVal_9370) .cse2 v_ArrVal_9371) .cse3 v_ArrVal_9374) .cse4 v_ArrVal_9376) .cse5 v_ArrVal_9377) .cse6 v_ArrVal_9380) .cse7 v_ArrVal_9382) .cse8 v_ArrVal_9384) (select (select (store .cse9 .cse8 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_9385))))))))))))))))))) 11) 0)))) is different from false [2025-03-09 05:58:40,073 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-09 05:58:40,073 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 2 case distinctions, treesize of input 51167 treesize of output 14364