./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_dekker.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_dekker.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 14b6c4171d4b04e355b9ddd303f20c8b3e4e81d04535a1ef986d499534108e49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:34:12,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:34:12,811 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:12,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:34:12,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:34:12,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:34:12,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:34:12,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:34:12,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:34:12,845 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:34:12,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:34:12,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:34:12,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:34:12,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:34:12,846 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:34:12,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:34:12,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:34:12,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:34:12,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:34:12,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:34:12,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:34:12,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:34:12,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:34:12,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:34:12,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:12,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:34:12,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:34:12,849 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:34:12,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:34:12,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:34:12,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:34:12,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:34:12,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:34:12,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:34:12,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:34:12,850 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 -> 14b6c4171d4b04e355b9ddd303f20c8b3e4e81d04535a1ef986d499534108e49 [2025-03-08 06:34:13,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:34:13,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:34:13,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:34:13,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:34:13,084 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:34:13,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_dekker.i [2025-03-08 06:34:14,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149eace67/5b08a40f1f324cdd88c266457877d08c/FLAG4647b4ed9 [2025-03-08 06:34:14,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:34:14,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker.i [2025-03-08 06:34:14,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149eace67/5b08a40f1f324cdd88c266457877d08c/FLAG4647b4ed9 [2025-03-08 06:34:14,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149eace67/5b08a40f1f324cdd88c266457877d08c [2025-03-08 06:34:14,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:34:14,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:34:14,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:14,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:34:14,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:34:14,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:14" (1/1) ... [2025-03-08 06:34:14,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a977924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:14, skipping insertion in model container [2025-03-08 06:34:14,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:14" (1/1) ... [2025-03-08 06:34:14,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:34:15,108 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_dekker.i[23603,23616] [2025-03-08 06:34:15,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:15,202 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:34:15,233 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_dekker.i[23603,23616] [2025-03-08 06:34:15,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:15,333 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:34:15,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:15 WrapperNode [2025-03-08 06:34:15,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:15,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:15,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:34:15,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:34:15,340 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:15" (1/1) ... [2025-03-08 06:34:15,363 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:15" (1/1) ... [2025-03-08 06:34:15,395 INFO L138 Inliner]: procedures = 145, calls = 309, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 457 [2025-03-08 06:34:15,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:15,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:34:15,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:34:15,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:34:15,403 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:15" (1/1) ... [2025-03-08 06:34:15,403 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:15" (1/1) ... [2025-03-08 06:34:15,408 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:15" (1/1) ... [2025-03-08 06:34:15,432 INFO L175 MemorySlicer]: Split 158 memory accesses to 18 slices as follows [2, 5, 8, 8, 5, 8, 29, 21, 7, 6, 7, 9, 7, 13, 5, 13, 0, 5]. 18 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 0, 3, 3, 0, 3, 9, 9, 3, 2, 3, 3, 3, 0, 0, 0, 0, 0]. The 39 writes are split as follows [0, 1, 2, 2, 1, 2, 11, 6, 2, 2, 2, 2, 2, 1, 1, 1, 0, 1]. [2025-03-08 06:34:15,433 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:15" (1/1) ... [2025-03-08 06:34:15,433 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:15" (1/1) ... [2025-03-08 06:34:15,458 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:15" (1/1) ... [2025-03-08 06:34:15,462 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:15" (1/1) ... [2025-03-08 06:34:15,468 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:15" (1/1) ... [2025-03-08 06:34:15,470 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:15" (1/1) ... [2025-03-08 06:34:15,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:34:15,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:34:15,480 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:34:15,480 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:34:15,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:15" (1/1) ... [2025-03-08 06:34:15,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:15,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:15,506 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:15,509 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:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:34:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:34:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:34:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:34:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:34:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:34:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:34:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:34:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:34:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:34:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:34:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:34:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:34:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:34:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:34:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 06:34:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 06:34:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 06:34:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:34:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:34:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:34:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:34:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:34:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:34:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:34:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:34:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:34:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:34:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:34:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:34:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:34:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:34:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:34:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 06:34:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:34:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:34:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:34:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:34:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:34:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:34:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:34:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:34:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:34:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:34:15,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-08 06:34:15,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:15,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:34:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:34:15,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:34:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:34:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:34:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:34:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:34:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:34:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 06:34:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 06:34:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 06:34:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:34:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:34:15,750 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:34:15,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:34:17,141 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-03-08 06:34:17,141 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:34:17,148 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:34:17,148 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:34:17,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:17 BoogieIcfgContainer [2025-03-08 06:34:17,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:34:17,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:34:17,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:34:17,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:34:17,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:34:14" (1/3) ... [2025-03-08 06:34:17,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9a2006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:17, skipping insertion in model container [2025-03-08 06:34:17,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:15" (2/3) ... [2025-03-08 06:34:17,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9a2006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:17, skipping insertion in model container [2025-03-08 06:34:17,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:17" (3/3) ... [2025-03-08 06:34:17,156 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_dekker.i [2025-03-08 06:34:17,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:34:17,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_dekker.i that has 6 procedures, 116 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 06:34:17,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:34:17,218 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;@61fae248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:34:17,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:34:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 06:34:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 06:34:17,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:17,235 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:17,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash 499045430, now seen corresponding path program 1 times [2025-03-08 06:34:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315529543] [2025-03-08 06:34:17,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:17,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:34:17,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:34:17,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:17,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:17,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:17,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315529543] [2025-03-08 06:34:17,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315529543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:17,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:17,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:17,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920896539] [2025-03-08 06:34:17,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:17,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:17,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:17,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:17,859 INFO L87 Difference]: Start difference. First operand has 116 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:20,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:34:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:20,415 INFO L93 Difference]: Finished difference Result 230 states and 367 transitions. [2025-03-08 06:34:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:34:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-08 06:34:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:20,422 INFO L225 Difference]: With dead ends: 230 [2025-03-08 06:34:20,422 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 06:34:20,424 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:20,427 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:20,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 323 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 06:34:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 06:34:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-08 06:34:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 06:34:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2025-03-08 06:34:20,460 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 131 [2025-03-08 06:34:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:20,460 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2025-03-08 06:34:20,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2025-03-08 06:34:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:34:20,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:20,465 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:34:20,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:20,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash 552625124, now seen corresponding path program 1 times [2025-03-08 06:34:20,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:20,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032899609] [2025-03-08 06:34:20,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:20,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:34:20,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:34:20,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:20,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:20,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:20,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032899609] [2025-03-08 06:34:20,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032899609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:20,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:20,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:20,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321977042] [2025-03-08 06:34:20,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:20,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:20,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:20,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:20,788 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:20,818 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2025-03-08 06:34:20,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:34:20,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-03-08 06:34:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:20,821 INFO L225 Difference]: With dead ends: 224 [2025-03-08 06:34:20,822 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 06:34:20,823 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:20,825 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 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:20,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 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:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 06:34:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-08 06:34:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 06:34:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-08 06:34:20,843 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 133 [2025-03-08 06:34:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:20,844 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-08 06:34:20,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-08 06:34:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:34:20,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:20,848 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:34:20,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:20,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2018252427, now seen corresponding path program 1 times [2025-03-08 06:34:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464534997] [2025-03-08 06:34:20,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:20,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:20,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:34:20,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:34:20,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:20,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:21,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:21,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464534997] [2025-03-08 06:34:21,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464534997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:21,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731477929] [2025-03-08 06:34:21,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:21,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:21,176 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:21,177 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:21,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:34:21,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:34:21,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:21,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:21,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:34:21,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:21,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731477929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:21,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:21,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:34:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777362336] [2025-03-08 06:34:21,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:21,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:34:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:21,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:34:21,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:34:21,787 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 06:34:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:21,821 INFO L93 Difference]: Finished difference Result 227 states and 329 transitions. [2025-03-08 06:34:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:34:21,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 134 [2025-03-08 06:34:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:21,823 INFO L225 Difference]: With dead ends: 227 [2025-03-08 06:34:21,823 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 06:34:21,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 265 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:21,824 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:21,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:34:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 06:34:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-08 06:34:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 06:34:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-08 06:34:21,832 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 134 [2025-03-08 06:34:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-08 06:34:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 06:34:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-08 06:34:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 06:34:21,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:21,834 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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] [2025-03-08 06:34:21,843 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:22,035 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:22,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:22,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash -73376341, now seen corresponding path program 2 times [2025-03-08 06:34:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:22,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553283581] [2025-03-08 06:34:22,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:34:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:22,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-03-08 06:34:22,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 136 statements. [2025-03-08 06:34:22,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:34:22,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-03-08 06:34:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553283581] [2025-03-08 06:34:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553283581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:22,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:22,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:34:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505918895] [2025-03-08 06:34:22,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:22,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:34:22,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:22,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:34:22,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:34:22,316 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:22,364 INFO L93 Difference]: Finished difference Result 222 states and 323 transitions. [2025-03-08 06:34:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:34:22,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-03-08 06:34:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:22,369 INFO L225 Difference]: With dead ends: 222 [2025-03-08 06:34:22,370 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 06:34:22,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:34:22,371 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 107 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:22,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 502 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:34:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 06:34:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-08 06:34:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 116 states have internal predecessors, (153), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-08 06:34:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2025-03-08 06:34:22,398 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 136 [2025-03-08 06:34:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:22,399 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2025-03-08 06:34:22,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2025-03-08 06:34:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 06:34:22,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:22,403 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 5, 5, 5, 5, 5, 3, 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] [2025-03-08 06:34:22,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:34:22,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:22,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:22,405 INFO L85 PathProgramCache]: Analyzing trace with hash 164353855, now seen corresponding path program 1 times [2025-03-08 06:34:22,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:22,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929413894] [2025-03-08 06:34:22,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:22,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 06:34:22,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 06:34:22,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:22,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-03-08 06:34:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929413894] [2025-03-08 06:34:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929413894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616961581] [2025-03-08 06:34:22,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:22,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:22,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:22,766 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:22,768 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:23,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 06:34:23,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 06:34:23,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:23,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:23,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:34:23,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-03-08 06:34:23,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-03-08 06:34:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616961581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:23,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:23,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:34:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874929771] [2025-03-08 06:34:23,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:23,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:34:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:23,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:34:23,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:34:23,486 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 06:34:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:23,955 INFO L93 Difference]: Finished difference Result 354 states and 514 transitions. [2025-03-08 06:34:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:34:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 220 [2025-03-08 06:34:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:23,959 INFO L225 Difference]: With dead ends: 354 [2025-03-08 06:34:23,959 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 06:34:23,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 437 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:23,960 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:23,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 316 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:34:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 06:34:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-08 06:34:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 126 states have internal predecessors, (165), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-08 06:34:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2025-03-08 06:34:23,979 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 220 [2025-03-08 06:34:23,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:23,979 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2025-03-08 06:34:23,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 06:34:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2025-03-08 06:34:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:23,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:23,981 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 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] [2025-03-08 06:34:23,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:34:24,182 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:34:24,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:24,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash -389956193, now seen corresponding path program 2 times [2025-03-08 06:34:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94924372] [2025-03-08 06:34:24,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:34:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:24,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 230 statements into 2 equivalence classes. [2025-03-08 06:34:24,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 230 statements. [2025-03-08 06:34:24,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:34:24,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 06:34:24,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94924372] [2025-03-08 06:34:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94924372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:34:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650291159] [2025-03-08 06:34:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:24,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:34:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:24,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:34:24,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:34:24,455 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 06:34:29,177 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:34:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:29,291 INFO L93 Difference]: Finished difference Result 496 states and 721 transitions. [2025-03-08 06:34:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:34:29,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 230 [2025-03-08 06:34:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:29,295 INFO L225 Difference]: With dead ends: 496 [2025-03-08 06:34:29,295 INFO L226 Difference]: Without dead ends: 344 [2025-03-08 06:34:29,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:34:29,297 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 146 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:29,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 661 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 06:34:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-08 06:34:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 340. [2025-03-08 06:34:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 224 states have (on average 1.3080357142857142) internal successors, (293), 224 states have internal predecessors, (293), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (110), 95 states have call predecessors, (110), 95 states have call successors, (110) [2025-03-08 06:34:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 498 transitions. [2025-03-08 06:34:29,329 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 498 transitions. Word has length 230 [2025-03-08 06:34:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:29,329 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 498 transitions. [2025-03-08 06:34:29,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 06:34:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 498 transitions. [2025-03-08 06:34:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:29,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:29,334 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 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] [2025-03-08 06:34:29,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:34:29,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:29,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1068275201, now seen corresponding path program 1 times [2025-03-08 06:34:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:29,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953375918] [2025-03-08 06:34:29,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:29,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:29,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:29,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:29,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 06:34:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953375918] [2025-03-08 06:34:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953375918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:34:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106485741] [2025-03-08 06:34:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:34:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:30,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:34:30,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:34:30,011 INFO L87 Difference]: Start difference. First operand 340 states and 498 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 06:34:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:31,133 INFO L93 Difference]: Finished difference Result 620 states and 895 transitions. [2025-03-08 06:34:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:34:31,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 230 [2025-03-08 06:34:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:31,136 INFO L225 Difference]: With dead ends: 620 [2025-03-08 06:34:31,136 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 06:34:31,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:34:31,140 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 142 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:31,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 665 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:34:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 06:34:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2025-03-08 06:34:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 200 states have (on average 1.26) internal successors, (252), 200 states have internal predecessors, (252), 85 states have call successors, (85), 18 states have call predecessors, (85), 18 states have return successors, (93), 85 states have call predecessors, (93), 85 states have call successors, (93) [2025-03-08 06:34:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2025-03-08 06:34:31,169 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 230 [2025-03-08 06:34:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:31,169 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2025-03-08 06:34:31,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 06:34:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2025-03-08 06:34:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:31,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:31,177 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 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] [2025-03-08 06:34:31,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:34:31,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:31,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1605607998, now seen corresponding path program 1 times [2025-03-08 06:34:31,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:31,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080366397] [2025-03-08 06:34:31,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:31,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:31,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:31,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:31,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:34:31,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:31,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080366397] [2025-03-08 06:34:31,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080366397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:31,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867473903] [2025-03-08 06:34:31,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:31,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:31,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:31,797 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:34:31,798 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:34:32,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:32,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:32,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:32,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:32,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 06:34:32,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2025-03-08 06:34:32,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:34:32,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867473903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:32,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:34:32,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-08 06:34:32,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643475699] [2025-03-08 06:34:32,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:32,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:34:32,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:32,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:34:32,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:34:32,538 INFO L87 Difference]: Start difference. First operand 304 states and 430 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, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 06:34:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:33,205 INFO L93 Difference]: Finished difference Result 811 states and 1140 transitions. [2025-03-08 06:34:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:34:33,206 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, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 230 [2025-03-08 06:34:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:33,209 INFO L225 Difference]: With dead ends: 811 [2025-03-08 06:34:33,209 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 06:34:33,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:34:33,211 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 258 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:33,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 483 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:34:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 06:34:33,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2025-03-08 06:34:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 328 states have (on average 1.1768292682926829) internal successors, (386), 327 states have internal predecessors, (386), 142 states have call successors, (142), 31 states have call predecessors, (142), 37 states have return successors, (170), 149 states have call predecessors, (170), 142 states have call successors, (170) [2025-03-08 06:34:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 698 transitions. [2025-03-08 06:34:33,252 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 698 transitions. Word has length 230 [2025-03-08 06:34:33,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:33,253 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 698 transitions. [2025-03-08 06:34:33,253 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, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 06:34:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 698 transitions. [2025-03-08 06:34:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:33,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:33,256 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 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] [2025-03-08 06:34:33,266 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:34:33,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:33,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:33,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1539527011, now seen corresponding path program 1 times [2025-03-08 06:34:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936624903] [2025-03-08 06:34:33,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:33,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:33,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:33,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:33,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:34:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936624903] [2025-03-08 06:34:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936624903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455765484] [2025-03-08 06:34:34,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:34,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:34,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:34,009 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:34:34,010 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:34:34,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:34,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:34,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:34,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:34,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:34:34,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 400 proven. 4 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-03-08 06:34:34,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:34:35,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455765484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:35,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:35,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-08 06:34:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310130803] [2025-03-08 06:34:35,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:35,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:34:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:35,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:34:35,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:34:35,146 INFO L87 Difference]: Start difference. First operand 508 states and 698 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) [2025-03-08 06:34:36,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:34:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:37,620 INFO L93 Difference]: Finished difference Result 1043 states and 1454 transitions. [2025-03-08 06:34:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:34:37,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) Word has length 230 [2025-03-08 06:34:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:37,626 INFO L225 Difference]: With dead ends: 1043 [2025-03-08 06:34:37,626 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 06:34:37,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:34:37,630 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 214 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:37,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 505 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 06:34:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 06:34:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 546. [2025-03-08 06:34:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 364 states have (on average 1.2087912087912087) internal successors, (440), 364 states have internal predecessors, (440), 126 states have call successors, (126), 44 states have call predecessors, (126), 55 states have return successors, (180), 137 states have call predecessors, (180), 126 states have call successors, (180) [2025-03-08 06:34:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 746 transitions. [2025-03-08 06:34:37,682 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 746 transitions. Word has length 230 [2025-03-08 06:34:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:37,682 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 746 transitions. [2025-03-08 06:34:37,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) [2025-03-08 06:34:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 746 transitions. [2025-03-08 06:34:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:37,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:37,689 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 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] [2025-03-08 06:34:37,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 06:34:37,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:37,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1506508195, now seen corresponding path program 1 times [2025-03-08 06:34:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619919241] [2025-03-08 06:34:37,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:37,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:38,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:38,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:38,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:34:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619919241] [2025-03-08 06:34:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619919241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806912720] [2025-03-08 06:34:39,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:39,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:39,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:39,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:34:39,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:34:39,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:40,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:40,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:40,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:40,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1868 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 06:34:40,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:40,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 06:34:43,786 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 06:34:43,786 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 26 treesize of output 15 [2025-03-08 06:34:44,915 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2025-03-08 06:34:44,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-03-08 06:35:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 472 proven. 4 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-03-08 06:35:09,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:09,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-03-08 06:35:09,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-08 06:35:09,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 06:35:09,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-08 06:35:09,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 06:35:09,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-08 06:35:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:35:10,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806912720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:10,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:10,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 35 [2025-03-08 06:35:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455634011] [2025-03-08 06:35:10,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:10,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 06:35:10,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:10,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 06:35:10,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1068, Unknown=1, NotChecked=0, Total=1190 [2025-03-08 06:35:10,128 INFO L87 Difference]: Start difference. First operand 546 states and 746 transitions. Second operand has 35 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 33 states have internal predecessors, (141), 17 states have call successors, (69), 10 states have call predecessors, (69), 13 states have return successors, (70), 16 states have call predecessors, (70), 17 states have call successors, (70) [2025-03-08 06:35:14,166 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 [0] [2025-03-08 06:35:18,862 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:22,876 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:26,884 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:32,144 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:36,157 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:40,168 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:44,183 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:48,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []