./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/heap-manipulation/merge_sort-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:17:00,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:17:00,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:17:00,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:17:00,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:17:00,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:17:00,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:17:00,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:17:00,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:17:00,772 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:17:00,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:17:00,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:17:00,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:17:00,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:17:00,773 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:17:00,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:17:00,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:17:00,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:17:00,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:17:00,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:17:00,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:17:00,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:17:00,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:17:00,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:17:00,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:17:00,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:17:00,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:17:00,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:17:00,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:17:00,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:17:00,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:17:00,776 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2025-03-03 13:17:01,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:17:01,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:17:01,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:17:01,021 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:17:01,021 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:17:01,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-03-03 13:17:02,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8330782c5/803e91e568954c1788d6e18757f860af/FLAGb708d21d0 [2025-03-03 13:17:02,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:17:02,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-03-03 13:17:02,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8330782c5/803e91e568954c1788d6e18757f860af/FLAGb708d21d0 [2025-03-03 13:17:02,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8330782c5/803e91e568954c1788d6e18757f860af [2025-03-03 13:17:02,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:17:02,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:17:02,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:17:02,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:17:02,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:17:02,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:17:02" (1/1) ... [2025-03-03 13:17:02,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1f1736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:02, skipping insertion in model container [2025-03-03 13:17:02,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:17:02" (1/1) ... [2025-03-03 13:17:02,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:17:02,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2025-03-03 13:17:02,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:17:02,980 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:17:03,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2025-03-03 13:17:03,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:17:03,053 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:17:03,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03 WrapperNode [2025-03-03 13:17:03,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:17:03,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:17:03,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:17:03,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:17:03,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,095 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 264 [2025-03-03 13:17:03,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:17:03,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:17:03,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:17:03,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:17:03,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,131 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 10, 3, 34]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 3, 2, 8]. [2025-03-03 13:17:03,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:17:03,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:17:03,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:17:03,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:17:03,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (1/1) ... [2025-03-03 13:17:03,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:17:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:03,166 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-03 13:17:03,170 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-03 13:17:03,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2025-03-03 13:17:03,184 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-03 13:17:03,184 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:17:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 13:17:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:17:03,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:17:03,285 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:17:03,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:17:03,595 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-03 13:17:03,595 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:17:03,604 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:17:03,606 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:17:03,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:17:03 BoogieIcfgContainer [2025-03-03 13:17:03,606 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:17:03,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:17:03,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:17:03,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:17:03,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:17:02" (1/3) ... [2025-03-03 13:17:03,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142bcb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:17:03, skipping insertion in model container [2025-03-03 13:17:03,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:17:03" (2/3) ... [2025-03-03 13:17:03,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142bcb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:17:03, skipping insertion in model container [2025-03-03 13:17:03,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:17:03" (3/3) ... [2025-03-03 13:17:03,614 INFO L128 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2025-03-03 13:17:03,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:17:03,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG merge_sort-2.i that has 3 procedures, 94 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-03-03 13:17:03,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:17:03,684 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;@349f9b44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:17:03,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:17:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 75 states have (on average 1.8) internal successors, (135), 91 states have internal predecessors, (135), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 13:17:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 13:17:03,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:03,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:03,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:03,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash 873245628, now seen corresponding path program 1 times [2025-03-03 13:17:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001561382] [2025-03-03 13:17:03,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:03,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:17:03,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:17:03,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:03,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:03,787 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-03 13:17:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001561382] [2025-03-03 13:17:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001561382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:17:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404237882] [2025-03-03 13:17:03,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:03,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:17:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:03,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:17:03,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:17:03,805 INFO L87 Difference]: Start difference. First operand has 94 states, 75 states have (on average 1.8) internal successors, (135), 91 states have internal predecessors, (135), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:03,830 INFO L93 Difference]: Finished difference Result 184 states and 327 transitions. [2025-03-03 13:17:03,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:17:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-03 13:17:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:03,839 INFO L225 Difference]: With dead ends: 184 [2025-03-03 13:17:03,839 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 13:17:03,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:17:03,845 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:03,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:17:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 13:17:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-03 13:17:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2025-03-03 13:17:03,877 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 7 [2025-03-03 13:17:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:03,878 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2025-03-03 13:17:03,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2025-03-03 13:17:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:17:03,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:03,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:03,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:17:03,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:03,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1280658649, now seen corresponding path program 1 times [2025-03-03 13:17:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689211214] [2025-03-03 13:17:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:03,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:17:03,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:17:03,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:03,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:03,937 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-03 13:17:03,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:03,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689211214] [2025-03-03 13:17:03,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689211214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:03,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:17:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192469161] [2025-03-03 13:17:03,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:03,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:17:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:03,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:17:03,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:17:03,939 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:03,958 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2025-03-03 13:17:03,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:17:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:17:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:03,959 INFO L225 Difference]: With dead ends: 170 [2025-03-03 13:17:03,959 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 13:17:03,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:17:03,960 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:03,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:17:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 13:17:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2025-03-03 13:17:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.323943661971831) internal successors, (94), 85 states have internal predecessors, (94), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2025-03-03 13:17:03,970 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 8 [2025-03-03 13:17:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:03,970 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2025-03-03 13:17:03,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2025-03-03 13:17:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:17:03,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:03,970 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:03,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:17:03,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:03,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1375320076, now seen corresponding path program 1 times [2025-03-03 13:17:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:03,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105851264] [2025-03-03 13:17:03,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:03,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:17:04,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:17:04,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:04,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:04,133 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-03 13:17:04,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:04,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105851264] [2025-03-03 13:17:04,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105851264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:04,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:04,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:17:04,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913115120] [2025-03-03 13:17:04,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:04,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:17:04,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:04,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:17:04,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:17:04,135 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:04,228 INFO L93 Difference]: Finished difference Result 144 states and 180 transitions. [2025-03-03 13:17:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:17:04,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 13:17:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:04,232 INFO L225 Difference]: With dead ends: 144 [2025-03-03 13:17:04,232 INFO L226 Difference]: Without dead ends: 139 [2025-03-03 13:17:04,232 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-03 13:17:04,233 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 128 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:04,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 321 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-03 13:17:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2025-03-03 13:17:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 88 states have internal predecessors, (98), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2025-03-03 13:17:04,249 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 14 [2025-03-03 13:17:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:04,250 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2025-03-03 13:17:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2025-03-03 13:17:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:17:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:04,251 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:17:04,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2029522728, now seen corresponding path program 1 times [2025-03-03 13:17:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635319761] [2025-03-03 13:17:04,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:04,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 13:17:04,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:17:04,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:04,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:17:04,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635319761] [2025-03-03 13:17:04,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635319761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:04,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:04,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:17:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64996493] [2025-03-03 13:17:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:04,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:17:04,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:04,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:17:04,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:17:04,419 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:04,547 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2025-03-03 13:17:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:17:04,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 13:17:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:04,549 INFO L225 Difference]: With dead ends: 93 [2025-03-03 13:17:04,549 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 13:17:04,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:17:04,550 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 12 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:04,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 322 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 13:17:04,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-03 13:17:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 87 states have internal predecessors, (97), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2025-03-03 13:17:04,562 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 21 [2025-03-03 13:17:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:04,562 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2025-03-03 13:17:04,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2025-03-03 13:17:04,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:17:04,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:04,564 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:04,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:17:04,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:04,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1970355167, now seen corresponding path program 1 times [2025-03-03 13:17:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152242695] [2025-03-03 13:17:04,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:04,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 13:17:04,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:17:04,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:04,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:17:04,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:04,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152242695] [2025-03-03 13:17:04,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152242695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:04,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:04,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:17:04,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133981265] [2025-03-03 13:17:04,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:04,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:17:04,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:04,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:17:04,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:17:04,663 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:04,775 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2025-03-03 13:17:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:17:04,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 13:17:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:04,777 INFO L225 Difference]: With dead ends: 92 [2025-03-03 13:17:04,777 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 13:17:04,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:17:04,777 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 12 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:04,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 316 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 13:17:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 13:17:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.28) internal successors, (96), 86 states have internal predecessors, (96), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2025-03-03 13:17:04,789 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 21 [2025-03-03 13:17:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:04,790 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2025-03-03 13:17:04,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2025-03-03 13:17:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:17:04,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:04,791 INFO L218 NwaCegarLoop]: trace histogram [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-03 13:17:04,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:17:04,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:04,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1285682546, now seen corresponding path program 1 times [2025-03-03 13:17:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:04,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387544946] [2025-03-03 13:17:04,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:04,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:17:04,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:17:04,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:04,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:04,919 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-03 13:17:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387544946] [2025-03-03 13:17:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387544946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:17:04,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742121677] [2025-03-03 13:17:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:04,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:17:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:04,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:17:04,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:17:04,922 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:05,109 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2025-03-03 13:17:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:17:05,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 13:17:05,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:05,110 INFO L225 Difference]: With dead ends: 139 [2025-03-03 13:17:05,110 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 13:17:05,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:17:05,111 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 109 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:05,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 333 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:17:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 13:17:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 95. [2025-03-03 13:17:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 92 states have internal predecessors, (102), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2025-03-03 13:17:05,124 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 24 [2025-03-03 13:17:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:05,124 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2025-03-03 13:17:05,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2025-03-03 13:17:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:17:05,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:05,125 INFO L218 NwaCegarLoop]: trace histogram [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-03 13:17:05,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:17:05,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:05,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash 419204121, now seen corresponding path program 1 times [2025-03-03 13:17:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:05,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102882304] [2025-03-03 13:17:05,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:05,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:05,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:17:05,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:17:05,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:05,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:05,229 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-03 13:17:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:05,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102882304] [2025-03-03 13:17:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102882304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:05,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:05,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:17:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427890524] [2025-03-03 13:17:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:05,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:17:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:05,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:17:05,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:17:05,231 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:05,382 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2025-03-03 13:17:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:17:05,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 13:17:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:05,383 INFO L225 Difference]: With dead ends: 138 [2025-03-03 13:17:05,383 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 13:17:05,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:17:05,384 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 107 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:05,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 333 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 13:17:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 101. [2025-03-03 13:17:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 98 states have internal predecessors, (108), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2025-03-03 13:17:05,394 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 24 [2025-03-03 13:17:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:05,394 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2025-03-03 13:17:05,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2025-03-03 13:17:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:17:05,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:05,394 INFO L218 NwaCegarLoop]: trace histogram [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-03 13:17:05,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:17:05,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:05,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash 716066421, now seen corresponding path program 1 times [2025-03-03 13:17:05,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164854250] [2025-03-03 13:17:05,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:05,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:17:05,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:17:05,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:05,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:05,702 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-03 13:17:05,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164854250] [2025-03-03 13:17:05,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164854250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:05,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:17:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838472913] [2025-03-03 13:17:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:05,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:17:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:05,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:17:05,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:17:05,704 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:05,940 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2025-03-03 13:17:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:17:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:17:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:05,942 INFO L225 Difference]: With dead ends: 137 [2025-03-03 13:17:05,942 INFO L226 Difference]: Without dead ends: 134 [2025-03-03 13:17:05,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:17:05,942 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 103 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:05,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 386 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:17:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-03 13:17:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2025-03-03 13:17:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 101 states have internal predecessors, (111), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-03-03 13:17:05,957 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 27 [2025-03-03 13:17:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:05,957 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-03-03 13:17:05,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-03-03 13:17:05,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:17:05,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:05,957 INFO L218 NwaCegarLoop]: trace histogram [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-03 13:17:05,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:17:05,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:05,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:05,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1307811202, now seen corresponding path program 1 times [2025-03-03 13:17:05,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:05,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513621955] [2025-03-03 13:17:05,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:05,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:05,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:17:05,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:17:05,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:05,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:06,166 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-03 13:17:06,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:06,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513621955] [2025-03-03 13:17:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513621955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:06,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:06,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:17:06,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629731153] [2025-03-03 13:17:06,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:06,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:17:06,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:06,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:17:06,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:17:06,168 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:06,396 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2025-03-03 13:17:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:17:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:17:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:06,397 INFO L225 Difference]: With dead ends: 136 [2025-03-03 13:17:06,397 INFO L226 Difference]: Without dead ends: 133 [2025-03-03 13:17:06,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:17:06,398 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 101 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:06,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 386 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:17:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-03 13:17:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 107. [2025-03-03 13:17:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 104 states have internal predecessors, (114), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2025-03-03 13:17:06,409 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 27 [2025-03-03 13:17:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:06,410 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2025-03-03 13:17:06,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2025-03-03 13:17:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:17:06,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:06,412 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 13:17:06,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 13:17:06,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:06,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:06,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1602027104, now seen corresponding path program 1 times [2025-03-03 13:17:06,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:06,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126774522] [2025-03-03 13:17:06,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:06,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 13:17:06,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:17:06,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:06,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:17:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:06,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126774522] [2025-03-03 13:17:06,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126774522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:06,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521912857] [2025-03-03 13:17:06,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:06,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:06,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:06,522 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-03 13:17:06,524 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-03 13:17:06,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 13:17:06,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:17:06,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:06,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:06,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:17:06,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:06,690 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 31 treesize of output 19 [2025-03-03 13:17:06,694 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 25 treesize of output 13 [2025-03-03 13:17:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:17:06,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:17:06,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521912857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:06,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:17:06,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-03 13:17:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72854885] [2025-03-03 13:17:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:06,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:17:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:06,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:17:06,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:17:06,709 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:06,815 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2025-03-03 13:17:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:17:06,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 13:17:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:06,816 INFO L225 Difference]: With dead ends: 109 [2025-03-03 13:17:06,816 INFO L226 Difference]: Without dead ends: 105 [2025-03-03 13:17:06,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:17:06,816 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 31 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:06,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 283 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-03 13:17:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-03 13:17:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 102 states have internal predecessors, (112), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2025-03-03 13:17:06,829 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 32 [2025-03-03 13:17:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:06,829 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2025-03-03 13:17:06,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2025-03-03 13:17:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:17:06,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:06,830 INFO L218 NwaCegarLoop]: trace histogram [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-03 13:17:06,836 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-03 13:17:07,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 13:17:07,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:07,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 13891646, now seen corresponding path program 1 times [2025-03-03 13:17:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:07,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264486642] [2025-03-03 13:17:07,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:07,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:07,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:17:07,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:17:07,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:07,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:07,095 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-03 13:17:07,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264486642] [2025-03-03 13:17:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264486642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:07,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:07,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:17:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771896018] [2025-03-03 13:17:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:07,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:17:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:07,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:17:07,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:17:07,096 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:07,152 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2025-03-03 13:17:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:17:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 13:17:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:07,154 INFO L225 Difference]: With dead ends: 127 [2025-03-03 13:17:07,154 INFO L226 Difference]: Without dead ends: 124 [2025-03-03 13:17:07,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:17:07,155 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 101 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:07,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 375 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:17:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-03 13:17:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2025-03-03 13:17:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 106 states have internal predecessors, (117), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2025-03-03 13:17:07,164 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 33 [2025-03-03 13:17:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:07,164 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2025-03-03 13:17:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2025-03-03 13:17:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:17:07,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:07,167 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:07,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 13:17:07,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:07,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1436910968, now seen corresponding path program 1 times [2025-03-03 13:17:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613758912] [2025-03-03 13:17:07,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:07,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:17:07,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:17:07,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:07,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:07,501 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-03 13:17:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:07,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613758912] [2025-03-03 13:17:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613758912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:07,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511027659] [2025-03-03 13:17:07,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:07,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:07,504 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-03 13:17:07,505 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-03 13:17:07,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:17:07,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:17:07,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:07,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:07,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 13:17:07,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:07,643 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 18 treesize of output 7 [2025-03-03 13:17:07,649 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 18 treesize of output 7 [2025-03-03 13:17:07,795 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-03 13:17:07,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:07,942 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-03 13:17:07,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511027659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:07,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:07,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2025-03-03 13:17:07,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897802332] [2025-03-03 13:17:07,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:07,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:17:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:07,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:17:07,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:17:07,944 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:08,130 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2025-03-03 13:17:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:17:08,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 13:17:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:08,132 INFO L225 Difference]: With dead ends: 193 [2025-03-03 13:17:08,132 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 13:17:08,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:17:08,132 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:08,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 438 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 13:17:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2025-03-03 13:17:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.173913043478261) internal successors, (189), 170 states have internal predecessors, (189), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 201 transitions. [2025-03-03 13:17:08,146 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 201 transitions. Word has length 36 [2025-03-03 13:17:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:08,146 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 201 transitions. [2025-03-03 13:17:08,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2025-03-03 13:17:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:17:08,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:08,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:08,153 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-03 13:17:08,347 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,SelfDestructingSolverStorable11 [2025-03-03 13:17:08,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:08,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash 965018205, now seen corresponding path program 1 times [2025-03-03 13:17:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5505025] [2025-03-03 13:17:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:08,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:17:08,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:17:08,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:08,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:17:08,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:08,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5505025] [2025-03-03 13:17:08,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5505025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:08,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130362803] [2025-03-03 13:17:08,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:08,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:08,559 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-03 13:17:08,562 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-03 13:17:08,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:17:08,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:17:08,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:08,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:08,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 13:17:08,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:08,686 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 18 treesize of output 7 [2025-03-03 13:17:08,690 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 18 treesize of output 7 [2025-03-03 13:17:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:17:08,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:17:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130362803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:08,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2025-03-03 13:17:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237146936] [2025-03-03 13:17:08,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:08,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:17:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:08,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:17:08,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:17:08,837 INFO L87 Difference]: Start difference. First operand 173 states and 201 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:09,056 INFO L93 Difference]: Finished difference Result 239 states and 282 transitions. [2025-03-03 13:17:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:17:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 13:17:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:09,057 INFO L225 Difference]: With dead ends: 239 [2025-03-03 13:17:09,058 INFO L226 Difference]: Without dead ends: 152 [2025-03-03 13:17:09,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:17:09,059 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 49 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:09,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 731 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:17:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-03 13:17:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2025-03-03 13:17:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.1732283464566928) internal successors, (149), 136 states have internal predecessors, (149), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2025-03-03 13:17:09,067 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 38 [2025-03-03 13:17:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:09,068 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2025-03-03 13:17:09,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2025-03-03 13:17:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:17:09,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:09,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:09,075 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-03 13:17:09,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:09,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:09,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:09,273 INFO L85 PathProgramCache]: Analyzing trace with hash 988489391, now seen corresponding path program 1 times [2025-03-03 13:17:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:09,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323286552] [2025-03-03 13:17:09,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:09,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:17:09,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:17:09,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:09,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:09,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:09,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323286552] [2025-03-03 13:17:09,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323286552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:09,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:09,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:17:09,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801648743] [2025-03-03 13:17:09,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:09,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:17:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:09,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:17:09,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:17:09,323 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:09,373 INFO L93 Difference]: Finished difference Result 207 states and 253 transitions. [2025-03-03 13:17:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:17:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 13:17:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:09,375 INFO L225 Difference]: With dead ends: 207 [2025-03-03 13:17:09,375 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 13:17:09,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:17:09,375 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 107 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:09,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 374 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:17:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 13:17:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 140. [2025-03-03 13:17:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 128 states have (on average 1.171875) internal successors, (150), 137 states have internal predecessors, (150), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2025-03-03 13:17:09,399 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 38 [2025-03-03 13:17:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:09,399 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2025-03-03 13:17:09,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2025-03-03 13:17:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:17:09,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:09,400 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:09,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 13:17:09,400 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:09,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1021479077, now seen corresponding path program 1 times [2025-03-03 13:17:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:09,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126830358] [2025-03-03 13:17:09,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:09,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:09,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:17:09,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:17:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:09,506 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-03 13:17:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126830358] [2025-03-03 13:17:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126830358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:17:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533010958] [2025-03-03 13:17:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:09,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:17:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:09,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:17:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:17:09,508 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:09,669 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2025-03-03 13:17:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:17:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 13:17:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:09,670 INFO L225 Difference]: With dead ends: 161 [2025-03-03 13:17:09,670 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 13:17:09,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:17:09,672 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:09,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 362 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 13:17:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2025-03-03 13:17:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 134 states have (on average 1.171641791044776) internal successors, (157), 143 states have internal predecessors, (157), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:17:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2025-03-03 13:17:09,684 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 39 [2025-03-03 13:17:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:09,684 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2025-03-03 13:17:09,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2025-03-03 13:17:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:17:09,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:09,684 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:09,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 13:17:09,685 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1880728040, now seen corresponding path program 1 times [2025-03-03 13:17:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230045519] [2025-03-03 13:17:09,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:09,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:17:09,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:17:09,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:09,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:17:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230045519] [2025-03-03 13:17:09,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230045519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:09,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:09,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 13:17:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539270322] [2025-03-03 13:17:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:09,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:17:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:09,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:17:09,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:17:09,771 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:09,899 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2025-03-03 13:17:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:17:09,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 13:17:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:09,901 INFO L225 Difference]: With dead ends: 241 [2025-03-03 13:17:09,901 INFO L226 Difference]: Without dead ends: 201 [2025-03-03 13:17:09,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:17:09,901 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 153 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:09,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 723 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-03 13:17:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 165. [2025-03-03 13:17:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 151 states have (on average 1.205298013245033) internal successors, (182), 162 states have internal predecessors, (182), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:17:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2025-03-03 13:17:09,916 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 39 [2025-03-03 13:17:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:09,916 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2025-03-03 13:17:09,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2025-03-03 13:17:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 13:17:09,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:09,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:09,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 13:17:09,917 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:09,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:09,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1012917922, now seen corresponding path program 1 times [2025-03-03 13:17:09,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:09,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605368577] [2025-03-03 13:17:09,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:09,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:09,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 13:17:09,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 13:17:09,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:09,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605368577] [2025-03-03 13:17:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605368577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473380970] [2025-03-03 13:17:10,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:10,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:10,100 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-03 13:17:10,102 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-03 13:17:10,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 13:17:10,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 13:17:10,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:10,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:10,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 13:17:10,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:10,229 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 18 treesize of output 7 [2025-03-03 13:17:10,233 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 18 treesize of output 7 [2025-03-03 13:17:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:10,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473380970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:10,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:10,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 10 [2025-03-03 13:17:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091702826] [2025-03-03 13:17:10,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:10,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:17:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:17:10,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:17:10,422 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:10,525 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2025-03-03 13:17:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:17:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 13:17:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:10,526 INFO L225 Difference]: With dead ends: 237 [2025-03-03 13:17:10,526 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 13:17:10,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:17:10,527 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 38 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:10,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 399 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 13:17:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 165. [2025-03-03 13:17:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 162 states have internal predecessors, (181), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:17:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2025-03-03 13:17:10,538 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 42 [2025-03-03 13:17:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:10,538 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2025-03-03 13:17:10,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2025-03-03 13:17:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 13:17:10,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:10,539 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:10,546 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-03 13:17:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 13:17:10,743 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -3335661, now seen corresponding path program 2 times [2025-03-03 13:17:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209128589] [2025-03-03 13:17:10,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:17:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:10,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-03 13:17:10,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 42 statements. [2025-03-03 13:17:10,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 13:17:10,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:17:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209128589] [2025-03-03 13:17:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209128589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:10,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:10,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 13:17:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191274840] [2025-03-03 13:17:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:10,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:17:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:10,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:17:10,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:17:10,861 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:11,017 INFO L93 Difference]: Finished difference Result 189 states and 223 transitions. [2025-03-03 13:17:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:17:11,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 13:17:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:11,019 INFO L225 Difference]: With dead ends: 189 [2025-03-03 13:17:11,019 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 13:17:11,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:17:11,019 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 39 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:11,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 378 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:17:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 13:17:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2025-03-03 13:17:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 155 states have (on average 1.2) internal successors, (186), 166 states have internal predecessors, (186), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:17:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2025-03-03 13:17:11,034 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 42 [2025-03-03 13:17:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:11,034 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2025-03-03 13:17:11,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2025-03-03 13:17:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 13:17:11,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:11,034 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:11,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 13:17:11,035 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:11,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash -132522952, now seen corresponding path program 2 times [2025-03-03 13:17:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:11,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049553814] [2025-03-03 13:17:11,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:17:11,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:11,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-03 13:17:11,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:17:11,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:17:11,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049553814] [2025-03-03 13:17:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049553814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666963824] [2025-03-03 13:17:11,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:17:11,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:11,493 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-03 13:17:11,495 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-03 13:17:11,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-03 13:17:11,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:17:11,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:17:11,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:11,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 13:17:11,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:11,614 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-03 13:17:11,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-03 13:17:11,663 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:17:11,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-03 13:17:11,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-03-03 13:17:11,738 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-03 13:17:11,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 24 [2025-03-03 13:17:11,756 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 18 treesize of output 7 [2025-03-03 13:17:11,934 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 7 treesize of output 3 [2025-03-03 13:17:12,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:12,049 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 27 [2025-03-03 13:17:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:12,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:12,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_630 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_630))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) is different from false [2025-03-03 13:17:12,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:12,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2025-03-03 13:17:12,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:12,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 309 [2025-03-03 13:17:12,248 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 330 treesize of output 318 [2025-03-03 13:17:12,349 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 65 treesize of output 59 [2025-03-03 13:17:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:17:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666963824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:12,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 25 [2025-03-03 13:17:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212009755] [2025-03-03 13:17:12,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:17:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:17:12,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2025-03-03 13:17:12,443 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:13,380 INFO L93 Difference]: Finished difference Result 228 states and 267 transitions. [2025-03-03 13:17:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:17:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 13:17:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:13,381 INFO L225 Difference]: With dead ends: 228 [2025-03-03 13:17:13,381 INFO L226 Difference]: Without dead ends: 225 [2025-03-03 13:17:13,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=937, Unknown=1, NotChecked=64, Total=1190 [2025-03-03 13:17:13,382 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 588 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:13,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1457 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 990 Invalid, 0 Unknown, 183 Unchecked, 0.6s Time] [2025-03-03 13:17:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-03 13:17:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 180. [2025-03-03 13:17:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 166 states have (on average 1.1927710843373494) internal successors, (198), 177 states have internal predecessors, (198), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:17:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2025-03-03 13:17:13,396 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 44 [2025-03-03 13:17:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:13,396 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2025-03-03 13:17:13,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2025-03-03 13:17:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 13:17:13,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:13,397 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:13,403 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-03 13:17:13,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:13,597 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:13,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1572363715, now seen corresponding path program 1 times [2025-03-03 13:17:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:13,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242724875] [2025-03-03 13:17:13,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:13,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 13:17:13,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:17:13,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:13,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242724875] [2025-03-03 13:17:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242724875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211498217] [2025-03-03 13:17:14,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:14,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:14,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:14,010 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-03 13:17:14,011 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-03 13:17:14,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 13:17:14,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:17:14,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:14,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:14,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 13:17:14,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:14,133 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-03 13:17:14,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-03 13:17:14,175 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:17:14,176 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-03 13:17:14,218 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-03 13:17:14,218 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 16 treesize of output 18 [2025-03-03 13:17:14,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-03-03 13:17:14,261 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 18 treesize of output 7 [2025-03-03 13:17:14,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2025-03-03 13:17:14,466 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 7 treesize of output 3 [2025-03-03 13:17:14,576 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:17:14,577 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 23 [2025-03-03 13:17:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:14,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:14,672 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_24| Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_733))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_24| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_24|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_24|) 0)))) is different from false [2025-03-03 13:17:14,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:14,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2025-03-03 13:17:14,739 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:17:14,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:14,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 157 [2025-03-03 13:17:14,751 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 66 treesize of output 64 [2025-03-03 13:17:14,780 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 76 treesize of output 70 [2025-03-03 13:17:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:17:14,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211498217] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:14,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:14,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2025-03-03 13:17:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60485319] [2025-03-03 13:17:14,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 13:17:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:14,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 13:17:14,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=528, Unknown=1, NotChecked=46, Total=650 [2025-03-03 13:17:14,946 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:15,827 INFO L93 Difference]: Finished difference Result 227 states and 265 transitions. [2025-03-03 13:17:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:17:15,827 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 13:17:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:15,828 INFO L225 Difference]: With dead ends: 227 [2025-03-03 13:17:15,828 INFO L226 Difference]: Without dead ends: 224 [2025-03-03 13:17:15,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=1061, Unknown=1, NotChecked=68, Total=1332 [2025-03-03 13:17:15,829 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 297 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:15,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1204 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 826 Invalid, 0 Unknown, 183 Unchecked, 0.6s Time] [2025-03-03 13:17:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-03 13:17:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 187. [2025-03-03 13:17:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 184 states have internal predecessors, (205), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:17:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 221 transitions. [2025-03-03 13:17:15,850 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 221 transitions. Word has length 44 [2025-03-03 13:17:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:15,850 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 221 transitions. [2025-03-03 13:17:15,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 221 transitions. [2025-03-03 13:17:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:17:15,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:15,851 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:15,857 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-03 13:17:16,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:16,051 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:16,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1224871288, now seen corresponding path program 1 times [2025-03-03 13:17:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:16,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524220449] [2025-03-03 13:17:16,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:16,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 13:17:16,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:17:16,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:16,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:17:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524220449] [2025-03-03 13:17:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524220449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:16,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:17:16,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:17:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745920112] [2025-03-03 13:17:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:16,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:17:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:16,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:17:16,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:17:16,100 INFO L87 Difference]: Start difference. First operand 187 states and 221 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:16,169 INFO L93 Difference]: Finished difference Result 189 states and 222 transitions. [2025-03-03 13:17:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:17:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 13:17:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:16,171 INFO L225 Difference]: With dead ends: 189 [2025-03-03 13:17:16,171 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 13:17:16,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:17:16,172 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:16,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:17:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 13:17:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-03 13:17:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 150 states have internal predecessors, (167), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:17:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2025-03-03 13:17:16,184 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 45 [2025-03-03 13:17:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:16,184 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2025-03-03 13:17:16,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2025-03-03 13:17:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 13:17:16,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:16,184 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:16,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 13:17:16,185 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:16,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash -949869429, now seen corresponding path program 1 times [2025-03-03 13:17:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:16,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660811978] [2025-03-03 13:17:16,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:16,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 13:17:16,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:17:16,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:16,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:17,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:17,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660811978] [2025-03-03 13:17:17,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660811978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:17,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74801717] [2025-03-03 13:17:17,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:17,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:17,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:17,175 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-03 13:17:17,175 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-03 13:17:17,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 13:17:17,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:17:17,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:17,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:17,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-03 13:17:17,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:17,302 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-03 13:17:17,332 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 18 treesize of output 7 [2025-03-03 13:17:17,339 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 18 treesize of output 7 [2025-03-03 13:17:17,390 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:17:17,390 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-03 13:17:17,439 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-03 13:17:17,439 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 16 treesize of output 18 [2025-03-03 13:17:17,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:17:17,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:17:17,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-03 13:17:17,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-03 13:17:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:17,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:18,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:18,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2025-03-03 13:17:18,295 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:17:18,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:18,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 86 [2025-03-03 13:17:18,308 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 34 treesize of output 30 [2025-03-03 13:17:18,328 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 80 treesize of output 68 [2025-03-03 13:17:18,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:18,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2025-03-03 13:17:18,403 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:17:18,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:18,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 86 [2025-03-03 13:17:18,412 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 34 treesize of output 30 [2025-03-03 13:17:18,440 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 72 treesize of output 60 [2025-03-03 13:17:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:18,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74801717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:18,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:18,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2025-03-03 13:17:18,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319104508] [2025-03-03 13:17:18,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:18,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 13:17:18,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:18,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 13:17:18,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1036, Unknown=1, NotChecked=0, Total=1122 [2025-03-03 13:17:18,635 INFO L87 Difference]: Start difference. First operand 153 states and 182 transitions. Second operand has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:20,771 INFO L93 Difference]: Finished difference Result 324 states and 386 transitions. [2025-03-03 13:17:20,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 13:17:20,772 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-03 13:17:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:20,773 INFO L225 Difference]: With dead ends: 324 [2025-03-03 13:17:20,773 INFO L226 Difference]: Without dead ends: 227 [2025-03-03 13:17:20,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=357, Invalid=2834, Unknown=1, NotChecked=0, Total=3192 [2025-03-03 13:17:20,777 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 692 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:20,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1791 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 13:17:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-03 13:17:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 181. [2025-03-03 13:17:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 168 states have (on average 1.1726190476190477) internal successors, (197), 178 states have internal predecessors, (197), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:17:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2025-03-03 13:17:20,802 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 47 [2025-03-03 13:17:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:20,802 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2025-03-03 13:17:20,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:17:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2025-03-03 13:17:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 13:17:20,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:20,803 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:20,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 13:17:21,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:21,004 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1321220244, now seen corresponding path program 1 times [2025-03-03 13:17:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74846146] [2025-03-03 13:17:21,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:21,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 13:17:21,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:17:21,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:21,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:21,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:21,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74846146] [2025-03-03 13:17:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74846146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:21,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264006893] [2025-03-03 13:17:21,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:21,834 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-03 13:17:21,834 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-03 13:17:21,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 13:17:21,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:17:21,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:21,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:21,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-03 13:17:21,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:21,943 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-03 13:17:21,955 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 18 treesize of output 7 [2025-03-03 13:17:21,961 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 18 treesize of output 7 [2025-03-03 13:17:21,971 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:17:21,971 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-03 13:17:21,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-03 13:17:22,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-03 13:17:22,061 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-03-03 13:17:22,061 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 26 treesize of output 41 [2025-03-03 13:17:22,117 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 27 treesize of output 25 [2025-03-03 13:17:22,128 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-03 13:17:22,129 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 56 treesize of output 49 [2025-03-03 13:17:22,146 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2025-03-03 13:17:22,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2025-03-03 13:17:22,227 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-03 13:17:22,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 52 [2025-03-03 13:17:22,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2025-03-03 13:17:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:17:23,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:28,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:28,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 18290570 treesize of output 17795597 [2025-03-03 13:17:29,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:29,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84854401 treesize of output 83616471 [2025-03-03 13:17:40,643 WARN L286 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 4516 DAG size of output: 744 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:17:40,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:40,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 10051 treesize of output 9224 [2025-03-03 13:17:41,181 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 8799 treesize of output 8271 [2025-03-03 13:17:41,695 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 7799 treesize of output 7543 [2025-03-03 13:17:41,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:41,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 11892 treesize of output 11148