./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib-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/seq-pthread/cs_fib-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 2f188ac4b0bdfe335e0fcb7c5645493965a99a7b8a1d7a552e9d512c30775fb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:23:12,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:23:12,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:23:12,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:23:12,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:23:12,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:23:12,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:23:12,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:23:12,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:23:12,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:23:12,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:23:12,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:23:12,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:23:12,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:23:12,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:23:12,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:12,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:23:12,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:23:12,178 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 -> 2f188ac4b0bdfe335e0fcb7c5645493965a99a7b8a1d7a552e9d512c30775fb8 [2025-03-03 15:23:12,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:23:12,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:23:12,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:23:12,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:23:12,450 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:23:12,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-03-03 15:23:13,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3623dfe89/6273daf6e78f4799847356f3413519c5/FLAG17ec9d0f3 [2025-03-03 15:23:13,927 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:23:13,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-03-03 15:23:13,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3623dfe89/6273daf6e78f4799847356f3413519c5/FLAG17ec9d0f3 [2025-03-03 15:23:13,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3623dfe89/6273daf6e78f4799847356f3413519c5 [2025-03-03 15:23:13,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:23:13,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:23:13,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:13,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:23:13,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:23:13,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:13" (1/1) ... [2025-03-03 15:23:13,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf909c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:13, skipping insertion in model container [2025-03-03 15:23:13,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:13" (1/1) ... [2025-03-03 15:23:13,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:23:14,224 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/seq-pthread/cs_fib-2.i[23457,23470] [2025-03-03 15:23:14,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:14,353 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:23:14,380 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/seq-pthread/cs_fib-2.i[23457,23470] [2025-03-03 15:23:14,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:14,477 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:23:14,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14 WrapperNode [2025-03-03 15:23:14,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:14,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:14,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:23:14,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:23:14,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,539 INFO L138 Inliner]: procedures = 145, calls = 401, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 706 [2025-03-03 15:23:14,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:14,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:23:14,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:23:14,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:23:14,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,595 INFO L175 MemorySlicer]: Split 267 memory accesses to 15 slices as follows [2, 8, 8, 8, 53, 48, 22, 22, 31, 10, 11, 2, 31, 0, 11]. 20 percent of accesses are in the largest equivalence class. The 65 initializations are split as follows [2, 3, 3, 3, 18, 18, 6, 6, 0, 6, 0, 0, 0, 0, 0]. The 63 writes are split as follows [0, 2, 2, 2, 20, 15, 7, 7, 1, 2, 1, 2, 1, 0, 1]. [2025-03-03 15:23:14,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:23:14,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:23:14,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:23:14,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:23:14,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (1/1) ... [2025-03-03 15:23:14,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:14,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:14,673 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 15:23:14,676 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 15:23:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:23:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:23:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:23:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 15:23:14,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:23:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:23:14,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:23:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:23:14,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:23:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:23:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:23:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:23:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:23:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:23:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:23:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:23:14,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:23:14,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:23:14,932 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:23:15,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-03 15:23:15,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:23:15,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:15,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-03 15:23:15,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:23:15,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:15,189 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-03 15:23:15,189 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:23:15,189 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:19,578 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-03 15:23:19,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:23:19,590 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:23:19,591 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:23:19,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:19 BoogieIcfgContainer [2025-03-03 15:23:19,591 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:23:19,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:23:19,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:23:19,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:23:19,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:23:13" (1/3) ... [2025-03-03 15:23:19,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1bdb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:19, skipping insertion in model container [2025-03-03 15:23:19,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:14" (2/3) ... [2025-03-03 15:23:19,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1bdb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:19, skipping insertion in model container [2025-03-03 15:23:19,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:19" (3/3) ... [2025-03-03 15:23:19,598 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib-2.i [2025-03-03 15:23:19,608 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:23:19,610 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib-2.i that has 6 procedures, 177 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 15:23:19,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:23:19,659 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;@22e6d89f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:23:19,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:23:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 15:23:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-03 15:23:19,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:19,683 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:19,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:19,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2083784906, now seen corresponding path program 1 times [2025-03-03 15:23:19,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35386417] [2025-03-03 15:23:19,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:20,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-03 15:23:20,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-03 15:23:20,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:20,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 15:23:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35386417] [2025-03-03 15:23:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35386417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:20,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:20,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397986876] [2025-03-03 15:23:20,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:20,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:20,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:20,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:20,667 INFO L87 Difference]: Start difference. First operand has 177 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 15:23:24,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:24,796 INFO L93 Difference]: Finished difference Result 352 states and 600 transitions. [2025-03-03 15:23:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 253 [2025-03-03 15:23:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:24,806 INFO L225 Difference]: With dead ends: 352 [2025-03-03 15:23:24,806 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 15:23:24,812 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 15:23:24,815 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 2 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:24,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 525 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 15:23:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 15:23:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2025-03-03 15:23:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 102 states have (on average 1.303921568627451) internal successors, (133), 103 states have internal predecessors, (133), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 15:23:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 264 transitions. [2025-03-03 15:23:24,856 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 264 transitions. Word has length 253 [2025-03-03 15:23:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:24,857 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 264 transitions. [2025-03-03 15:23:24,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 15:23:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2025-03-03 15:23:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 15:23:24,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:24,866 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:24,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:23:24,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:24,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1242033744, now seen corresponding path program 1 times [2025-03-03 15:23:24,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:24,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784914495] [2025-03-03 15:23:24,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:24,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:25,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 15:23:25,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 15:23:25,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:25,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 15:23:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784914495] [2025-03-03 15:23:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784914495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:25,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:25,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121946305] [2025-03-03 15:23:25,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:25,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:25,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:25,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:25,345 INFO L87 Difference]: Start difference. First operand 174 states and 264 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 15:23:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:25,382 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2025-03-03 15:23:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2025-03-03 15:23:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:25,387 INFO L225 Difference]: With dead ends: 346 [2025-03-03 15:23:25,388 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 15:23:25,389 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 15:23:25,389 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:25,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 15:23:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-03 15:23:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 104 states have internal predecessors, (134), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 15:23:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 265 transitions. [2025-03-03 15:23:25,412 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 265 transitions. Word has length 255 [2025-03-03 15:23:25,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:25,412 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 265 transitions. [2025-03-03 15:23:25,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 15:23:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 265 transitions. [2025-03-03 15:23:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 15:23:25,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:25,415 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:25,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:23:25,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:25,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1395953375, now seen corresponding path program 1 times [2025-03-03 15:23:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:25,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744258431] [2025-03-03 15:23:25,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:25,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 15:23:25,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 15:23:25,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:25,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 15:23:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:25,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744258431] [2025-03-03 15:23:25,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744258431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:25,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87375752] [2025-03-03 15:23:25,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:25,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:25,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:25,852 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 15:23:25,854 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 15:23:26,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 15:23:26,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 15:23:26,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:26,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:26,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:23:26,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 15:23:26,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 15:23:26,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87375752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:26,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:23:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536103447] [2025-03-03 15:23:26,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:26,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:23:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:26,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:23:26,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:23:26,691 INFO L87 Difference]: Start difference. First operand 175 states and 265 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 15:23:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:26,734 INFO L93 Difference]: Finished difference Result 349 states and 531 transitions. [2025-03-03 15:23:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:23:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 256 [2025-03-03 15:23:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:26,737 INFO L225 Difference]: With dead ends: 349 [2025-03-03 15:23:26,737 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 15:23:26,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:23:26,738 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:26,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1039 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 15:23:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-03 15:23:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 106 states have internal predecessors, (136), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 15:23:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2025-03-03 15:23:26,754 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 256 [2025-03-03 15:23:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:26,754 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2025-03-03 15:23:26,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 15:23:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2025-03-03 15:23:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-03 15:23:26,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:26,756 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:26,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:23:26,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:26,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:26,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash -534595329, now seen corresponding path program 2 times [2025-03-03 15:23:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:26,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61750695] [2025-03-03 15:23:26,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:23:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:27,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 258 statements into 2 equivalence classes. [2025-03-03 15:23:27,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 258 statements. [2025-03-03 15:23:27,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:23:27,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2025-03-03 15:23:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:27,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61750695] [2025-03-03 15:23:27,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61750695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:27,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:27,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:23:27,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860023910] [2025-03-03 15:23:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:27,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:23:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:27,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:23:27,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:23:27,445 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 15:23:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:27,601 INFO L93 Difference]: Finished difference Result 350 states and 528 transitions. [2025-03-03 15:23:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:23:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2025-03-03 15:23:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:27,608 INFO L225 Difference]: With dead ends: 350 [2025-03-03 15:23:27,608 INFO L226 Difference]: Without dead ends: 348 [2025-03-03 15:23:27,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:23:27,608 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 175 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:27,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 996 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:23:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-03 15:23:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 345. [2025-03-03 15:23:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 202 states have (on average 1.2920792079207921) internal successors, (261), 203 states have internal predecessors, (261), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-03-03 15:23:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 524 transitions. [2025-03-03 15:23:27,649 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 524 transitions. Word has length 258 [2025-03-03 15:23:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:27,650 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 524 transitions. [2025-03-03 15:23:27,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 15:23:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 524 transitions. [2025-03-03 15:23:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 15:23:27,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:27,656 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:27,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:23:27,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash -535280092, now seen corresponding path program 1 times [2025-03-03 15:23:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360928329] [2025-03-03 15:23:27,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:27,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 15:23:27,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 15:23:27,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:27,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-03-03 15:23:28,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360928329] [2025-03-03 15:23:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360928329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251632108] [2025-03-03 15:23:28,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:28,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:28,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:28,012 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 15:23:28,013 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 15:23:28,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 15:23:28,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 15:23:28,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:28,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:28,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:23:28,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2025-03-03 15:23:28,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-03-03 15:23:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251632108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:28,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 15:23:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846735940] [2025-03-03 15:23:28,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:28,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:23:28,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:28,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:23:28,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:23:28,822 INFO L87 Difference]: Start difference. First operand 345 states and 524 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 15:23:32,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:36,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:40,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:44,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:48,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:49,018 INFO L93 Difference]: Finished difference Result 697 states and 1059 transitions. [2025-03-03 15:23:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:23:49,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 263 [2025-03-03 15:23:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:49,046 INFO L225 Difference]: With dead ends: 697 [2025-03-03 15:23:49,047 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 15:23:49,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:23:49,049 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 4 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:49,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 776 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-03-03 15:23:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 15:23:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 15:23:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 217 states have (on average 1.2857142857142858) internal successors, (279), 218 states have internal predecessors, (279), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-03-03 15:23:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 542 transitions. [2025-03-03 15:23:49,097 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 542 transitions. Word has length 263 [2025-03-03 15:23:49,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:49,097 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 542 transitions. [2025-03-03 15:23:49,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-03 15:23:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 542 transitions. [2025-03-03 15:23:49,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 15:23:49,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:49,103 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 12, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:49,112 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 15:23:49,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:49,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:49,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1305464885, now seen corresponding path program 2 times [2025-03-03 15:23:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689085213] [2025-03-03 15:23:49,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:23:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:49,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-03 15:23:49,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 278 statements. [2025-03-03 15:23:49,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:23:49,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3252 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3250 trivial. 0 not checked. [2025-03-03 15:23:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689085213] [2025-03-03 15:23:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689085213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:49,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:49,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486165473] [2025-03-03 15:23:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:49,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:49,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:49,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:49,738 INFO L87 Difference]: Start difference. First operand 360 states and 542 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-03 15:23:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:49,765 INFO L93 Difference]: Finished difference Result 688 states and 1040 transitions. [2025-03-03 15:23:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:49,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 278 [2025-03-03 15:23:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:49,769 INFO L225 Difference]: With dead ends: 688 [2025-03-03 15:23:49,769 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 15:23:49,771 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 15:23:49,771 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:49,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 15:23:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 15:23:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 217 states have (on average 1.2811059907834101) internal successors, (278), 218 states have internal predecessors, (278), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-03-03 15:23:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 541 transitions. [2025-03-03 15:23:49,804 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 541 transitions. Word has length 278 [2025-03-03 15:23:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:49,804 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 541 transitions. [2025-03-03 15:23:49,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-03 15:23:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 541 transitions. [2025-03-03 15:23:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 15:23:49,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:49,808 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 12, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:49,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:23:49,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:49,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1678068654, now seen corresponding path program 1 times [2025-03-03 15:23:49,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:49,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277922991] [2025-03-03 15:23:49,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:49,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 15:23:50,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 15:23:50,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:50,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 3304 trivial. 0 not checked. [2025-03-03 15:23:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277922991] [2025-03-03 15:23:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277922991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449926233] [2025-03-03 15:23:50,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:50,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:50,391 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 15:23:50,391 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 15:23:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 15:23:51,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 15:23:51,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:51,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:51,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 2032 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:23:51,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2025-03-03 15:23:51,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 3304 trivial. 0 not checked. [2025-03-03 15:23:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449926233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:51,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-03 15:23:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167345874] [2025-03-03 15:23:51,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:51,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:23:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:51,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:23:51,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:23:51,348 INFO L87 Difference]: Start difference. First operand 360 states and 541 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-03-03 15:23:55,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:59,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:03,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:07,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:11,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:15,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:19,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:19,568 INFO L93 Difference]: Finished difference Result 707 states and 1068 transitions. [2025-03-03 15:24:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:24:19,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 298 [2025-03-03 15:24:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:19,585 INFO L225 Difference]: With dead ends: 707 [2025-03-03 15:24:19,586 INFO L226 Difference]: Without dead ends: 370 [2025-03-03 15:24:19,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 590 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:24:19,588 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 2 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:19,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 773 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2025-03-03 15:24:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-03 15:24:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-03 15:24:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 227 states have (on average 1.277533039647577) internal successors, (290), 228 states have internal predecessors, (290), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-03-03 15:24:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 553 transitions. [2025-03-03 15:24:19,621 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 553 transitions. Word has length 298 [2025-03-03 15:24:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:19,621 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 553 transitions. [2025-03-03 15:24:19,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-03-03 15:24:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 553 transitions. [2025-03-03 15:24:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 15:24:19,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:19,626 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:19,636 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 15:24:19,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:19,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:19,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:19,830 INFO L85 PathProgramCache]: Analyzing trace with hash 847220375, now seen corresponding path program 1 times [2025-03-03 15:24:19,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:19,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658829593] [2025-03-03 15:24:19,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:19,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:20,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 15:24:20,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 15:24:20,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:20,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3579 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2025-03-03 15:24:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:21,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658829593] [2025-03-03 15:24:21,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658829593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:21,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:21,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:24:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931310706] [2025-03-03 15:24:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:21,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:21,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:21,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:21,017 INFO L87 Difference]: Start difference. First operand 370 states and 553 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-03 15:24:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:21,573 INFO L93 Difference]: Finished difference Result 383 states and 565 transitions. [2025-03-03 15:24:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:21,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 309 [2025-03-03 15:24:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:21,576 INFO L225 Difference]: With dead ends: 383 [2025-03-03 15:24:21,577 INFO L226 Difference]: Without dead ends: 381 [2025-03-03 15:24:21,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:24:21,577 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 228 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:21,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 969 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:24:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-03 15:24:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 378. [2025-03-03 15:24:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 233 states have (on average 1.2703862660944205) internal successors, (296), 235 states have internal predecessors, (296), 131 states have call successors, (131), 12 states have call predecessors, (131), 13 states have return successors, (134), 130 states have call predecessors, (134), 129 states have call successors, (134) [2025-03-03 15:24:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 561 transitions. [2025-03-03 15:24:21,616 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 561 transitions. Word has length 309 [2025-03-03 15:24:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:21,617 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 561 transitions. [2025-03-03 15:24:21,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-03 15:24:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 561 transitions. [2025-03-03 15:24:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-03 15:24:21,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:21,623 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:21,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:24:21,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:21,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash 462821301, now seen corresponding path program 1 times [2025-03-03 15:24:21,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:21,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748655495] [2025-03-03 15:24:21,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:21,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:21,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-03 15:24:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-03 15:24:21,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3581 trivial. 0 not checked. [2025-03-03 15:24:22,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748655495] [2025-03-03 15:24:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748655495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:22,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:22,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:24:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282156874] [2025-03-03 15:24:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:22,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:24:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:22,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:24:22,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:22,645 INFO L87 Difference]: Start difference. First operand 378 states and 561 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-03-03 15:24:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:23,233 INFO L93 Difference]: Finished difference Result 387 states and 568 transitions. [2025-03-03 15:24:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:23,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) Word has length 313 [2025-03-03 15:24:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:23,237 INFO L225 Difference]: With dead ends: 387 [2025-03-03 15:24:23,237 INFO L226 Difference]: Without dead ends: 385 [2025-03-03 15:24:23,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:24:23,240 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 318 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:23,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1061 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:24:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-03 15:24:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2025-03-03 15:24:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 236 states have (on average 1.2669491525423728) internal successors, (299), 238 states have internal predecessors, (299), 131 states have call successors, (131), 13 states have call predecessors, (131), 14 states have return successors, (134), 130 states have call predecessors, (134), 129 states have call successors, (134) [2025-03-03 15:24:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 564 transitions. [2025-03-03 15:24:23,268 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 564 transitions. Word has length 313 [2025-03-03 15:24:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:23,270 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 564 transitions. [2025-03-03 15:24:23,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-03-03 15:24:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 564 transitions. [2025-03-03 15:24:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-03 15:24:23,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:23,276 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:23,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:24:23,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:23,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:23,278 INFO L85 PathProgramCache]: Analyzing trace with hash -847119342, now seen corresponding path program 1 times [2025-03-03 15:24:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:23,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81327661] [2025-03-03 15:24:23,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:23,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:23,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-03 15:24:23,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-03 15:24:23,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:23,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3595 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3589 trivial. 0 not checked. [2025-03-03 15:24:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81327661] [2025-03-03 15:24:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81327661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:24,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:24,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179788874] [2025-03-03 15:24:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:24,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:24,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:24,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:24,195 INFO L87 Difference]: Start difference. First operand 382 states and 564 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-03 15:24:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:24,422 INFO L93 Difference]: Finished difference Result 1083 states and 1626 transitions. [2025-03-03 15:24:24,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:24:24,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 319 [2025-03-03 15:24:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:24,427 INFO L225 Difference]: With dead ends: 1083 [2025-03-03 15:24:24,427 INFO L226 Difference]: Without dead ends: 741 [2025-03-03 15:24:24,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 15:24:24,431 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 274 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:24,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1056 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:24:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-03 15:24:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 385. [2025-03-03 15:24:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 238 states have (on average 1.2647058823529411) internal successors, (301), 241 states have internal predecessors, (301), 131 states have call successors, (131), 13 states have call predecessors, (131), 15 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-03 15:24:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 568 transitions. [2025-03-03 15:24:24,484 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 568 transitions. Word has length 319 [2025-03-03 15:24:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:24,485 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 568 transitions. [2025-03-03 15:24:24,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-03 15:24:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 568 transitions. [2025-03-03 15:24:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-03 15:24:24,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:24,489 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:24,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:24:24,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:24,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1919383982, now seen corresponding path program 1 times [2025-03-03 15:24:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945595541] [2025-03-03 15:24:24,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:24,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-03 15:24:24,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-03 15:24:24,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:24,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3595 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3589 trivial. 0 not checked. [2025-03-03 15:24:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:25,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945595541] [2025-03-03 15:24:25,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945595541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:25,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:25,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:24:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081173033] [2025-03-03 15:24:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:25,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:25,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:25,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:25,530 INFO L87 Difference]: Start difference. First operand 385 states and 568 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-03-03 15:24:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:26,089 INFO L93 Difference]: Finished difference Result 394 states and 575 transitions. [2025-03-03 15:24:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:26,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 318 [2025-03-03 15:24:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:26,093 INFO L225 Difference]: With dead ends: 394 [2025-03-03 15:24:26,093 INFO L226 Difference]: Without dead ends: 392 [2025-03-03 15:24:26,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:24:26,095 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 297 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:26,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 910 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:24:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-03 15:24:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 389. [2025-03-03 15:24:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 241 states have (on average 1.2614107883817427) internal successors, (304), 244 states have internal predecessors, (304), 131 states have call successors, (131), 14 states have call predecessors, (131), 16 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-03 15:24:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 571 transitions. [2025-03-03 15:24:26,122 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 571 transitions. Word has length 318 [2025-03-03 15:24:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:26,123 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 571 transitions. [2025-03-03 15:24:26,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-03-03 15:24:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 571 transitions. [2025-03-03 15:24:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 15:24:26,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:26,125 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:26,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:24:26,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:26,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:26,126 INFO L85 PathProgramCache]: Analyzing trace with hash 356934380, now seen corresponding path program 1 times [2025-03-03 15:24:26,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:26,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715156357] [2025-03-03 15:24:26,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:26,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:26,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 15:24:26,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 15:24:26,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:26,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3609 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3601 trivial. 0 not checked. [2025-03-03 15:24:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715156357] [2025-03-03 15:24:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715156357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:27,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:24:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164056946] [2025-03-03 15:24:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:27,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:24:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:27,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:24:27,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:27,094 INFO L87 Difference]: Start difference. First operand 389 states and 571 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-03 15:24:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:27,550 INFO L93 Difference]: Finished difference Result 398 states and 578 transitions. [2025-03-03 15:24:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) Word has length 324 [2025-03-03 15:24:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:27,554 INFO L225 Difference]: With dead ends: 398 [2025-03-03 15:24:27,554 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 15:24:27,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:24:27,555 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 462 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:27,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 910 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:24:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 15:24:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2025-03-03 15:24:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 244 states have (on average 1.2581967213114753) internal successors, (307), 247 states have internal predecessors, (307), 131 states have call successors, (131), 15 states have call predecessors, (131), 17 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-03 15:24:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2025-03-03 15:24:27,578 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 324 [2025-03-03 15:24:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:27,580 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2025-03-03 15:24:27,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-03 15:24:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2025-03-03 15:24:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 15:24:27,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:27,582 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:27,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:24:27,582 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:27,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 328825422, now seen corresponding path program 1 times [2025-03-03 15:24:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:27,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366476438] [2025-03-03 15:24:27,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:27,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 15:24:27,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 15:24:27,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:27,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3627 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3617 trivial. 0 not checked. [2025-03-03 15:24:28,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366476438] [2025-03-03 15:24:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366476438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:28,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:28,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:24:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836168908] [2025-03-03 15:24:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:28,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:24:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:28,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:24:28,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:28,542 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-03 15:24:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:29,024 INFO L93 Difference]: Finished difference Result 402 states and 581 transitions. [2025-03-03 15:24:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) Word has length 328 [2025-03-03 15:24:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:29,027 INFO L225 Difference]: With dead ends: 402 [2025-03-03 15:24:29,027 INFO L226 Difference]: Without dead ends: 398 [2025-03-03 15:24:29,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:24:29,028 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 318 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:29,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1064 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:24:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-03 15:24:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2025-03-03 15:24:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 246 states have (on average 1.2520325203252032) internal successors, (308), 248 states have internal predecessors, (308), 131 states have call successors, (131), 16 states have call predecessors, (131), 17 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-03 15:24:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 575 transitions. [2025-03-03 15:24:29,050 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 575 transitions. Word has length 328 [2025-03-03 15:24:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:29,051 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 575 transitions. [2025-03-03 15:24:29,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-03 15:24:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 575 transitions. [2025-03-03 15:24:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-03 15:24:29,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:29,054 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:29,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:24:29,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:29,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:29,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1574147596, now seen corresponding path program 1 times [2025-03-03 15:24:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:29,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957068422] [2025-03-03 15:24:29,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:29,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-03 15:24:29,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-03 15:24:29,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:29,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3637 trivial. 0 not checked. [2025-03-03 15:24:29,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957068422] [2025-03-03 15:24:29,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957068422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:29,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:29,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:24:29,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323288602] [2025-03-03 15:24:29,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:29,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:29,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:29,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:29,825 INFO L87 Difference]: Start difference. First operand 395 states and 575 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-03 15:24:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:30,213 INFO L93 Difference]: Finished difference Result 398 states and 577 transitions. [2025-03-03 15:24:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 334 [2025-03-03 15:24:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:30,216 INFO L225 Difference]: With dead ends: 398 [2025-03-03 15:24:30,216 INFO L226 Difference]: Without dead ends: 280 [2025-03-03 15:24:30,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:24:30,217 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 220 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:30,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 993 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:24:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-03 15:24:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2025-03-03 15:24:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 186 states have internal predecessors, (243), 84 states have call successors, (84), 9 states have call predecessors, (84), 11 states have return successors, (88), 83 states have call predecessors, (88), 83 states have call successors, (88) [2025-03-03 15:24:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 415 transitions. [2025-03-03 15:24:30,234 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 415 transitions. Word has length 334 [2025-03-03 15:24:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:30,234 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 415 transitions. [2025-03-03 15:24:30,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-03 15:24:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 415 transitions. [2025-03-03 15:24:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 15:24:30,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:30,236 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:24:30,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:24:30,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:30,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1449768708, now seen corresponding path program 1 times [2025-03-03 15:24:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:30,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535131076] [2025-03-03 15:24:30,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:30,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:30,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 15:24:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 15:24:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4316 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4313 trivial. 0 not checked. [2025-03-03 15:24:31,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:31,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535131076] [2025-03-03 15:24:31,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535131076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:31,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194996399] [2025-03-03 15:24:31,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:31,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:31,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:31,191 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 15:24:31,192 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 15:24:31,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 15:24:32,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 15:24:32,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:32,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:32,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 2694 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:24:32,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:32,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-03 15:24:32,204 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 9 treesize of output 3 [2025-03-03 15:24:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4316 backedges. 800 proven. 5 refuted. 0 times theorem prover too weak. 3511 trivial. 0 not checked. [2025-03-03 15:24:32,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4316 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4311 trivial. 0 not checked. [2025-03-03 15:24:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194996399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:32,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-03-03 15:24:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230979358] [2025-03-03 15:24:32,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:32,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:24:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:32,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:24:32,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:24:32,964 INFO L87 Difference]: Start difference. First operand 279 states and 415 transitions. Second operand has 12 states, 9 states have (on average 16.0) internal successors, (144), 12 states have internal predecessors, (144), 11 states have call successors, (103), 4 states have call predecessors, (103), 6 states have return successors, (102), 8 states have call predecessors, (102), 11 states have call successors, (102) [2025-03-03 15:24:36,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:40,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:45,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []