./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_fib-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f188ac4b0bdfe335e0fcb7c5645493965a99a7b8a1d7a552e9d512c30775fb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:42:13,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:42:13,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:42:13,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:42:13,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:42:13,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:42:13,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:42:13,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:42:13,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:42:13,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:42:13,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:42:13,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:42:13,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:42:13,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:42:13,217 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:42:13,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:42:13,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:42:13,217 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:42:13,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:42:13,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:42:13,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:13,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:42:13,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:42:13,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:42:13,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:42:13,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:42:13,220 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f188ac4b0bdfe335e0fcb7c5645493965a99a7b8a1d7a552e9d512c30775fb8 [2025-03-16 19:42:13,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:42:13,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:42:13,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:42:13,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:42:13,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:42:13,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-03-16 19:42:14,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77176e044/7ef15a1b30e346a0828c37939137b81a/FLAG960d672ba [2025-03-16 19:42:14,960 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:42:14,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-03-16 19:42:14,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77176e044/7ef15a1b30e346a0828c37939137b81a/FLAG960d672ba [2025-03-16 19:42:15,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77176e044/7ef15a1b30e346a0828c37939137b81a [2025-03-16 19:42:15,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:42:15,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:42:15,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:15,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:42:15,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:42:15,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329e916e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15, skipping insertion in model container [2025-03-16 19:42:15,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:42:15,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-2.i[23457,23470] [2025-03-16 19:42:15,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:15,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:42:15,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-2.i[23457,23470] [2025-03-16 19:42:15,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:15,468 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:42:15,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15 WrapperNode [2025-03-16 19:42:15,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:15,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:15,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:42:15,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:42:15,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,552 INFO L138 Inliner]: procedures = 145, calls = 401, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 706 [2025-03-16 19:42:15,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:15,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:42:15,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:42:15,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:42:15,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,604 INFO L175 MemorySlicer]: Split 267 memory accesses to 15 slices as follows [2, 8, 8, 8, 53, 2, 48, 22, 22, 10, 31, 31, 11, 11, 0]. 20 percent of accesses are in the largest equivalence class. The 65 initializations are split as follows [2, 3, 3, 3, 18, 0, 18, 6, 6, 6, 0, 0, 0, 0, 0]. The 63 writes are split as follows [0, 2, 2, 2, 20, 2, 15, 7, 7, 2, 1, 1, 1, 1, 0]. [2025-03-16 19:42:15,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:42:15,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:42:15,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:42:15,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:42:15,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (1/1) ... [2025-03-16 19:42:15,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:15,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:15,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:42:15,702 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-16 19:42:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:42:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 19:42:15,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:42:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:42:15,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:42:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:42:15,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:15,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:42:15,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:42:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:42:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:42:15,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:42:15,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:42:15,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:42:16,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:16,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:16,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:16,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:16,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:16,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:16,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:16,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:16,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:20,648 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-16 19:42:20,648 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:42:20,659 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:42:20,660 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:42:20,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:20 BoogieIcfgContainer [2025-03-16 19:42:20,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:42:20,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:42:20,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:42:20,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:42:20,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:42:15" (1/3) ... [2025-03-16 19:42:20,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef50078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:20, skipping insertion in model container [2025-03-16 19:42:20,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:15" (2/3) ... [2025-03-16 19:42:20,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef50078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:20, skipping insertion in model container [2025-03-16 19:42:20,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:20" (3/3) ... [2025-03-16 19:42:20,667 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib-2.i [2025-03-16 19:42:20,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:42:20,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib-2.i that has 6 procedures, 175 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 19:42:20,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:42:20,730 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;@365fcbca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:42:20,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:42:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 103 states have internal predecessors, (135), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 19:42:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 19:42:20,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:20,749 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:20,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:20,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:20,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1024929184, now seen corresponding path program 1 times [2025-03-16 19:42:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966960736] [2025-03-16 19:42:20,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:21,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 19:42:21,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 19:42:21,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:21,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966960736] [2025-03-16 19:42:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966960736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:21,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550325506] [2025-03-16 19:42:21,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:21,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:21,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:21,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:21,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:21,597 INFO L87 Difference]: Start difference. First operand has 175 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 103 states have internal predecessors, (135), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:25,636 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-16 19:42:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:25,708 INFO L93 Difference]: Finished difference Result 349 states and 597 transitions. [2025-03-16 19:42:25,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:25,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 252 [2025-03-16 19:42:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:25,716 INFO L225 Difference]: With dead ends: 349 [2025-03-16 19:42:25,719 INFO L226 Difference]: Without dead ends: 174 [2025-03-16 19:42:25,722 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-16 19:42:25,727 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 2 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:25,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 521 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 19:42:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-16 19:42:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2025-03-16 19:42:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 101 states have (on average 1.306930693069307) internal successors, (132), 102 states have internal predecessors, (132), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 19:42:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2025-03-16 19:42:25,768 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 252 [2025-03-16 19:42:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:25,769 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2025-03-16 19:42:25,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2025-03-16 19:42:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 19:42:25,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:25,776 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:25,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:42:25,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:25,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1916910938, now seen corresponding path program 1 times [2025-03-16 19:42:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:25,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170972569] [2025-03-16 19:42:25,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:25,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 19:42:26,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 19:42:26,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:26,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170972569] [2025-03-16 19:42:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170972569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122261543] [2025-03-16 19:42:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:26,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:26,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:26,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:26,227 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:26,282 INFO L93 Difference]: Finished difference Result 345 states and 526 transitions. [2025-03-16 19:42:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:26,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 254 [2025-03-16 19:42:26,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:26,285 INFO L225 Difference]: With dead ends: 345 [2025-03-16 19:42:26,287 INFO L226 Difference]: Without dead ends: 174 [2025-03-16 19:42:26,288 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-16 19:42:26,289 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 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-16 19:42:26,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-16 19:42:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-16 19:42:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 102 states have (on average 1.303921568627451) internal successors, (133), 103 states have internal predecessors, (133), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 19:42:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 264 transitions. [2025-03-16 19:42:26,301 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 264 transitions. Word has length 254 [2025-03-16 19:42:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:26,301 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 264 transitions. [2025-03-16 19:42:26,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2025-03-16 19:42:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 19:42:26,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:26,304 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:26,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:42:26,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:26,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1545329096, now seen corresponding path program 1 times [2025-03-16 19:42:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:26,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799888460] [2025-03-16 19:42:26,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:26,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 19:42:26,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 19:42:26,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:26,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:26,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:26,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799888460] [2025-03-16 19:42:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799888460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:26,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389888194] [2025-03-16 19:42:26,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:26,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:26,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:26,690 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-16 19:42:26,692 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-16 19:42:27,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 19:42:27,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 19:42:27,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:27,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:27,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:27,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:27,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:27,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389888194] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:27,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:27,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:42:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114719131] [2025-03-16 19:42:27,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:27,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:42:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:27,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:42:27,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:42:27,596 INFO L87 Difference]: Start difference. First operand 174 states and 264 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-16 19:42:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:27,653 INFO L93 Difference]: Finished difference Result 348 states and 530 transitions. [2025-03-16 19:42:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:42:27,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 255 [2025-03-16 19:42:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:27,656 INFO L225 Difference]: With dead ends: 348 [2025-03-16 19:42:27,656 INFO L226 Difference]: Without dead ends: 176 [2025-03-16 19:42:27,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 507 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-16 19:42:27,659 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 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-16 19:42:27,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-16 19:42:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-16 19:42:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 105 states have internal predecessors, (135), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 19:42:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 266 transitions. [2025-03-16 19:42:27,682 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 266 transitions. Word has length 255 [2025-03-16 19:42:27,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:27,682 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 266 transitions. [2025-03-16 19:42:27,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-16 19:42:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 266 transitions. [2025-03-16 19:42:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 19:42:27,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:27,685 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:27,695 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-16 19:42:27,890 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-16 19:42:27,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:27,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1991638008, now seen corresponding path program 2 times [2025-03-16 19:42:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261881884] [2025-03-16 19:42:27,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:27,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:28,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 257 statements into 2 equivalence classes. [2025-03-16 19:42:28,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 257 statements. [2025-03-16 19:42:28,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:28,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2025-03-16 19:42:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261881884] [2025-03-16 19:42:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261881884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:28,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:42:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110691106] [2025-03-16 19:42:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:28,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:42:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:28,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:42:28,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:42:28,420 INFO L87 Difference]: Start difference. First operand 176 states and 266 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:28,583 INFO L93 Difference]: Finished difference Result 349 states and 527 transitions. [2025-03-16 19:42:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:42:28,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2025-03-16 19:42:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:28,589 INFO L225 Difference]: With dead ends: 349 [2025-03-16 19:42:28,589 INFO L226 Difference]: Without dead ends: 347 [2025-03-16 19:42:28,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:28,590 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 175 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:28,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 993 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:42:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-16 19:42:28,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2025-03-16 19:42:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 201 states have (on average 1.2935323383084578) internal successors, (260), 202 states have internal predecessors, (260), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-03-16 19:42:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 523 transitions. [2025-03-16 19:42:28,628 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 523 transitions. Word has length 257 [2025-03-16 19:42:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:28,629 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 523 transitions. [2025-03-16 19:42:28,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 523 transitions. [2025-03-16 19:42:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 19:42:28,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:28,634 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:28,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:42:28,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:28,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:28,635 INFO L85 PathProgramCache]: Analyzing trace with hash -502898437, now seen corresponding path program 1 times [2025-03-16 19:42:28,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:28,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582702917] [2025-03-16 19:42:28,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:28,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 19:42:28,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 19:42:28,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:28,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-03-16 19:42:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:29,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582702917] [2025-03-16 19:42:29,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582702917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:29,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195444319] [2025-03-16 19:42:29,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:29,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:29,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:29,030 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-16 19:42:29,032 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-16 19:42:29,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 19:42:29,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 19:42:29,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:29,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:29,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:29,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2025-03-16 19:42:29,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-03-16 19:42:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195444319] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:29,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 19:42:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594968087] [2025-03-16 19:42:29,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:29,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:42:29,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:29,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:42:29,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:29,839 INFO L87 Difference]: Start difference. First operand 344 states and 523 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-16 19:42:33,900 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-16 19:42:37,911 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-16 19:42:41,945 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-16 19:42:45,964 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-16 19:42:49,988 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-16 19:42:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:50,037 INFO L93 Difference]: Finished difference Result 696 states and 1058 transitions. [2025-03-16 19:42:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:42:50,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 262 [2025-03-16 19:42:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:50,040 INFO L225 Difference]: With dead ends: 696 [2025-03-16 19:42:50,040 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 19:42:50,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:50,042 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 4 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:50,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1030 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-03-16 19:42:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 19:42:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 19:42:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 216 states have (on average 1.287037037037037) internal successors, (278), 217 states have internal predecessors, (278), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-03-16 19:42:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 541 transitions. [2025-03-16 19:42:50,078 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 541 transitions. Word has length 262 [2025-03-16 19:42:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:50,079 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 541 transitions. [2025-03-16 19:42:50,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-16 19:42:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 541 transitions. [2025-03-16 19:42:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 19:42:50,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:50,082 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 12, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:50,092 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-16 19:42:50,282 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-16 19:42:50,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:50,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash 481693899, now seen corresponding path program 2 times [2025-03-16 19:42:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:50,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012323291] [2025-03-16 19:42:50,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:50,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 277 statements into 2 equivalence classes. [2025-03-16 19:42:50,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 277 statements. [2025-03-16 19:42:50,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:50,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3252 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3250 trivial. 0 not checked. [2025-03-16 19:42:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:50,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012323291] [2025-03-16 19:42:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012323291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:50,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526942786] [2025-03-16 19:42:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:50,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:50,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:50,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:50,749 INFO L87 Difference]: Start difference. First operand 359 states and 541 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-16 19:42:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:50,776 INFO L93 Difference]: Finished difference Result 687 states and 1039 transitions. [2025-03-16 19:42:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:50,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 277 [2025-03-16 19:42:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:50,779 INFO L225 Difference]: With dead ends: 687 [2025-03-16 19:42:50,779 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 19:42:50,780 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-16 19:42:50,781 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:50,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 518 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 19:42:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 19:42:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 216 states have (on average 1.2824074074074074) internal successors, (277), 217 states have internal predecessors, (277), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-03-16 19:42:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 540 transitions. [2025-03-16 19:42:50,802 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 540 transitions. Word has length 277 [2025-03-16 19:42:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:50,802 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 540 transitions. [2025-03-16 19:42:50,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-03-16 19:42:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 540 transitions. [2025-03-16 19:42:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-16 19:42:50,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:50,805 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 12, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:50,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:42:50,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:50,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1094214048, now seen corresponding path program 1 times [2025-03-16 19:42:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522891533] [2025-03-16 19:42:50,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:50,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-16 19:42:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-16 19:42:51,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:51,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 3304 trivial. 0 not checked. [2025-03-16 19:42:51,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522891533] [2025-03-16 19:42:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522891533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865715289] [2025-03-16 19:42:51,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:51,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:51,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:51,510 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-16 19:42:51,512 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-16 19:42:51,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-16 19:42:52,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-16 19:42:52,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:52,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:52,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 2032 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:42:52,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2025-03-16 19:42:52,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 3304 trivial. 0 not checked. [2025-03-16 19:42:52,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865715289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:52,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:52,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 9 [2025-03-16 19:42:52,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763688922] [2025-03-16 19:42:52,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:52,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:42:52,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:52,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:42:52,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:42:52,560 INFO L87 Difference]: Start difference. First operand 359 states and 540 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-03-16 19:42:56,627 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-16 19:43:00,653 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-16 19:43:04,685 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-16 19:43:08,700 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-16 19:43:12,715 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-16 19:43:16,749 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-16 19:43:20,766 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-16 19:43:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:20,797 INFO L93 Difference]: Finished difference Result 706 states and 1067 transitions. [2025-03-16 19:43:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:43:20,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 297 [2025-03-16 19:43:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:20,803 INFO L225 Difference]: With dead ends: 706 [2025-03-16 19:43:20,803 INFO L226 Difference]: Without dead ends: 369 [2025-03-16 19:43:20,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 588 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:20,807 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:20,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1026 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2025-03-16 19:43:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-16 19:43:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-16 19:43:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 226 states have (on average 1.2787610619469028) internal successors, (289), 227 states have internal predecessors, (289), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-03-16 19:43:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 552 transitions. [2025-03-16 19:43:20,836 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 552 transitions. Word has length 297 [2025-03-16 19:43:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:20,837 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 552 transitions. [2025-03-16 19:43:20,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-03-16 19:43:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 552 transitions. [2025-03-16 19:43:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-16 19:43:20,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:20,841 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:20,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:43:21,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:21,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:21,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 3309472, now seen corresponding path program 2 times [2025-03-16 19:43:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903503025] [2025-03-16 19:43:21,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:21,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 307 statements into 2 equivalence classes. [2025-03-16 19:43:21,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 19:43:21,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:43:21,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3579 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2025-03-16 19:43:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903503025] [2025-03-16 19:43:22,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903503025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:22,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:22,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:43:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005864286] [2025-03-16 19:43:22,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:22,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:22,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:22,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:22,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:22,599 INFO L87 Difference]: Start difference. First operand 369 states and 552 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-16 19:43:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:23,146 INFO L93 Difference]: Finished difference Result 382 states and 564 transitions. [2025-03-16 19:43:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:23,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 307 [2025-03-16 19:43:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:23,151 INFO L225 Difference]: With dead ends: 382 [2025-03-16 19:43:23,151 INFO L226 Difference]: Without dead ends: 380 [2025-03-16 19:43:23,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:43:23,152 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 299 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:23,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 907 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:43:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-16 19:43:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-03-16 19:43:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 232 states have (on average 1.271551724137931) internal successors, (295), 234 states have internal predecessors, (295), 131 states have call successors, (131), 12 states have call predecessors, (131), 13 states have return successors, (134), 130 states have call predecessors, (134), 129 states have call successors, (134) [2025-03-16 19:43:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 560 transitions. [2025-03-16 19:43:23,188 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 560 transitions. Word has length 307 [2025-03-16 19:43:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:23,188 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 560 transitions. [2025-03-16 19:43:23,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-16 19:43:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 560 transitions. [2025-03-16 19:43:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-16 19:43:23,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:23,193 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:43:23,194 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:23,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -566806911, now seen corresponding path program 1 times [2025-03-16 19:43:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:23,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797919711] [2025-03-16 19:43:23,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:23,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-16 19:43:23,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-16 19:43:23,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:23,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3581 trivial. 0 not checked. [2025-03-16 19:43:24,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:24,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797919711] [2025-03-16 19:43:24,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797919711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:24,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528273142] [2025-03-16 19:43:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:24,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:24,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:24,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:24,120 INFO L87 Difference]: Start difference. First operand 377 states and 560 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-03-16 19:43:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:24,352 INFO L93 Difference]: Finished difference Result 1070 states and 1616 transitions. [2025-03-16 19:43:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:43:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) Word has length 313 [2025-03-16 19:43:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:24,358 INFO L225 Difference]: With dead ends: 1070 [2025-03-16 19:43:24,359 INFO L226 Difference]: Without dead ends: 732 [2025-03-16 19:43:24,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:24,361 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 274 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:24,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1048 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:43:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-16 19:43:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 380. [2025-03-16 19:43:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 234 states have (on average 1.2692307692307692) internal successors, (297), 237 states have internal predecessors, (297), 131 states have call successors, (131), 12 states have call predecessors, (131), 14 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-16 19:43:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 564 transitions. [2025-03-16 19:43:24,399 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 564 transitions. Word has length 313 [2025-03-16 19:43:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:24,399 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 564 transitions. [2025-03-16 19:43:24,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-03-16 19:43:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 564 transitions. [2025-03-16 19:43:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-16 19:43:24,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:24,402 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:24,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:43:24,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:24,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1668697251, now seen corresponding path program 1 times [2025-03-16 19:43:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:24,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068740113] [2025-03-16 19:43:24,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:24,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-16 19:43:24,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-16 19:43:24,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:24,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3581 trivial. 0 not checked. [2025-03-16 19:43:25,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:25,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068740113] [2025-03-16 19:43:25,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068740113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:25,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:25,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:43:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911452668] [2025-03-16 19:43:25,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:25,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:43:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:25,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:43:25,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:25,291 INFO L87 Difference]: Start difference. First operand 380 states and 564 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-03-16 19:43:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:25,823 INFO L93 Difference]: Finished difference Result 389 states and 571 transitions. [2025-03-16 19:43:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) Word has length 312 [2025-03-16 19:43:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:25,826 INFO L225 Difference]: With dead ends: 389 [2025-03-16 19:43:25,826 INFO L226 Difference]: Without dead ends: 387 [2025-03-16 19:43:25,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:25,827 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 394 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:25,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 963 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:43:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-16 19:43:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2025-03-16 19:43:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 240 states have internal predecessors, (300), 131 states have call successors, (131), 13 states have call predecessors, (131), 15 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-16 19:43:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 567 transitions. [2025-03-16 19:43:25,852 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 567 transitions. Word has length 312 [2025-03-16 19:43:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 567 transitions. [2025-03-16 19:43:25,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-03-16 19:43:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 567 transitions. [2025-03-16 19:43:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-16 19:43:25,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:25,857 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:25,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:43:25,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:25,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1754010048, now seen corresponding path program 1 times [2025-03-16 19:43:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:25,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536989213] [2025-03-16 19:43:25,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:26,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-16 19:43:26,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-16 19:43:26,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3595 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3589 trivial. 0 not checked. [2025-03-16 19:43:26,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536989213] [2025-03-16 19:43:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536989213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:43:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362949973] [2025-03-16 19:43:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:43:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:26,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:43:26,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:26,834 INFO L87 Difference]: Start difference. First operand 384 states and 567 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 19:43:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:27,345 INFO L93 Difference]: Finished difference Result 393 states and 574 transitions. [2025-03-16 19:43:27,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:27,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 317 [2025-03-16 19:43:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:27,348 INFO L225 Difference]: With dead ends: 393 [2025-03-16 19:43:27,349 INFO L226 Difference]: Without dead ends: 391 [2025-03-16 19:43:27,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:27,350 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 318 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:27,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1120 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:43:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-16 19:43:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 388. [2025-03-16 19:43:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 240 states have (on average 1.2625) internal successors, (303), 243 states have internal predecessors, (303), 131 states have call successors, (131), 14 states have call predecessors, (131), 16 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-16 19:43:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 570 transitions. [2025-03-16 19:43:27,372 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 570 transitions. Word has length 317 [2025-03-16 19:43:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:27,373 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 570 transitions. [2025-03-16 19:43:27,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 19:43:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 570 transitions. [2025-03-16 19:43:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 19:43:27,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:27,375 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:27,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:43:27,375 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash 517226140, now seen corresponding path program 1 times [2025-03-16 19:43:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:27,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271048188] [2025-03-16 19:43:27,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:27,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 19:43:27,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 19:43:27,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:27,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3609 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3601 trivial. 0 not checked. [2025-03-16 19:43:28,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271048188] [2025-03-16 19:43:28,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271048188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:28,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:28,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:43:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253881285] [2025-03-16 19:43:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:43:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:28,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:43:28,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:28,348 INFO L87 Difference]: Start difference. First operand 388 states and 570 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-16 19:43:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:28,863 INFO L93 Difference]: Finished difference Result 397 states and 577 transitions. [2025-03-16 19:43:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:28,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) Word has length 323 [2025-03-16 19:43:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:28,867 INFO L225 Difference]: With dead ends: 397 [2025-03-16 19:43:28,867 INFO L226 Difference]: Without dead ends: 395 [2025-03-16 19:43:28,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:28,868 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 317 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:28,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1120 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:43:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-16 19:43:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2025-03-16 19:43:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 246 states have internal predecessors, (306), 131 states have call successors, (131), 15 states have call predecessors, (131), 17 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-16 19:43:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2025-03-16 19:43:28,888 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 323 [2025-03-16 19:43:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:28,889 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2025-03-16 19:43:28,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-16 19:43:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2025-03-16 19:43:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-16 19:43:28,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:28,892 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:28,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:43:28,892 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:28,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:28,892 INFO L85 PathProgramCache]: Analyzing trace with hash -574895136, now seen corresponding path program 1 times [2025-03-16 19:43:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325319792] [2025-03-16 19:43:28,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:29,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-16 19:43:29,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-16 19:43:29,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:29,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3627 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3617 trivial. 0 not checked. [2025-03-16 19:43:29,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:29,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325319792] [2025-03-16 19:43:29,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325319792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:29,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:29,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:43:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104178168] [2025-03-16 19:43:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:29,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:43:29,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:29,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:43:29,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:29,705 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-16 19:43:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:30,189 INFO L93 Difference]: Finished difference Result 401 states and 580 transitions. [2025-03-16 19:43:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:30,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) Word has length 327 [2025-03-16 19:43:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:30,192 INFO L225 Difference]: With dead ends: 401 [2025-03-16 19:43:30,193 INFO L226 Difference]: Without dead ends: 397 [2025-03-16 19:43:30,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:30,193 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 394 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:30,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 966 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:43:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-16 19:43:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 394. [2025-03-16 19:43:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 245 states have (on average 1.2530612244897958) internal successors, (307), 247 states have internal predecessors, (307), 131 states have call successors, (131), 16 states have call predecessors, (131), 17 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-03-16 19:43:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2025-03-16 19:43:30,229 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 327 [2025-03-16 19:43:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:30,230 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2025-03-16 19:43:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-16 19:43:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2025-03-16 19:43:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-16 19:43:30,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:30,235 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:30,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:43:30,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:30,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1945256516, now seen corresponding path program 1 times [2025-03-16 19:43:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:30,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874493318] [2025-03-16 19:43:30,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:30,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-16 19:43:30,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-16 19:43:30,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:30,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3637 trivial. 0 not checked. [2025-03-16 19:43:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874493318] [2025-03-16 19:43:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874493318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:43:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643343947] [2025-03-16 19:43:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:31,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:31,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:31,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:31,006 INFO L87 Difference]: Start difference. First operand 394 states and 574 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-16 19:43:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:31,373 INFO L93 Difference]: Finished difference Result 397 states and 576 transitions. [2025-03-16 19:43:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:31,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 333 [2025-03-16 19:43:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:31,376 INFO L225 Difference]: With dead ends: 397 [2025-03-16 19:43:31,376 INFO L226 Difference]: Without dead ends: 279 [2025-03-16 19:43:31,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:43:31,377 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 287 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:31,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 928 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:43:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-16 19:43:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 278. [2025-03-16 19:43:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 182 states have (on average 1.3296703296703296) internal successors, (242), 185 states have internal predecessors, (242), 84 states have call successors, (84), 9 states have call predecessors, (84), 11 states have return successors, (88), 83 states have call predecessors, (88), 83 states have call successors, (88) [2025-03-16 19:43:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 414 transitions. [2025-03-16 19:43:31,392 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 414 transitions. Word has length 333 [2025-03-16 19:43:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:31,392 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 414 transitions. [2025-03-16 19:43:31,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-16 19:43:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 414 transitions. [2025-03-16 19:43:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-16 19:43:31,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:31,395 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:43:31,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:43:31,395 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash 818523412, now seen corresponding path program 1 times [2025-03-16 19:43:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385984756] [2025-03-16 19:43:31,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:31,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-16 19:43:31,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-16 19:43:31,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:31,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4316 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4313 trivial. 0 not checked. [2025-03-16 19:43:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385984756] [2025-03-16 19:43:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385984756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458333198] [2025-03-16 19:43:32,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:32,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:32,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:32,230 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-16 19:43:32,232 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-16 19:43:32,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-16 19:43:33,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-16 19:43:33,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:33,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:33,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 2694 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:43:33,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:33,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-16 19:43:33,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-16 19:43:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4316 backedges. 800 proven. 5 refuted. 0 times theorem prover too weak. 3511 trivial. 0 not checked. [2025-03-16 19:43:33,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4316 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4311 trivial. 0 not checked. [2025-03-16 19:43:33,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458333198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:33,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:33,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-03-16 19:43:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111892245] [2025-03-16 19:43:33,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:33,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:43:33,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:33,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:43:33,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:43:33,732 INFO L87 Difference]: Start difference. First operand 278 states and 414 transitions. Second operand has 12 states, 9 states have (on average 15.666666666666666) internal successors, (141), 12 states have internal predecessors, (141), 11 states have call successors, (103), 4 states have call predecessors, (103), 6 states have return successors, (102), 8 states have call predecessors, (102), 11 states have call successors, (102) [2025-03-16 19:43:37,763 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-16 19:43:41,787 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-16 19:43:45,795 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 []