./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 06:34:22,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:34:22,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:34:22,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:34:22,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:34:23,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:34:23,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:34:23,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:34:23,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:34:23,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:34:23,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:34:23,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:34:23,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:34:23,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:34:23,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:34:23,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:23,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:34:23,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:34:23,004 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-08 06:34:23,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:34:23,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:34:23,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:34:23,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:34:23,276 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:34:23,278 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-08 06:34:24,480 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eec3a4e5/2e7de2900fe74d5b8f7c5dd55ae46333/FLAG1f60f22e6 [2025-03-08 06:34:24,770 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:34:24,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-03-08 06:34:24,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eec3a4e5/2e7de2900fe74d5b8f7c5dd55ae46333/FLAG1f60f22e6 [2025-03-08 06:34:25,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eec3a4e5/2e7de2900fe74d5b8f7c5dd55ae46333 [2025-03-08 06:34:25,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:34:25,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:34:25,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:25,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:34:25,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:34:25,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e044b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25, skipping insertion in model container [2025-03-08 06:34:25,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:34:25,283 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-08 06:34:25,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:25,374 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:34:25,396 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-08 06:34:25,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:25,473 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:34:25,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25 WrapperNode [2025-03-08 06:34:25,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:25,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:25,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:34:25,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:34:25,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,531 INFO L138 Inliner]: procedures = 145, calls = 401, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 706 [2025-03-08 06:34:25,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:25,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:34:25,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:34:25,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:34:25,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,595 INFO L175 MemorySlicer]: Split 267 memory accesses to 15 slices as follows [2, 8, 8, 31, 8, 2, 53, 48, 22, 22, 10, 11, 11, 31, 0]. 20 percent of accesses are in the largest equivalence class. The 65 initializations are split as follows [2, 3, 3, 0, 3, 0, 18, 18, 6, 6, 6, 0, 0, 0, 0]. The 63 writes are split as follows [0, 2, 2, 1, 2, 2, 20, 15, 7, 7, 2, 1, 1, 1, 0]. [2025-03-08 06:34:25,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:34:25,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:34:25,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:34:25,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:34:25,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (1/1) ... [2025-03-08 06:34:25,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:25,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:25,699 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-08 06:34:25,704 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-08 06:34:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:34:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:34:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:34:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:34:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:34:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 06:34:25,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:34:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:34:25,721 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:34:25,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:34:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:34:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:34:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:34:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:34:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:34:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:34:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:34:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:34:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:34:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:34:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:34:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:34:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:34:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:34:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:34:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:25,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:34:25,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:34:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:34:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:34:25,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:34:25,938 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:34:25,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:34:26,224 INFO L1307 $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-08 06:34:26,225 INFO L1307 $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-08 06:34:26,225 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:26,225 INFO L1307 $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-08 06:34:26,225 INFO L1307 $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-08 06:34:26,225 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:26,225 INFO L1307 $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-08 06:34:26,225 INFO L1307 $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-08 06:34:26,226 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:34:30,616 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-08 06:34:30,617 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:34:30,626 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:34:30,627 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:34:30,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:30 BoogieIcfgContainer [2025-03-08 06:34:30,628 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:34:30,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:34:30,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:34:30,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:34:30,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:34:25" (1/3) ... [2025-03-08 06:34:30,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d31a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:30, skipping insertion in model container [2025-03-08 06:34:30,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:25" (2/3) ... [2025-03-08 06:34:30,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d31a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:30, skipping insertion in model container [2025-03-08 06:34:30,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:30" (3/3) ... [2025-03-08 06:34:30,636 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib-2.i [2025-03-08 06:34:30,647 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:34:30,651 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-08 06:34:30,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:34:30,703 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;@cfd26eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:34:30,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:34:30,708 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-08 06:34:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-08 06:34:30,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:30,721 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-08 06:34:30,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:30,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2083784906, now seen corresponding path program 1 times [2025-03-08 06:34:30,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:30,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567248641] [2025-03-08 06:34:30,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:30,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:30,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-08 06:34:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-08 06:34:31,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:31,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:31,550 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-08 06:34:31,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:31,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567248641] [2025-03-08 06:34:31,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567248641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:31,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:31,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:31,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207836964] [2025-03-08 06:34:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:31,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:31,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:31,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:31,579 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-08 06:34:35,630 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-08 06:34:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:35,695 INFO L93 Difference]: Finished difference Result 352 states and 600 transitions. [2025-03-08 06:34:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:34:35,697 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-08 06:34:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:35,703 INFO L225 Difference]: With dead ends: 352 [2025-03-08 06:34:35,703 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 06:34:35,707 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-08 06:34:35,709 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-08 06:34:35,709 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-08 06:34:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 06:34:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2025-03-08 06:34:35,749 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-08 06:34:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 264 transitions. [2025-03-08 06:34:35,757 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 264 transitions. Word has length 253 [2025-03-08 06:34:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:35,757 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 264 transitions. [2025-03-08 06:34:35,757 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-08 06:34:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2025-03-08 06:34:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-08 06:34:35,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:35,765 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-08 06:34:35,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:34:35,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:35,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1242033744, now seen corresponding path program 1 times [2025-03-08 06:34:35,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:35,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581188668] [2025-03-08 06:34:35,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:35,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 06:34:35,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 06:34:35,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:35,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:36,209 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-08 06:34:36,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:36,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581188668] [2025-03-08 06:34:36,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581188668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:36,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953165283] [2025-03-08 06:34:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:36,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:36,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:36,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:36,216 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-08 06:34:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:36,245 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2025-03-08 06:34:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:34:36,246 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-08 06:34:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:36,248 INFO L225 Difference]: With dead ends: 346 [2025-03-08 06:34:36,248 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 06:34:36,249 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-08 06:34:36,250 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-08 06:34:36,250 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-08 06:34:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 06:34:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-08 06:34:36,260 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-08 06:34:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 265 transitions. [2025-03-08 06:34:36,262 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 265 transitions. Word has length 255 [2025-03-08 06:34:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:36,262 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 265 transitions. [2025-03-08 06:34:36,262 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-08 06:34:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 265 transitions. [2025-03-08 06:34:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-08 06:34:36,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:36,265 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-08 06:34:36,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:34:36,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1395953375, now seen corresponding path program 1 times [2025-03-08 06:34:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898127565] [2025-03-08 06:34:36,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:36,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-08 06:34:36,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-08 06:34:36,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:36,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:36,731 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-08 06:34:36,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898127565] [2025-03-08 06:34:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898127565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477638012] [2025-03-08 06:34:36,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:36,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:36,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:36,734 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-08 06:34:36,736 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-08 06:34:37,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-08 06:34:37,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-08 06:34:37,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:37,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:37,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:34:37,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:37,366 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-08 06:34:37,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:37,597 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-08 06:34:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477638012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:37,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:34:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015905495] [2025-03-08 06:34:37,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:37,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:34:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:37,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:34:37,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:34:37,601 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-08 06:34:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:37,650 INFO L93 Difference]: Finished difference Result 349 states and 531 transitions. [2025-03-08 06:34:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:34:37,651 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-08 06:34:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:37,653 INFO L225 Difference]: With dead ends: 349 [2025-03-08 06:34:37,653 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 06:34:37,654 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-08 06:34:37,654 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-08 06:34:37,654 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-08 06:34:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 06:34:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-08 06:34:37,665 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-08 06:34:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2025-03-08 06:34:37,667 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 256 [2025-03-08 06:34:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:37,667 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2025-03-08 06:34:37,667 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-08 06:34:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2025-03-08 06:34:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-08 06:34:37,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:37,669 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-08 06:34:37,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:34:37,874 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-08 06:34:37,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:37,875 INFO L85 PathProgramCache]: Analyzing trace with hash -534595329, now seen corresponding path program 2 times [2025-03-08 06:34:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058185151] [2025-03-08 06:34:37,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:34:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:38,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 258 statements into 2 equivalence classes. [2025-03-08 06:34:38,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 258 statements. [2025-03-08 06:34:38,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:34:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:38,345 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-08 06:34:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:38,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058185151] [2025-03-08 06:34:38,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058185151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:38,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:38,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:34:38,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528515686] [2025-03-08 06:34:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:38,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:34:38,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:38,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:34:38,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:34:38,347 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-08 06:34:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:38,475 INFO L93 Difference]: Finished difference Result 350 states and 528 transitions. [2025-03-08 06:34:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:34:38,476 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-08 06:34:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:38,483 INFO L225 Difference]: With dead ends: 350 [2025-03-08 06:34:38,483 INFO L226 Difference]: Without dead ends: 348 [2025-03-08 06:34:38,483 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-08 06:34:38,484 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-08 06:34:38,484 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-08 06:34:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-08 06:34:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 345. [2025-03-08 06:34:38,515 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-08 06:34:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 524 transitions. [2025-03-08 06:34:38,518 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 524 transitions. Word has length 258 [2025-03-08 06:34:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:38,519 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 524 transitions. [2025-03-08 06:34:38,519 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-08 06:34:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 524 transitions. [2025-03-08 06:34:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-08 06:34:38,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:38,522 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-08 06:34:38,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:34:38,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:38,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash -535280092, now seen corresponding path program 1 times [2025-03-08 06:34:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:38,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590471988] [2025-03-08 06:34:38,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:38,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 06:34:38,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 06:34:38,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:38,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:38,879 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-08 06:34:38,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:38,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590471988] [2025-03-08 06:34:38,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590471988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:38,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064351752] [2025-03-08 06:34:38,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:38,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:38,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:38,882 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-08 06:34:38,884 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-08 06:34:39,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 06:34:39,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 06:34:39,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:39,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:39,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:34:39,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:39,454 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-08 06:34:39,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:39,671 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-08 06:34:39,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064351752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:39,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 06:34:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913420025] [2025-03-08 06:34:39,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:39,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:34:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:39,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:34:39,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:34:39,674 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-08 06:34:43,723 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-08 06:34:47,739 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-08 06:34:51,754 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-08 06:34:55,787 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-08 06:34:59,814 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-08 06:34:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:59,837 INFO L93 Difference]: Finished difference Result 697 states and 1059 transitions. [2025-03-08 06:34:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:34:59,863 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-08 06:34:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:59,865 INFO L225 Difference]: With dead ends: 697 [2025-03-08 06:34:59,865 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 06:34:59,868 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-08 06:34:59,870 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 4 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:59,870 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.1s Time] [2025-03-08 06:34:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 06:34:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-08 06:34:59,901 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-08 06:34:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 542 transitions. [2025-03-08 06:34:59,906 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 542 transitions. Word has length 263 [2025-03-08 06:34:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:59,907 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 542 transitions. [2025-03-08 06:34:59,908 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-08 06:34:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 542 transitions. [2025-03-08 06:34:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 06:34:59,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:59,914 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-08 06:34:59,925 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-08 06:35:00,114 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-08 06:35:00,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:00,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1305464885, now seen corresponding path program 2 times [2025-03-08 06:35:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:00,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405725537] [2025-03-08 06:35:00,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:00,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-08 06:35:00,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 278 statements. [2025-03-08 06:35:00,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:00,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:00,545 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-08 06:35:00,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:00,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405725537] [2025-03-08 06:35:00,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405725537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:00,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:00,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:00,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435048761] [2025-03-08 06:35:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:00,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:00,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:00,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:00,548 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-08 06:35:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:00,577 INFO L93 Difference]: Finished difference Result 688 states and 1040 transitions. [2025-03-08 06:35:00,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:00,577 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-08 06:35:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:00,579 INFO L225 Difference]: With dead ends: 688 [2025-03-08 06:35:00,579 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 06:35:00,582 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-08 06:35:00,583 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-08 06:35:00,583 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-08 06:35:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 06:35:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-08 06:35:00,629 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-08 06:35:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 541 transitions. [2025-03-08 06:35:00,632 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 541 transitions. Word has length 278 [2025-03-08 06:35:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:00,632 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 541 transitions. [2025-03-08 06:35:00,632 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-08 06:35:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 541 transitions. [2025-03-08 06:35:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 06:35:00,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:00,637 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-08 06:35:00,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:35:00,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:00,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1678068654, now seen corresponding path program 1 times [2025-03-08 06:35:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:00,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115777422] [2025-03-08 06:35:00,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:00,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:00,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 06:35:00,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 06:35:00,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:00,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:01,293 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-08 06:35:01,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:01,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115777422] [2025-03-08 06:35:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115777422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:01,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340628425] [2025-03-08 06:35:01,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:01,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:01,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:01,296 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-08 06:35:01,298 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-08 06:35:01,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 06:35:01,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 06:35:01,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:01,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:01,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 2032 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:35:01,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:01,987 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-08 06:35:01,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:02,320 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-08 06:35:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340628425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:02,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:02,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-08 06:35:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555269594] [2025-03-08 06:35:02,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:02,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:35:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:02,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:35:02,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:35:02,321 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-08 06:35:06,414 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-08 06:35:10,426 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-08 06:35:14,451 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-08 06:35:18,472 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-08 06:35:22,503 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-08 06:35:26,518 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-08 06:35:30,541 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-08 06:35:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:30,555 INFO L93 Difference]: Finished difference Result 707 states and 1068 transitions. [2025-03-08 06:35:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:35:30,595 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-08 06:35:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:30,598 INFO L225 Difference]: With dead ends: 707 [2025-03-08 06:35:30,598 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 06:35:30,601 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-08 06:35:30,603 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-08 06:35:30,603 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-08 06:35:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 06:35:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-08 06:35:30,628 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-08 06:35:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 553 transitions. [2025-03-08 06:35:30,631 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 553 transitions. Word has length 298 [2025-03-08 06:35:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:30,632 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 553 transitions. [2025-03-08 06:35:30,632 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-08 06:35:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 553 transitions. [2025-03-08 06:35:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-08 06:35:30,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:30,636 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-08 06:35:30,648 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-08 06:35:30,842 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-08 06:35:30,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:30,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash 847220375, now seen corresponding path program 1 times [2025-03-08 06:35:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:30,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005667337] [2025-03-08 06:35:30,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:31,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 06:35:31,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 06:35:31,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:31,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:31,906 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-08 06:35:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005667337] [2025-03-08 06:35:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005667337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:31,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586458280] [2025-03-08 06:35:31,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:31,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:31,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:31,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:31,908 INFO L87 Difference]: Start difference. First operand 370 states and 553 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, (45), 2 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2025-03-08 06:35:35,929 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-08 06:35:39,945 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-08 06:35:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:40,417 INFO L93 Difference]: Finished difference Result 1047 states and 1592 transitions. [2025-03-08 06:35:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:35:40,417 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, (45), 2 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) Word has length 309 [2025-03-08 06:35:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:40,423 INFO L225 Difference]: With dead ends: 1047 [2025-03-08 06:35:40,424 INFO L226 Difference]: Without dead ends: 717 [2025-03-08 06:35:40,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:40,425 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 300 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:40,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 879 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 201 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-08 06:35:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-08 06:35:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 376. [2025-03-08 06:35:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 234 states have internal predecessors, (294), 131 states have call successors, (131), 11 states have call predecessors, (131), 13 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-08 06:35:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 561 transitions. [2025-03-08 06:35:40,471 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 561 transitions. Word has length 309 [2025-03-08 06:35:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:40,472 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 561 transitions. [2025-03-08 06:35:40,473 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, (45), 2 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2025-03-08 06:35:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 561 transitions. [2025-03-08 06:35:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 06:35:40,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:40,476 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] [2025-03-08 06:35:40,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:35:40,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:40,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 597524750, now seen corresponding path program 2 times [2025-03-08 06:35:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:40,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710958189] [2025-03-08 06:35:40,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:40,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 308 statements into 2 equivalence classes. [2025-03-08 06:35:41,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 06:35:41,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 06:35:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:41,967 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-08 06:35:41,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:41,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710958189] [2025-03-08 06:35:41,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710958189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:41,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:41,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:35:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657919678] [2025-03-08 06:35:41,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:41,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:41,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:41,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:41,969 INFO L87 Difference]: Start difference. First operand 376 states and 561 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, (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-08 06:35:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:42,469 INFO L93 Difference]: Finished difference Result 389 states and 573 transitions. [2025-03-08 06:35:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:42,470 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, (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 308 [2025-03-08 06:35:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:42,473 INFO L225 Difference]: With dead ends: 389 [2025-03-08 06:35:42,473 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 06:35:42,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-08 06:35:42,474 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 229 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:42,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 969 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:35:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 06:35:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2025-03-08 06:35:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 235 states have (on average 1.2680851063829788) internal successors, (298), 238 states have internal predecessors, (298), 131 states have call successors, (131), 12 states have call predecessors, (131), 14 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-08 06:35:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 565 transitions. [2025-03-08 06:35:42,498 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 565 transitions. Word has length 308 [2025-03-08 06:35:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:42,499 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 565 transitions. [2025-03-08 06:35:42,499 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, (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-08 06:35:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 565 transitions. [2025-03-08 06:35:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-08 06:35:42,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:42,502 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-08 06:35:42,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:35:42,504 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:42,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:42,504 INFO L85 PathProgramCache]: Analyzing trace with hash 462821301, now seen corresponding path program 1 times [2025-03-08 06:35:42,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:42,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313506320] [2025-03-08 06:35:42,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:42,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-08 06:35:42,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-08 06:35:42,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:42,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:43,419 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-08 06:35:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313506320] [2025-03-08 06:35:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313506320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:35:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580134756] [2025-03-08 06:35:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:35:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:43,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:35:43,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:43,420 INFO L87 Difference]: Start difference. First operand 381 states and 565 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-08 06:35:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:44,054 INFO L93 Difference]: Finished difference Result 390 states and 572 transitions. [2025-03-08 06:35:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:44,054 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-08 06:35:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:44,058 INFO L225 Difference]: With dead ends: 390 [2025-03-08 06:35:44,058 INFO L226 Difference]: Without dead ends: 388 [2025-03-08 06:35:44,059 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-08 06:35:44,059 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 394 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:44,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 966 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:35:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-08 06:35:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2025-03-08 06:35:44,099 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-08 06:35:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 568 transitions. [2025-03-08 06:35:44,104 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 568 transitions. Word has length 313 [2025-03-08 06:35:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:44,105 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 568 transitions. [2025-03-08 06:35:44,106 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-08 06:35:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 568 transitions. [2025-03-08 06:35:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-08 06:35:44,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:44,111 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-08 06:35:44,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:35:44,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:44,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1919383982, now seen corresponding path program 1 times [2025-03-08 06:35:44,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:44,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797530855] [2025-03-08 06:35:44,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:44,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-08 06:35:44,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-08 06:35:44,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:44,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:45,096 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-08 06:35:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797530855] [2025-03-08 06:35:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797530855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:35:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110739500] [2025-03-08 06:35:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:45,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:45,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:45,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:45,097 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-08 06:35:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:45,596 INFO L93 Difference]: Finished difference Result 394 states and 575 transitions. [2025-03-08 06:35:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:45,596 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-08 06:35:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:45,599 INFO L225 Difference]: With dead ends: 394 [2025-03-08 06:35:45,599 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 06:35:45,599 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-08 06:35:45,600 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 227 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:45,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 969 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:35:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 06:35:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 389. [2025-03-08 06:35:45,618 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-08 06:35:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 571 transitions. [2025-03-08 06:35:45,620 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 571 transitions. Word has length 318 [2025-03-08 06:35:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:45,620 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 571 transitions. [2025-03-08 06:35:45,621 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-08 06:35:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 571 transitions. [2025-03-08 06:35:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-08 06:35:45,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:45,623 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] [2025-03-08 06:35:45,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:35:45,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:45,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash -451652715, now seen corresponding path program 1 times [2025-03-08 06:35:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:45,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033940375] [2025-03-08 06:35:45,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:45,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-08 06:35:45,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-08 06:35:45,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:46,503 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-08 06:35:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033940375] [2025-03-08 06:35:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033940375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:46,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:46,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:35:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772723900] [2025-03-08 06:35:46,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:46,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:35:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:46,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:35:46,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:46,505 INFO L87 Difference]: Start difference. First operand 389 states and 571 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, (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-08 06:35:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:47,031 INFO L93 Difference]: Finished difference Result 398 states and 578 transitions. [2025-03-08 06:35:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:47,032 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, (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 323 [2025-03-08 06:35:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:47,034 INFO L225 Difference]: With dead ends: 398 [2025-03-08 06:35:47,034 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 06:35:47,035 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-08 06:35:47,035 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 388 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:47,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1005 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:35:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 06:35:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2025-03-08 06:35:47,075 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-08 06:35:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2025-03-08 06:35:47,077 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 323 [2025-03-08 06:35:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:47,077 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2025-03-08 06:35:47,078 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, (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-08 06:35:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2025-03-08 06:35:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 06:35:47,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:47,080 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-08 06:35:47,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:35:47,080 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:47,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash 328825422, now seen corresponding path program 1 times [2025-03-08 06:35:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:47,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863936881] [2025-03-08 06:35:47,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:47,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 06:35:47,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 06:35:47,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:47,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:48,135 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-08 06:35:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863936881] [2025-03-08 06:35:48,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863936881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:48,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:48,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:35:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621178544] [2025-03-08 06:35:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:48,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:35:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:48,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:35:48,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:48,137 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-08 06:35:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:48,713 INFO L93 Difference]: Finished difference Result 402 states and 581 transitions. [2025-03-08 06:35:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:48,714 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-08 06:35:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:48,716 INFO L225 Difference]: With dead ends: 402 [2025-03-08 06:35:48,716 INFO L226 Difference]: Without dead ends: 398 [2025-03-08 06:35:48,717 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-08 06:35:48,717 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 394 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:48,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 969 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:35:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-08 06:35:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2025-03-08 06:35:48,736 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-08 06:35:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 575 transitions. [2025-03-08 06:35:48,738 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 575 transitions. Word has length 328 [2025-03-08 06:35:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:48,739 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 575 transitions. [2025-03-08 06:35:48,739 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-08 06:35:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 575 transitions. [2025-03-08 06:35:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 06:35:48,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:48,741 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] [2025-03-08 06:35:48,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:35:48,742 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:48,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1139771253, now seen corresponding path program 1 times [2025-03-08 06:35:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729571584] [2025-03-08 06:35:48,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:48,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 06:35:48,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 06:35:48,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:48,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:49,424 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-08 06:35:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729571584] [2025-03-08 06:35:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729571584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:49,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:35:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205230678] [2025-03-08 06:35:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:49,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:49,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:49,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:49,426 INFO L87 Difference]: Start difference. First operand 395 states and 575 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, (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-08 06:35:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:49,870 INFO L93 Difference]: Finished difference Result 398 states and 577 transitions. [2025-03-08 06:35:49,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:49,870 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, (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 333 [2025-03-08 06:35:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:49,873 INFO L225 Difference]: With dead ends: 398 [2025-03-08 06:35:49,873 INFO L226 Difference]: Without dead ends: 280 [2025-03-08 06:35:49,874 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-08 06:35:49,874 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 289 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:49,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 931 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:35:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-08 06:35:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2025-03-08 06:35:49,891 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-08 06:35:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 415 transitions. [2025-03-08 06:35:49,893 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 415 transitions. Word has length 333 [2025-03-08 06:35:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:49,893 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 415 transitions. [2025-03-08 06:35:49,894 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, (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-08 06:35:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 415 transitions. [2025-03-08 06:35:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-08 06:35:49,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:49,896 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:35:49,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:35:49,897 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:49,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:49,897 INFO L85 PathProgramCache]: Analyzing trace with hash 711872941, now seen corresponding path program 1 times [2025-03-08 06:35:49,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:49,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536551363] [2025-03-08 06:35:49,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:50,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-08 06:35:50,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-08 06:35:50,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:50,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4319 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4311 trivial. 0 not checked. [2025-03-08 06:35:50,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536551363] [2025-03-08 06:35:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536551363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95897554] [2025-03-08 06:35:50,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:50,932 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-08 06:35:50,934 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-08 06:35:51,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-08 06:35:51,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-08 06:35:51,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:51,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:51,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 2721 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:35:51,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:52,018 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 21 treesize of output 20 [2025-03-08 06:35:52,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:35:52,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-03-08 06:35:52,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:35:52,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-03-08 06:35:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4319 backedges. 800 proven. 8 refuted. 0 times theorem prover too weak. 3511 trivial. 0 not checked. [2025-03-08 06:35:52,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4319 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4311 trivial. 0 not checked. [2025-03-08 06:35:52,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95897554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:52,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:52,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-03-08 06:35:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944890685] [2025-03-08 06:35:52,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:52,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:35:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:52,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:35:52,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:35:52,985 INFO L87 Difference]: Start difference. First operand 279 states and 415 transitions. Second operand has 10 states, 8 states have (on average 14.75) internal successors, (118), 10 states have internal predecessors, (118), 10 states have call successors, (95), 4 states have call predecessors, (95), 5 states have return successors, (94), 8 states have call predecessors, (94), 10 states have call successors, (94)