./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-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 ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:38:08,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:38:08,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:38:08,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:38:08,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:38:08,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:38:08,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:38:08,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:38:08,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:38:08,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:38:08,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:38:08,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:38:08,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:38:08,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:38:08,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:38:08,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:38:08,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:08,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:38:08,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:38:08,422 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 -> ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a [2025-03-04 14:38:08,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:38:08,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:38:08,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:38:08,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:38:08,701 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:38:08,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-03-04 14:38:09,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6346036b/8c93e0cd42664a49ad2603fbe21eb7a4/FLAGf156bd3dd [2025-03-04 14:38:10,292 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:38:10,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-03-04 14:38:10,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6346036b/8c93e0cd42664a49ad2603fbe21eb7a4/FLAGf156bd3dd [2025-03-04 14:38:10,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6346036b/8c93e0cd42664a49ad2603fbe21eb7a4 [2025-03-04 14:38:10,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:38:10,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:38:10,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:10,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:38:10,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:38:10,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:10" (1/1) ... [2025-03-04 14:38:10,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6ffe04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:10, skipping insertion in model container [2025-03-04 14:38:10,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:10" (1/1) ... [2025-03-04 14:38:10,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:38:11,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:11,119 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:38:11,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:11,349 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:38:11,355 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:38:11,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11 WrapperNode [2025-03-04 14:38:11,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:11,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:11,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:38:11,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:38:11,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,447 INFO L138 Inliner]: procedures = 615, calls = 586, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 1002 [2025-03-04 14:38:11,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:11,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:38:11,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:38:11,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:38:11,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,481 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:38:11,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:38:11,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:38:11,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:38:11,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:38:11,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:11,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:11,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:38:11,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2025-03-04 14:38:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:38:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:38:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-03-04 14:38:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:38:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 14:38:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 14:38:11,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:38:11,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:38:12,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579: havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset; [2025-03-04 14:38:12,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: havoc getuid_#t~nondet148#1; [2025-03-04 14:38:12,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc find_applet_by_name_#t~nondet78#1; [2025-03-04 14:38:12,883 INFO L? ?]: Removed 269 outVars from TransFormulas that were not future-live. [2025-03-04 14:38:12,883 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:38:12,897 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:38:12,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:38:12,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:12 BoogieIcfgContainer [2025-03-04 14:38:12,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:38:12,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:38:12,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:38:12,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:38:12,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:38:10" (1/3) ... [2025-03-04 14:38:12,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ed64f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:12, skipping insertion in model container [2025-03-04 14:38:12,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11" (2/3) ... [2025-03-04 14:38:12,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ed64f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:12, skipping insertion in model container [2025-03-04 14:38:12,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:12" (3/3) ... [2025-03-04 14:38:12,906 INFO L128 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-2.i [2025-03-04 14:38:12,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:38:12,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chroot-incomplete-2.i that has 5 procedures, 192 locations, 1 initial locations, 12 loop locations, and 34 error locations. [2025-03-04 14:38:12,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:38:12,978 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;@3a3bf38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:38:12,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-04 14:38:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 140 states have (on average 1.5857142857142856) internal successors, (222), 176 states have internal predecessors, (222), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:38:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:38:12,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:12,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:38:12,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:12,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash 9449663, now seen corresponding path program 1 times [2025-03-04 14:38:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874047421] [2025-03-04 14:38:12,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:13,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:38:13,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:38:13,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:13,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874047421] [2025-03-04 14:38:13,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874047421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:13,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:13,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799182477] [2025-03-04 14:38:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:13,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:13,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:13,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:13,646 INFO L87 Difference]: Start difference. First operand has 192 states, 140 states have (on average 1.5857142857142856) internal successors, (222), 176 states have internal predecessors, (222), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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-04 14:38:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:13,701 INFO L93 Difference]: Finished difference Result 294 states and 389 transitions. [2025-03-04 14:38:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:13,703 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-04 14:38:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:13,709 INFO L225 Difference]: With dead ends: 294 [2025-03-04 14:38:13,710 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 14:38:13,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:13,719 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:13,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 14:38:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 14:38:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 93 states have internal predecessors, (112), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2025-03-04 14:38:13,760 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 4 [2025-03-04 14:38:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:13,760 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2025-03-04 14:38:13,760 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-04 14:38:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2025-03-04 14:38:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:38:13,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:13,761 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:38:13,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:38:13,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:13,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1952691664, now seen corresponding path program 1 times [2025-03-04 14:38:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:13,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174773512] [2025-03-04 14:38:13,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:13,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:13,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:38:13,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:38:13,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:13,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174773512] [2025-03-04 14:38:14,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174773512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:14,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003694135] [2025-03-04 14:38:14,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:14,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:14,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:38:14,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:38:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:38:14,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:14,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:14,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:14,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003694135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:38:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553780190] [2025-03-04 14:38:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:14,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:14,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:14,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:14,542 INFO L87 Difference]: Start difference. First operand 103 states and 127 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-04 14:38:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:14,570 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2025-03-04 14:38:14,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:14,572 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-04 14:38:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:14,573 INFO L225 Difference]: With dead ends: 103 [2025-03-04 14:38:14,575 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 14:38:14,575 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-04 14:38:14,576 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:14,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 235 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 14:38:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 14:38:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 92 states have internal predecessors, (111), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-03-04 14:38:14,585 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 7 [2025-03-04 14:38:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:14,585 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-03-04 14:38:14,585 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-04 14:38:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-03-04 14:38:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:38:14,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:14,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:38:14,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:38:14,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:14,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:14,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash -403899199, now seen corresponding path program 1 times [2025-03-04 14:38:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:14,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349190878] [2025-03-04 14:38:14,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:14,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:38:14,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:38:14,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:14,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:38:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349190878] [2025-03-04 14:38:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349190878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926078787] [2025-03-04 14:38:14,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:14,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:14,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:14,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:14,981 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:38:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:14,992 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2025-03-04 14:38:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 14:38:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:14,993 INFO L225 Difference]: With dead ends: 102 [2025-03-04 14:38:14,993 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 14:38:14,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:14,994 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:14,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 14:38:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-03-04 14:38:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.44) internal successors, (108), 89 states have internal predecessors, (108), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-03-04 14:38:14,999 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 8 [2025-03-04 14:38:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:14,999 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-03-04 14:38:14,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:38:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2025-03-04 14:38:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:38:15,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:15,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:38:15,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:15,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:15,001 INFO L85 PathProgramCache]: Analyzing trace with hash 410801087, now seen corresponding path program 1 times [2025-03-04 14:38:15,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:15,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922701583] [2025-03-04 14:38:15,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:15,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:38:15,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:38:15,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:15,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922701583] [2025-03-04 14:38:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922701583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192622307] [2025-03-04 14:38:15,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:15,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:15,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:15,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:15,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:38:15,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:38:15,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:38:15,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:15,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:15,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:15,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:38:15,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:15,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192622307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:15,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:15,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:38:15,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45589587] [2025-03-04 14:38:15,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:15,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:15,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:15,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:15,604 INFO L87 Difference]: Start difference. First operand 99 states and 123 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-04 14:38:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:15,627 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2025-03-04 14:38:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:15,627 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-04 14:38:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:15,632 INFO L225 Difference]: With dead ends: 99 [2025-03-04 14:38:15,632 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 14:38:15,632 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-04 14:38:15,633 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 70 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:15,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 152 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 14:38:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 14:38:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 87 states have internal predecessors, (106), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2025-03-04 14:38:15,643 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 12 [2025-03-04 14:38:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:15,645 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2025-03-04 14:38:15,646 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-04 14:38:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2025-03-04 14:38:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:38:15,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:15,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:15,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 14:38:15,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:15,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash -150067956, now seen corresponding path program 1 times [2025-03-04 14:38:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840121896] [2025-03-04 14:38:15,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:15,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:38:15,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:38:15,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:15,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840121896] [2025-03-04 14:38:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840121896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817343353] [2025-03-04 14:38:16,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:16,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:16,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:16,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:16,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:38:16,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:38:16,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:38:16,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:16,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:16,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:16,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817343353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:16,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:16,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:38:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733923073] [2025-03-04 14:38:16,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:16,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:16,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:16,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:16,471 INFO L87 Difference]: Start difference. First operand 97 states and 121 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-04 14:38:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:16,503 INFO L93 Difference]: Finished difference Result 197 states and 247 transitions. [2025-03-04 14:38:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:16,505 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-04 14:38:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:16,506 INFO L225 Difference]: With dead ends: 197 [2025-03-04 14:38:16,506 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 14:38:16,506 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-04 14:38:16,508 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:16,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 577 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 14:38:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 14:38:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.369047619047619) internal successors, (115), 96 states have internal predecessors, (115), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2025-03-04 14:38:16,516 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 13 [2025-03-04 14:38:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:16,516 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2025-03-04 14:38:16,516 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-04 14:38:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2025-03-04 14:38:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:38:16,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:16,519 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:16,528 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-04 14:38:16,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:16,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:16,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -771798757, now seen corresponding path program 2 times [2025-03-04 14:38:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485215307] [2025-03-04 14:38:16,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:16,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:38:16,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:38:16,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:16,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,041 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-04 14:38:17,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485215307] [2025-03-04 14:38:17,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485215307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:17,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:17,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:38:17,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425376641] [2025-03-04 14:38:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:17,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:17,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:17,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:17,042 INFO L87 Difference]: Start difference. First operand 106 states and 130 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-04 14:38:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:17,089 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2025-03-04 14:38:17,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:17,090 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-04 14:38:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:17,090 INFO L225 Difference]: With dead ends: 106 [2025-03-04 14:38:17,090 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 14:38:17,090 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-04 14:38:17,091 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 69 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 346 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-04 14:38:17,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 346 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 14:38:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 14:38:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 94 states have internal predecessors, (113), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2025-03-04 14:38:17,096 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 22 [2025-03-04 14:38:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:17,096 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2025-03-04 14:38:17,096 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-04 14:38:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2025-03-04 14:38:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:38:17,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:17,097 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-04 14:38:17,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:38:17,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1652101611, now seen corresponding path program 1 times [2025-03-04 14:38:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417394919] [2025-03-04 14:38:17,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:17,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:38:17,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:38:17,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,356 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-04 14:38:17,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417394919] [2025-03-04 14:38:17,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417394919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:17,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:17,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528316891] [2025-03-04 14:38:17,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:17,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:17,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:17,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,358 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:17,377 INFO L93 Difference]: Finished difference Result 191 states and 240 transitions. [2025-03-04 14:38:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:17,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 14:38:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:17,378 INFO L225 Difference]: With dead ends: 191 [2025-03-04 14:38:17,378 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 14:38:17,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,379 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:17,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 14:38:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 14:38:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 97 states have internal predecessors, (116), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2025-03-04 14:38:17,384 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 27 [2025-03-04 14:38:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:17,384 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2025-03-04 14:38:17,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2025-03-04 14:38:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 14:38:17,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:17,387 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:17,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:38:17,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:17,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1478880496, now seen corresponding path program 1 times [2025-03-04 14:38:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:17,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310174347] [2025-03-04 14:38:17,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:17,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 14:38:17,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 14:38:17,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,608 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-04 14:38:17,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310174347] [2025-03-04 14:38:17,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310174347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:17,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:17,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895746554] [2025-03-04 14:38:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:17,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:17,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:17,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:17,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,610 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:17,623 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2025-03-04 14:38:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:17,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 14:38:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:17,625 INFO L225 Difference]: With dead ends: 112 [2025-03-04 14:38:17,625 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 14:38:17,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,625 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:17,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 14:38:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 14:38:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 100 states have internal predecessors, (119), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2025-03-04 14:38:17,630 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 29 [2025-03-04 14:38:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:17,630 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2025-03-04 14:38:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2025-03-04 14:38:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:38:17,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:17,631 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-04 14:38:17,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:38:17,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:17,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1729071988, now seen corresponding path program 1 times [2025-03-04 14:38:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64743727] [2025-03-04 14:38:17,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:17,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:17,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:17,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,866 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-04 14:38:17,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64743727] [2025-03-04 14:38:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64743727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:17,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326690893] [2025-03-04 14:38:17,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:17,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:17,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:17,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:38:18,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:18,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:18,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:18,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:18,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:18,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:18,326 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-04 14:38:18,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:18,394 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-04 14:38:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326690893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:18,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:18,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:38:18,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110720312] [2025-03-04 14:38:18,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:18,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:38:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:18,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:38:18,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:38:18,396 INFO L87 Difference]: Start difference. First operand 110 states and 134 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-04 14:38:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:18,477 INFO L93 Difference]: Finished difference Result 222 states and 276 transitions. [2025-03-04 14:38:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:38:18,478 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-04 14:38:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:18,478 INFO L225 Difference]: With dead ends: 222 [2025-03-04 14:38:18,478 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 14:38:18,479 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-04 14:38:18,479 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 5 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:18,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 537 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 14:38:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-04 14:38:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 117 states have internal predecessors, (136), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2025-03-04 14:38:18,485 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 30 [2025-03-04 14:38:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:18,485 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2025-03-04 14:38:18,485 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-04 14:38:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2025-03-04 14:38:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 14:38:18,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:18,486 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:18,495 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-04 14:38:18,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:18,690 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1771878924, now seen corresponding path program 1 times [2025-03-04 14:38:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428785500] [2025-03-04 14:38:18,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:18,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 14:38:18,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 14:38:18,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:18,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:38:18,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:18,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428785500] [2025-03-04 14:38:18,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428785500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:18,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:18,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:18,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843366104] [2025-03-04 14:38:18,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:18,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:18,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:18,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:18,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:18,911 INFO L87 Difference]: Start difference. First operand 127 states and 151 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-04 14:38:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:18,936 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2025-03-04 14:38:18,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 14:38:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:18,937 INFO L225 Difference]: With dead ends: 139 [2025-03-04 14:38:18,937 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 14:38:18,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:18,938 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:18,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 220 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 14:38:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-03-04 14:38:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.264957264957265) internal successors, (148), 126 states have internal predecessors, (148), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 163 transitions. [2025-03-04 14:38:18,943 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 163 transitions. Word has length 48 [2025-03-04 14:38:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:18,943 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 163 transitions. [2025-03-04 14:38:18,944 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-04 14:38:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 163 transitions. [2025-03-04 14:38:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:38:18,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:18,944 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-04 14:38:18,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:38:18,945 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 906333389, now seen corresponding path program 1 times [2025-03-04 14:38:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207987787] [2025-03-04 14:38:18,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:19,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:38:19,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:38:19,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:19,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,162 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-04 14:38:19,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:19,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207987787] [2025-03-04 14:38:19,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207987787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:19,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:19,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912712372] [2025-03-04 14:38:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:19,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:19,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:19,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:19,163 INFO L87 Difference]: Start difference. First operand 136 states and 163 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-04 14:38:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:19,176 INFO L93 Difference]: Finished difference Result 136 states and 163 transitions. [2025-03-04 14:38:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:19,177 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-04 14:38:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:19,177 INFO L225 Difference]: With dead ends: 136 [2025-03-04 14:38:19,177 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 14:38:19,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:19,178 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:19,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 14:38:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-03-04 14:38:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 121 states have internal predecessors, (142), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2025-03-04 14:38:19,184 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 49 [2025-03-04 14:38:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:19,184 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2025-03-04 14:38:19,184 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-04 14:38:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2025-03-04 14:38:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:38:19,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:19,188 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:19,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:38:19,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:19,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1008483663, now seen corresponding path program 1 times [2025-03-04 14:38:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:19,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91459725] [2025-03-04 14:38:19,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:19,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:38:19,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:38:19,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:19,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:19,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:19,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91459725] [2025-03-04 14:38:19,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91459725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:19,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662580336] [2025-03-04 14:38:19,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:19,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:19,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:19,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:38:19,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:38:19,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:38:19,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:19,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:38:19,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:38:19,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:19,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662580336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:19,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-04 14:38:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400788155] [2025-03-04 14:38:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:19,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:19,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:19,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:19,856 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-04 14:38:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:19,923 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2025-03-04 14:38:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-04 14:38:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:19,925 INFO L225 Difference]: With dead ends: 181 [2025-03-04 14:38:19,925 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 14:38:19,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:19,926 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 53 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:19,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 430 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 14:38:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2025-03-04 14:38:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 122 states have internal predecessors, (143), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2025-03-04 14:38:19,934 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 50 [2025-03-04 14:38:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:19,934 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2025-03-04 14:38:19,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-04 14:38:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2025-03-04 14:38:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:38:19,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:19,937 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] [2025-03-04 14:38:19,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:38:20,137 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-04 14:38:20,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:20,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:20,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1214395392, now seen corresponding path program 1 times [2025-03-04 14:38:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:20,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651242977] [2025-03-04 14:38:20,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:20,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:20,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:20,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:20,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:20,393 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-04 14:38:20,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:20,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651242977] [2025-03-04 14:38:20,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651242977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:20,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:20,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:38:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221070398] [2025-03-04 14:38:20,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:20,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:20,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:20,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:38:20,395 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:20,412 INFO L93 Difference]: Finished difference Result 145 states and 174 transitions. [2025-03-04 14:38:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:20,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:38:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:20,414 INFO L225 Difference]: With dead ends: 145 [2025-03-04 14:38:20,414 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 14:38:20,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:38:20,415 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:20,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 14:38:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-04 14:38:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.25) internal successors, (145), 124 states have internal predecessors, (145), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2025-03-04 14:38:20,422 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 55 [2025-03-04 14:38:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:20,422 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2025-03-04 14:38:20,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2025-03-04 14:38:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:38:20,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:20,424 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-04 14:38:20,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 14:38:20,425 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:20,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:20,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1018230397, now seen corresponding path program 1 times [2025-03-04 14:38:20,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:20,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361004938] [2025-03-04 14:38:20,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:20,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:20,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:20,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:20,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:20,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:20,672 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-04 14:38:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361004938] [2025-03-04 14:38:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361004938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182966908] [2025-03-04 14:38:20,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:20,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:20,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:20,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:38:20,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:21,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:21,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:21,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:21,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:21,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:21,145 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-04 14:38:21,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:21,165 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-04 14:38:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182966908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:21,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:38:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161155173] [2025-03-04 14:38:21,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:21,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:21,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:21,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:21,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:21,168 INFO L87 Difference]: Start difference. First operand 134 states and 160 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-04 14:38:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:21,194 INFO L93 Difference]: Finished difference Result 242 states and 296 transitions. [2025-03-04 14:38:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:21,194 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-04 14:38:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:21,195 INFO L225 Difference]: With dead ends: 242 [2025-03-04 14:38:21,195 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 14:38:21,195 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-04 14:38:21,196 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:21,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 333 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 14:38:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-04 14:38:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 142 states have internal predecessors, (163), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 178 transitions. [2025-03-04 14:38:21,200 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 178 transitions. Word has length 55 [2025-03-04 14:38:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:21,200 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 178 transitions. [2025-03-04 14:38:21,201 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-04 14:38:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2025-03-04 14:38:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:38:21,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:21,201 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:21,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:21,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:21,402 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:21,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash -620650014, now seen corresponding path program 1 times [2025-03-04 14:38:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:21,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605164379] [2025-03-04 14:38:21,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:21,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:21,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:38:21,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:38:21,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:21,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:21,589 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-04 14:38:21,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:21,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605164379] [2025-03-04 14:38:21,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605164379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:21,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:21,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:38:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527652360] [2025-03-04 14:38:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:21,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:21,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:21,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:21,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:38:21,591 INFO L87 Difference]: Start difference. First operand 152 states and 178 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:21,604 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2025-03-04 14:38:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-03-04 14:38:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:21,606 INFO L225 Difference]: With dead ends: 165 [2025-03-04 14:38:21,606 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 14:38:21,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:38:21,606 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:21,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 14:38:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 14:38:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.213235294117647) internal successors, (165), 144 states have internal predecessors, (165), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2025-03-04 14:38:21,611 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 59 [2025-03-04 14:38:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:21,611 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2025-03-04 14:38:21,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2025-03-04 14:38:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 14:38:21,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:21,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:21,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 14:38:21,613 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash 495858823, now seen corresponding path program 1 times [2025-03-04 14:38:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451056655] [2025-03-04 14:38:21,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:21,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 14:38:21,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 14:38:21,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:21,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:38:21,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451056655] [2025-03-04 14:38:21,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451056655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:21,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:21,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:38:21,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75833450] [2025-03-04 14:38:21,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:21,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:21,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:21,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:21,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:21,878 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-04 14:38:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:21,909 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2025-03-04 14:38:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 61 [2025-03-04 14:38:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:21,910 INFO L225 Difference]: With dead ends: 167 [2025-03-04 14:38:21,910 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 14:38:21,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:21,910 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 18 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:21,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 447 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 14:38:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-04 14:38:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 150 states have internal predecessors, (174), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2025-03-04 14:38:21,919 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 61 [2025-03-04 14:38:21,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:21,920 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2025-03-04 14:38:21,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-04 14:38:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2025-03-04 14:38:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 14:38:21,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:21,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:21,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:38:21,921 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:21,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash 495859784, now seen corresponding path program 1 times [2025-03-04 14:38:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:21,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143517811] [2025-03-04 14:38:21,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:21,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:22,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 14:38:22,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 14:38:22,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:38:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143517811] [2025-03-04 14:38:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143517811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363066474] [2025-03-04 14:38:22,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:22,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:22,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:22,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:38:22,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 14:38:22,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 14:38:22,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:22,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:22,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1592 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:38:22,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:22,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363066474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:22,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 14:38:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132887900] [2025-03-04 14:38:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:22,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:22,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:22,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:38:22,855 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:38:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:22,918 INFO L93 Difference]: Finished difference Result 239 states and 288 transitions. [2025-03-04 14:38:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:22,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2025-03-04 14:38:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:22,919 INFO L225 Difference]: With dead ends: 239 [2025-03-04 14:38:22,919 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 14:38:22,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:38:22,920 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 77 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:22,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 387 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 14:38:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-04 14:38:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 149 states have internal predecessors, (172), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2025-03-04 14:38:22,931 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 61 [2025-03-04 14:38:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:22,931 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2025-03-04 14:38:22,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:38:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2025-03-04 14:38:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 14:38:22,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:22,932 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:22,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:23,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:23,133 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:23,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1842386583, now seen corresponding path program 1 times [2025-03-04 14:38:23,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:23,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363586062] [2025-03-04 14:38:23,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:23,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 14:38:23,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 14:38:23,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:23,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:38:23,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:23,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363586062] [2025-03-04 14:38:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363586062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:23,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376874246] [2025-03-04 14:38:23,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:23,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:23,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:23,378 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:23,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:38:23,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 14:38:23,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 14:38:23,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:23,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:23,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:23,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:38:23,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:38:24,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376874246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:24,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:24,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:38:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184620674] [2025-03-04 14:38:24,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:24,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:38:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:24,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:38:24,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:38:24,012 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:24,099 INFO L93 Difference]: Finished difference Result 303 states and 367 transitions. [2025-03-04 14:38:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:38:24,099 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 66 [2025-03-04 14:38:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:24,100 INFO L225 Difference]: With dead ends: 303 [2025-03-04 14:38:24,100 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 14:38:24,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 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-04 14:38:24,101 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 5 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:24,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 740 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 14:38:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-03-04 14:38:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 184 states have internal predecessors, (207), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2025-03-04 14:38:24,110 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 66 [2025-03-04 14:38:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:24,110 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2025-03-04 14:38:24,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2025-03-04 14:38:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 14:38:24,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:24,113 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:24,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:24,314 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-04 14:38:24,314 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1973693862, now seen corresponding path program 1 times [2025-03-04 14:38:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232086786] [2025-03-04 14:38:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:24,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 14:38:24,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 14:38:24,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:24,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:24,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:24,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232086786] [2025-03-04 14:38:24,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232086786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:24,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783881194] [2025-03-04 14:38:24,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:24,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:24,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:24,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:38:24,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 14:38:25,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 14:38:25,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:25,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:25,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1741 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:25,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:25,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:25,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783881194] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:25,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:25,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:38:25,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616653719] [2025-03-04 14:38:25,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:25,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:25,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:25,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:25,130 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:25,157 INFO L93 Difference]: Finished difference Result 205 states and 234 transitions. [2025-03-04 14:38:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:25,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 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 85 [2025-03-04 14:38:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:25,158 INFO L225 Difference]: With dead ends: 205 [2025-03-04 14:38:25,158 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 14:38:25,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-04 14:38:25,158 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:25,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 548 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 14:38:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 14:38:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 187 states have (on average 1.1550802139037433) internal successors, (216), 193 states have internal predecessors, (216), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 231 transitions. [2025-03-04 14:38:25,164 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 231 transitions. Word has length 85 [2025-03-04 14:38:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:25,165 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 231 transitions. [2025-03-04 14:38:25,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions. [2025-03-04 14:38:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 14:38:25,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:25,165 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] [2025-03-04 14:38:25,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:25,366 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-04 14:38:25,366 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:25,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:25,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2100783952, now seen corresponding path program 1 times [2025-03-04 14:38:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356515155] [2025-03-04 14:38:25,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:25,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 14:38:25,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 14:38:25,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:25,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356515155] [2025-03-04 14:38:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356515155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101832685] [2025-03-04 14:38:27,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:27,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:27,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:27,297 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:27,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:38:27,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 14:38:27,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 14:38:27,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:27,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:27,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 1872 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 14:38:27,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:27,958 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 14:38:27,959 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 19 treesize of output 16 [2025-03-04 14:38:28,122 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 14:38:28,122 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-04 14:38:28,212 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 14:38:28,213 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 24 treesize of output 28 [2025-03-04 14:38:28,258 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 14:38:28,259 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 24 treesize of output 28 [2025-03-04 14:38:28,603 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 14:38:28,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:38:28,844 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 17 treesize of output 12 [2025-03-04 14:38:28,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2025-03-04 14:38:28,892 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-04 14:38:28,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:28,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101832685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:28,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:28,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2025-03-04 14:38:28,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570648367] [2025-03-04 14:38:28,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:28,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:38:28,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:28,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:38:28,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-04 14:38:28,893 INFO L87 Difference]: Start difference. First operand 204 states and 231 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:38:30,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 14:38:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:33,678 INFO L93 Difference]: Finished difference Result 242 states and 276 transitions. [2025-03-04 14:38:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:38:33,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-03-04 14:38:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:33,680 INFO L225 Difference]: With dead ends: 242 [2025-03-04 14:38:33,680 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 14:38:33,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2025-03-04 14:38:33,681 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 234 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:33,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 640 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-04 14:38:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 14:38:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 204. [2025-03-04 14:38:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 187 states have (on average 1.1497326203208555) internal successors, (215), 193 states have internal predecessors, (215), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2025-03-04 14:38:33,690 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 95 [2025-03-04 14:38:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:33,690 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2025-03-04 14:38:33,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:38:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2025-03-04 14:38:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 14:38:33,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:33,691 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:33,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 14:38:33,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:33,892 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:33,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash 879978603, now seen corresponding path program 2 times [2025-03-04 14:38:33,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:33,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595546231] [2025-03-04 14:38:33,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:33,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:33,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-03-04 14:38:33,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 94 statements. [2025-03-04 14:38:33,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:33,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-04 14:38:34,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:34,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595546231] [2025-03-04 14:38:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595546231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:34,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595088346] [2025-03-04 14:38:34,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:34,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:34,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:34,087 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:34,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 14:38:34,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-03-04 14:38:34,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 94 statements. [2025-03-04 14:38:34,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:34,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:34,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:34,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-04 14:38:34,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-04 14:38:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595088346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:34,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:34,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 14:38:34,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699274590] [2025-03-04 14:38:34,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:34,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:34,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:34,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:34,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:34,716 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:34,772 INFO L93 Difference]: Finished difference Result 204 states and 230 transitions. [2025-03-04 14:38:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:34,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 94 [2025-03-04 14:38:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:34,773 INFO L225 Difference]: With dead ends: 204 [2025-03-04 14:38:34,773 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 14:38:34,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:38:34,774 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 99 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:34,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 249 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 14:38:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-04 14:38:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 171 states have (on average 1.152046783625731) internal successors, (197), 176 states have internal predecessors, (197), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:38:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 212 transitions. [2025-03-04 14:38:34,782 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 212 transitions. Word has length 94 [2025-03-04 14:38:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:34,782 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 212 transitions. [2025-03-04 14:38:34,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2025-03-04 14:38:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 14:38:34,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:34,783 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] [2025-03-04 14:38:34,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 14:38:34,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 14:38:34,984 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting bb_perror_msg_and_dieErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:38:34,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash -125441934, now seen corresponding path program 1 times [2025-03-04 14:38:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394445736] [2025-03-04 14:38:34,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:35,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:38:35,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:38:35,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:35,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:38:41,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394445736] [2025-03-04 14:38:41,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394445736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817803217] [2025-03-04 14:38:41,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:41,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:41,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:41,107 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-04 14:38:41,109 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-04 14:38:41,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:38:41,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:38:41,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:41,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:41,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1879 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-04 14:38:41,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:41,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 14:38:41,802 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 14:38:41,802 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-04 14:38:41,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 14:38:41,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 14:38:41,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:38:41,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:38:41,876 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2025-03-04 14:38:41,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:38:41,886 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2025-03-04 14:38:41,908 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:41,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2025-03-04 14:38:41,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:38:41,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:38:41,919 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:41,933 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-04 14:38:41,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2025-03-04 14:38:42,048 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,060 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,142 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,152 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,232 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,241 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,325 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,332 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,416 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,423 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,511 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,519 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,610 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,617 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,690 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,696 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,798 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,804 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:42,873 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 14:38:42,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 14:38:42,881 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-04 14:38:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 14:38:43,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:45,868 INFO L349 Elim1Store]: treesize reduction 88, result has 46.7 percent of original size [2025-03-04 14:38:45,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 5657 treesize of output 1430 [2025-03-04 14:38:45,921 INFO L349 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2025-03-04 14:38:45,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1859 treesize of output 1852 [2025-03-04 14:38:49,058 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-03-04 14:38:49,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34595825967 treesize of output 32743293573 [2025-03-04 14:39:09,434 WARN L286 SmtUtils]: Spent 20.24s on a formula simplification. DAG size of input: 32501 DAG size of output: 214 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:39:09,524 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-04 14:39:09,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1489782 treesize of output 1484128 [2025-03-04 14:39:09,685 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 1501 treesize of output 1467 [2025-03-04 14:39:09,699 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 1467 treesize of output 1455 [2025-03-04 14:39:09,709 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 1455 treesize of output 1403 [2025-03-04 14:39:09,720 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 1403 treesize of output 1367 [2025-03-04 14:39:09,732 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 1367 treesize of output 1343 [2025-03-04 14:39:09,747 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 1343 treesize of output 1339 [2025-03-04 14:39:09,759 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 1339 treesize of output 1325 [2025-03-04 14:39:09,774 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 1325 treesize of output 1321 [2025-03-04 14:39:09,787 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 1321 treesize of output 1307 [2025-03-04 14:39:09,798 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 1307 treesize of output 1303 [2025-03-04 14:39:09,810 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 1303 treesize of output 1295 [2025-03-04 14:39:09,822 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 1295 treesize of output 1287 [2025-03-04 14:39:09,837 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 1287 treesize of output 1283 [2025-03-04 14:39:11,098 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2025-03-04 14:39:11,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1500704492866948245 treesize of output 1233687733818423403