./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c3ec7c03a28dc415c6db5fadbfd8dcd491b1a493cd1bf88ef12d02131cd13437 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:24:38,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:24:38,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:24:38,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:24:38,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:24:38,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:24:38,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:24:38,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:24:38,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:24:38,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:24:38,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:24:38,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:24:38,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:24:38,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:24:38,581 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:24:38,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:24:38,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:24:38,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:24:38,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:24:38,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:24:38,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:24:38,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:24:38,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:24:38,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:24:38,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:24:38,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:24:38,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:24:38,584 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-jdk21/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 -> c3ec7c03a28dc415c6db5fadbfd8dcd491b1a493cd1bf88ef12d02131cd13437 [2025-02-05 16:24:38,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:24:38,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:24:38,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:24:38,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:24:38,828 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:24:38,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c [2025-02-05 16:24:40,819 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/721f84ecc/684cf50094da4fb59dc7beb80a315a30/FLAGce178b222 [2025-02-05 16:24:41,283 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:24:41,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c [2025-02-05 16:24:41,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/721f84ecc/684cf50094da4fb59dc7beb80a315a30/FLAGce178b222 [2025-02-05 16:24:41,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/721f84ecc/684cf50094da4fb59dc7beb80a315a30 [2025-02-05 16:24:41,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:24:41,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:24:41,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:24:41,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:24:41,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:24:41,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:24:41" (1/1) ... [2025-02-05 16:24:41,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4873cad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:41, skipping insertion in model container [2025-02-05 16:24:41,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:24:41" (1/1) ... [2025-02-05 16:24:41,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:24:41,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c[1868,1881] [2025-02-05 16:24:42,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:24:42,031 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:24:42,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.ok1.i","-S") [42] [2025-02-05 16:24:42,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c[1868,1881] [2025-02-05 16:24:42,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:24:42,293 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:24:42,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42 WrapperNode [2025-02-05 16:24:42,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:24:42,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:24:42,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:24:42,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:24:42,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,531 INFO L138 Inliner]: procedures = 99, calls = 2727, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8497 [2025-02-05 16:24:42,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:24:42,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:24:42,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:24:42,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:24:42,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,652 INFO L175 MemorySlicer]: Split 2332 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46]. 4 percent of accesses are in the largest equivalence class. The 338 initializations are split as follows [2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]. The 402 writes are split as follows [0, 7, 7, 7, 7, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6]. [2025-02-05 16:24:42,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:24:42,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:24:42,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:24:42,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:24:42,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (1/1) ... [2025-02-05 16:24:42,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:24:42,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:24:42,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:24:42,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:24:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-02-05 16:24:42,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-02-05 16:24:42,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-05 16:24:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-02-05 16:24:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-02-05 16:24:42,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-05 16:24:42,944 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-02-05 16:24:42,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-02-05 16:24:42,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-02-05 16:24:42,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-02-05 16:24:42,944 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-02-05 16:24:42,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-02-05 16:24:42,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:24:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-02-05 16:24:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-02-05 16:24:42,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-02-05 16:24:42,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-02-05 16:24:42,946 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-05 16:24:42,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-05 16:24:42,946 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-02-05 16:24:42,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-02-05 16:24:42,946 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-02-05 16:24:42,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-02-05 16:24:42,946 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-02-05 16:24:42,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-02-05 16:24:42,946 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-02-05 16:24:42,946 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-02-05 16:24:42,950 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-02-05 16:24:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-02-05 16:24:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-02-05 16:24:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:24:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-02-05 16:24:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-02-05 16:24:42,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-02-05 16:24:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:24:42,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:24:43,682 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:24:43,688 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:24:52,847 INFO L? ?]: Removed 947 outVars from TransFormulas that were not future-live. [2025-02-05 16:24:52,847 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:24:52,899 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:24:52,900 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:24:52,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:24:52 BoogieIcfgContainer [2025-02-05 16:24:52,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:24:52,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:24:52,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:24:52,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:24:52,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:24:41" (1/3) ... [2025-02-05 16:24:52,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b3c71b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:24:52, skipping insertion in model container [2025-02-05 16:24:52,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:24:42" (2/3) ... [2025-02-05 16:24:52,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b3c71b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:24:52, skipping insertion in model container [2025-02-05 16:24:52,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:24:52" (3/3) ... [2025-02-05 16:24:52,908 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.1.c [2025-02-05 16:24:52,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:24:52,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.1.c that has 45 procedures, 2464 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:24:53,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:24:53,018 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;@211bce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:24:53,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:24:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 2464 states, 2113 states have (on average 1.480832938949361) internal successors, (3129), 2137 states have internal predecessors, (3129), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) [2025-02-05 16:24:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:24:53,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:24:53,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:24:53,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:24:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:24:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1014247921, now seen corresponding path program 1 times [2025-02-05 16:24:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:24:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684219876] [2025-02-05 16:24:53,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:24:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:24:53,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:24:53,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:24:53,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:24:53,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:24:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:24:53,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:24:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684219876] [2025-02-05 16:24:53,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684219876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:24:53,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:24:53,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:24:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388119240] [2025-02-05 16:24:53,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:24:53,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:24:53,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:24:53,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:24:53,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:24:53,967 INFO L87 Difference]: Start difference. First operand has 2464 states, 2113 states have (on average 1.480832938949361) internal successors, (3129), 2137 states have internal predecessors, (3129), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 16:24:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:24:54,170 INFO L93 Difference]: Finished difference Result 4919 states and 7725 transitions. [2025-02-05 16:24:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:24:54,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-02-05 16:24:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:24:54,204 INFO L225 Difference]: With dead ends: 4919 [2025-02-05 16:24:54,204 INFO L226 Difference]: Without dead ends: 2451 [2025-02-05 16:24:54,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:24:54,232 INFO L435 NwaCegarLoop]: 3043 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:24:54,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:24:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-02-05 16:24:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2451. [2025-02-05 16:24:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2101 states have (on average 1.15421227986673) internal successors, (2425), 2125 states have internal predecessors, (2425), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (304), 294 states have call predecessors, (304), 304 states have call successors, (304) [2025-02-05 16:24:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3034 transitions. [2025-02-05 16:24:54,375 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3034 transitions. Word has length 148 [2025-02-05 16:24:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:24:54,376 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 3034 transitions. [2025-02-05 16:24:54,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 16:24:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3034 transitions. [2025-02-05 16:24:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 16:24:54,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:24:54,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:24:54,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:24:54,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:24:54,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:24:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash -658867522, now seen corresponding path program 1 times [2025-02-05 16:24:54,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:24:54,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108154949] [2025-02-05 16:24:54,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:24:54,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:24:54,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 16:24:54,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 16:24:54,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:24:54,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:24:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 16:24:55,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:24:55,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108154949] [2025-02-05 16:24:55,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108154949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:24:55,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:24:55,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:24:55,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351291140] [2025-02-05 16:24:55,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:24:55,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:24:55,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:24:55,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:24:55,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:24:55,958 INFO L87 Difference]: Start difference. First operand 2451 states and 3034 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:24:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:24:58,808 INFO L93 Difference]: Finished difference Result 5556 states and 6977 transitions. [2025-02-05 16:24:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:24:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-02-05 16:24:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:24:58,826 INFO L225 Difference]: With dead ends: 5556 [2025-02-05 16:24:58,827 INFO L226 Difference]: Without dead ends: 3110 [2025-02-05 16:24:58,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:24:58,843 INFO L435 NwaCegarLoop]: 3648 mSDtfsCounter, 5820 mSDsluCounter, 4602 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5820 SdHoareTripleChecker+Valid, 8250 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:24:58,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5820 Valid, 8250 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 16:24:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2025-02-05 16:24:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2974. [2025-02-05 16:24:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2476 states have (on average 1.186995153473344) internal successors, (2939), 2506 states have internal predecessors, (2939), 420 states have call successors, (420), 77 states have call predecessors, (420), 77 states have return successors, (419), 405 states have call predecessors, (419), 419 states have call successors, (419) [2025-02-05 16:24:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 3778 transitions. [2025-02-05 16:24:58,985 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 3778 transitions. Word has length 208 [2025-02-05 16:24:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:24:58,987 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 3778 transitions. [2025-02-05 16:24:58,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:24:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3778 transitions. [2025-02-05 16:24:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 16:24:58,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:24:58,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:24:58,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:24:58,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:24:58,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:24:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash 183596080, now seen corresponding path program 1 times [2025-02-05 16:24:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:24:58,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954652062] [2025-02-05 16:24:58,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:24:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:24:59,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 16:24:59,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 16:24:59,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:24:59,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:25:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:00,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954652062] [2025-02-05 16:25:00,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954652062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:00,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:00,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:00,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049366178] [2025-02-05 16:25:00,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:00,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:00,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:00,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:00,965 INFO L87 Difference]: Start difference. First operand 2974 states and 3778 transitions. Second operand has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 16:25:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:03,181 INFO L93 Difference]: Finished difference Result 6329 states and 8111 transitions. [2025-02-05 16:25:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:03,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 205 [2025-02-05 16:25:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:03,203 INFO L225 Difference]: With dead ends: 6329 [2025-02-05 16:25:03,203 INFO L226 Difference]: Without dead ends: 3360 [2025-02-05 16:25:03,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:03,218 INFO L435 NwaCegarLoop]: 3423 mSDtfsCounter, 3669 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3669 SdHoareTripleChecker+Valid, 6772 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:03,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3669 Valid, 6772 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 16:25:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2025-02-05 16:25:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2025-02-05 16:25:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 2758 states have (on average 1.207396664249456) internal successors, (3330), 2797 states have internal predecessors, (3330), 501 states have call successors, (501), 98 states have call predecessors, (501), 98 states have return successors, (500), 482 states have call predecessors, (500), 500 states have call successors, (500) [2025-02-05 16:25:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4331 transitions. [2025-02-05 16:25:03,322 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4331 transitions. Word has length 205 [2025-02-05 16:25:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:03,323 INFO L471 AbstractCegarLoop]: Abstraction has 3358 states and 4331 transitions. [2025-02-05 16:25:03,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 16:25:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4331 transitions. [2025-02-05 16:25:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 16:25:03,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:03,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:03,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:25:03,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:03,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1512674250, now seen corresponding path program 1 times [2025-02-05 16:25:03,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:03,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320737413] [2025-02-05 16:25:03,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:03,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:03,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 16:25:03,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 16:25:03,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:03,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 16:25:04,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320737413] [2025-02-05 16:25:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320737413] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341308631] [2025-02-05 16:25:04,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:04,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:04,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:04,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:25:04,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:25:05,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 16:25:05,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 16:25:05,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:05,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:05,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 16:25:05,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:25:05,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341308631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:05,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:05,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 16:25:05,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539223007] [2025-02-05 16:25:05,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:05,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:05,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:05,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:05,418 INFO L87 Difference]: Start difference. First operand 3358 states and 4331 transitions. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:25:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:07,092 INFO L93 Difference]: Finished difference Result 6913 states and 8902 transitions. [2025-02-05 16:25:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:07,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-02-05 16:25:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:07,112 INFO L225 Difference]: With dead ends: 6913 [2025-02-05 16:25:07,113 INFO L226 Difference]: Without dead ends: 3481 [2025-02-05 16:25:07,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:25:07,126 INFO L435 NwaCegarLoop]: 3597 mSDtfsCounter, 1465 mSDsluCounter, 6332 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 9929 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:07,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 9929 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:25:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2025-02-05 16:25:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 3345. [2025-02-05 16:25:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3345 states, 2750 states have (on average 1.205818181818182) internal successors, (3316), 2789 states have internal predecessors, (3316), 496 states have call successors, (496), 98 states have call predecessors, (496), 98 states have return successors, (495), 477 states have call predecessors, (495), 495 states have call successors, (495) [2025-02-05 16:25:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 4307 transitions. [2025-02-05 16:25:07,213 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 4307 transitions. Word has length 208 [2025-02-05 16:25:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:07,213 INFO L471 AbstractCegarLoop]: Abstraction has 3345 states and 4307 transitions. [2025-02-05 16:25:07,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:25:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 4307 transitions. [2025-02-05 16:25:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 16:25:07,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:07,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:07,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:25:07,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:07,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:07,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1824815452, now seen corresponding path program 1 times [2025-02-05 16:25:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219499104] [2025-02-05 16:25:07,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:07,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 16:25:07,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 16:25:07,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:07,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:25:08,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:08,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219499104] [2025-02-05 16:25:08,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219499104] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:08,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326646711] [2025-02-05 16:25:08,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:08,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:08,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:08,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:25:08,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:25:09,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 16:25:09,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 16:25:09,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:09,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:09,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:09,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:25:09,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:09,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326646711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:09,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:09,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 16:25:09,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408987736] [2025-02-05 16:25:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:09,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:09,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:09,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:09,366 INFO L87 Difference]: Start difference. First operand 3345 states and 4307 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:25:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:11,155 INFO L93 Difference]: Finished difference Result 8566 states and 11043 transitions. [2025-02-05 16:25:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:11,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-02-05 16:25:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:11,186 INFO L225 Difference]: With dead ends: 8566 [2025-02-05 16:25:11,186 INFO L226 Difference]: Without dead ends: 5226 [2025-02-05 16:25:11,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:25:11,199 INFO L435 NwaCegarLoop]: 4436 mSDtfsCounter, 2389 mSDsluCounter, 10020 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 14456 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:11,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 14456 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:25:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2025-02-05 16:25:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4759. [2025-02-05 16:25:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 3852 states have (on average 1.2258566978193146) internal successors, (4722), 3912 states have internal predecessors, (4722), 753 states have call successors, (753), 151 states have call predecessors, (753), 153 states have return successors, (756), 727 states have call predecessors, (756), 752 states have call successors, (756) [2025-02-05 16:25:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6231 transitions. [2025-02-05 16:25:11,364 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6231 transitions. Word has length 209 [2025-02-05 16:25:11,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:11,365 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6231 transitions. [2025-02-05 16:25:11,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:25:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6231 transitions. [2025-02-05 16:25:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 16:25:11,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:11,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:11,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:25:11,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:11,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:11,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1838476523, now seen corresponding path program 1 times [2025-02-05 16:25:11,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:11,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607572968] [2025-02-05 16:25:11,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:11,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 16:25:11,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 16:25:11,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:11,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 16:25:12,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:12,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607572968] [2025-02-05 16:25:12,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607572968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:12,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110642352] [2025-02-05 16:25:12,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:12,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:12,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:12,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:25:12,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:25:13,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 16:25:13,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 16:25:13,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:13,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:13,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 2850 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:13,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:25:13,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:13,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110642352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:13,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:13,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 16:25:13,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558818402] [2025-02-05 16:25:13,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:13,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:13,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:13,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:13,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:13,647 INFO L87 Difference]: Start difference. First operand 4759 states and 6231 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:25:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:14,953 INFO L93 Difference]: Finished difference Result 10675 states and 14009 transitions. [2025-02-05 16:25:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-02-05 16:25:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:14,985 INFO L225 Difference]: With dead ends: 10675 [2025-02-05 16:25:14,986 INFO L226 Difference]: Without dead ends: 5921 [2025-02-05 16:25:15,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:25:15,002 INFO L435 NwaCegarLoop]: 3911 mSDtfsCounter, 1754 mSDsluCounter, 6974 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 10885 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:15,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 10885 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:25:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5921 states. [2025-02-05 16:25:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5921 to 5267. [2025-02-05 16:25:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 4138 states have (on average 1.263412276462059) internal successors, (5228), 4216 states have internal predecessors, (5228), 933 states have call successors, (933), 192 states have call predecessors, (933), 195 states have return successors, (935), 900 states have call predecessors, (935), 932 states have call successors, (935) [2025-02-05 16:25:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 7096 transitions. [2025-02-05 16:25:15,241 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 7096 transitions. Word has length 210 [2025-02-05 16:25:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:15,241 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 7096 transitions. [2025-02-05 16:25:15,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:25:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 7096 transitions. [2025-02-05 16:25:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 16:25:15,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:15,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:15,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:25:15,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:15,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:15,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash -318429103, now seen corresponding path program 1 times [2025-02-05 16:25:15,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:15,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533312136] [2025-02-05 16:25:15,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:15,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:15,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 16:25:15,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 16:25:15,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:15,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:25:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533312136] [2025-02-05 16:25:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533312136] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080931068] [2025-02-05 16:25:16,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:16,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:16,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:16,125 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:25:16,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:25:16,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 16:25:17,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 16:25:17,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:17,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:17,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:17,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 16:25:17,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:17,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080931068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:17,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 16:25:17,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878981564] [2025-02-05 16:25:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:17,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:17,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:17,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:17,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:17,330 INFO L87 Difference]: Start difference. First operand 5267 states and 7096 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:25:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:18,416 INFO L93 Difference]: Finished difference Result 10531 states and 14194 transitions. [2025-02-05 16:25:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:18,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-02-05 16:25:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:18,453 INFO L225 Difference]: With dead ends: 10531 [2025-02-05 16:25:18,453 INFO L226 Difference]: Without dead ends: 5269 [2025-02-05 16:25:18,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:25:18,472 INFO L435 NwaCegarLoop]: 2946 mSDtfsCounter, 1047 mSDsluCounter, 5754 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 8700 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:18,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 8700 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:25:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2025-02-05 16:25:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5267. [2025-02-05 16:25:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 4138 states have (on average 1.263170613823103) internal successors, (5227), 4216 states have internal predecessors, (5227), 933 states have call successors, (933), 192 states have call predecessors, (933), 195 states have return successors, (935), 900 states have call predecessors, (935), 932 states have call successors, (935) [2025-02-05 16:25:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 7095 transitions. [2025-02-05 16:25:18,627 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 7095 transitions. Word has length 210 [2025-02-05 16:25:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:18,627 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 7095 transitions. [2025-02-05 16:25:18,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:25:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 7095 transitions. [2025-02-05 16:25:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 16:25:18,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:18,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:18,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 16:25:18,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-05 16:25:18,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:18,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2095904412, now seen corresponding path program 1 times [2025-02-05 16:25:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:18,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774320661] [2025-02-05 16:25:18,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:19,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 16:25:19,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 16:25:19,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:19,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 16:25:19,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:19,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774320661] [2025-02-05 16:25:19,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774320661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:19,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:19,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:19,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019498366] [2025-02-05 16:25:19,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:19,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:19,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:19,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:19,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:19,577 INFO L87 Difference]: Start difference. First operand 5267 states and 7095 transitions. Second operand has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:21,935 INFO L93 Difference]: Finished difference Result 9577 states and 12754 transitions. [2025-02-05 16:25:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:21,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 217 [2025-02-05 16:25:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:21,954 INFO L225 Difference]: With dead ends: 9577 [2025-02-05 16:25:21,954 INFO L226 Difference]: Without dead ends: 4315 [2025-02-05 16:25:21,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:21,968 INFO L435 NwaCegarLoop]: 3511 mSDtfsCounter, 5752 mSDsluCounter, 4577 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5752 SdHoareTripleChecker+Valid, 8088 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:21,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5752 Valid, 8088 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 16:25:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2025-02-05 16:25:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 4177. [2025-02-05 16:25:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 3358 states have (on average 1.2355568790946991) internal successors, (4149), 3414 states have internal predecessors, (4149), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676) [2025-02-05 16:25:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 5501 transitions. [2025-02-05 16:25:22,086 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 5501 transitions. Word has length 217 [2025-02-05 16:25:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:22,087 INFO L471 AbstractCegarLoop]: Abstraction has 4177 states and 5501 transitions. [2025-02-05 16:25:22,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 5501 transitions. [2025-02-05 16:25:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 16:25:22,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:22,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:22,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:25:22,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:22,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1470183595, now seen corresponding path program 1 times [2025-02-05 16:25:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164323362] [2025-02-05 16:25:22,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:22,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 16:25:22,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 16:25:22,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:22,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:25:22,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164323362] [2025-02-05 16:25:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164323362] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949777627] [2025-02-05 16:25:22,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:22,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:22,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:25:22,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:25:23,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 16:25:23,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 16:25:23,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:23,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:23,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 2874 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:23,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:25:23,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949777627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:23,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-02-05 16:25:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390942836] [2025-02-05 16:25:23,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:23,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:23,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:23,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:23,935 INFO L87 Difference]: Start difference. First operand 4177 states and 5501 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:25,094 INFO L93 Difference]: Finished difference Result 8481 states and 11153 transitions. [2025-02-05 16:25:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:25,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 218 [2025-02-05 16:25:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:25,111 INFO L225 Difference]: With dead ends: 8481 [2025-02-05 16:25:25,111 INFO L226 Difference]: Without dead ends: 4309 [2025-02-05 16:25:25,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:25,124 INFO L435 NwaCegarLoop]: 2932 mSDtfsCounter, 4556 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4556 SdHoareTripleChecker+Valid, 6381 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:25,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4556 Valid, 6381 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:25:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2025-02-05 16:25:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4171. [2025-02-05 16:25:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 3355 states have (on average 1.2348733233979137) internal successors, (4143), 3411 states have internal predecessors, (4143), 673 states have call successors, (673), 141 states have call predecessors, (673), 142 states have return successors, (673), 648 states have call predecessors, (673), 672 states have call successors, (673) [2025-02-05 16:25:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 5489 transitions. [2025-02-05 16:25:25,232 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 5489 transitions. Word has length 218 [2025-02-05 16:25:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:25,232 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 5489 transitions. [2025-02-05 16:25:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5489 transitions. [2025-02-05 16:25:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 16:25:25,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:25,238 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:25,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 16:25:25,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:25,443 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:25,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1221623307, now seen corresponding path program 1 times [2025-02-05 16:25:25,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:25,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520358439] [2025-02-05 16:25:25,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:25,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:25,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:25:25,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:25:25,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:25,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 16:25:26,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:26,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520358439] [2025-02-05 16:25:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520358439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982747999] [2025-02-05 16:25:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:26,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:26,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:26,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:26,295 INFO L87 Difference]: Start difference. First operand 4171 states and 5489 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:28,601 INFO L93 Difference]: Finished difference Result 7857 states and 10278 transitions. [2025-02-05 16:25:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-02-05 16:25:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:28,638 INFO L225 Difference]: With dead ends: 7857 [2025-02-05 16:25:28,638 INFO L226 Difference]: Without dead ends: 3691 [2025-02-05 16:25:28,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:28,664 INFO L435 NwaCegarLoop]: 3489 mSDtfsCounter, 5730 mSDsluCounter, 4471 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5730 SdHoareTripleChecker+Valid, 7960 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:28,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5730 Valid, 7960 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 16:25:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2025-02-05 16:25:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3689. [2025-02-05 16:25:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3689 states, 3008 states have (on average 1.2180851063829787) internal successors, (3664), 3053 states have internal predecessors, (3664), 562 states have call successors, (562), 118 states have call predecessors, (562), 118 states have return successors, (561), 541 states have call predecessors, (561), 561 states have call successors, (561) [2025-02-05 16:25:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 4787 transitions. [2025-02-05 16:25:28,803 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 4787 transitions. Word has length 220 [2025-02-05 16:25:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:28,803 INFO L471 AbstractCegarLoop]: Abstraction has 3689 states and 4787 transitions. [2025-02-05 16:25:28,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 4787 transitions. [2025-02-05 16:25:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 16:25:28,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:28,808 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:28,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:25:28,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:28,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:28,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1047708623, now seen corresponding path program 1 times [2025-02-05 16:25:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:28,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041371902] [2025-02-05 16:25:28,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:29,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:25:29,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:25:29,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:29,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:25:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041371902] [2025-02-05 16:25:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041371902] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223309655] [2025-02-05 16:25:30,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:30,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:30,092 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:25:30,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:25:30,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:25:31,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:25:31,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:31,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:31,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 2876 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:31,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:25:31,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223309655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:31,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:31,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-02-05 16:25:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151068596] [2025-02-05 16:25:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:31,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:31,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:31,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:31,409 INFO L87 Difference]: Start difference. First operand 3689 states and 4787 transitions. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:32,957 INFO L93 Difference]: Finished difference Result 7373 states and 9573 transitions. [2025-02-05 16:25:32,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:32,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-02-05 16:25:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:33,069 INFO L225 Difference]: With dead ends: 7373 [2025-02-05 16:25:33,069 INFO L226 Difference]: Without dead ends: 3689 [2025-02-05 16:25:33,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:33,122 INFO L435 NwaCegarLoop]: 3063 mSDtfsCounter, 4472 mSDsluCounter, 2944 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4472 SdHoareTripleChecker+Valid, 6007 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:33,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4472 Valid, 6007 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:25:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-02-05 16:25:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3687. [2025-02-05 16:25:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3007 states have (on average 1.2178250748254074) internal successors, (3662), 3052 states have internal predecessors, (3662), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-02-05 16:25:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 4783 transitions. [2025-02-05 16:25:33,224 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 4783 transitions. Word has length 220 [2025-02-05 16:25:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:33,225 INFO L471 AbstractCegarLoop]: Abstraction has 3687 states and 4783 transitions. [2025-02-05 16:25:33,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4783 transitions. [2025-02-05 16:25:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 16:25:33,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:33,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:33,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:25:33,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 16:25:33,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:33,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1687520507, now seen corresponding path program 1 times [2025-02-05 16:25:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:33,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822649830] [2025-02-05 16:25:33,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:33,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:25:33,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:25:33,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:33,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:25:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822649830] [2025-02-05 16:25:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822649830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:34,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:34,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798503187] [2025-02-05 16:25:34,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:34,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:34,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:34,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:34,077 INFO L87 Difference]: Start difference. First operand 3687 states and 4783 transitions. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:35,890 INFO L93 Difference]: Finished difference Result 7371 states and 9567 transitions. [2025-02-05 16:25:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-02-05 16:25:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:35,907 INFO L225 Difference]: With dead ends: 7371 [2025-02-05 16:25:35,907 INFO L226 Difference]: Without dead ends: 3689 [2025-02-05 16:25:35,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:35,923 INFO L435 NwaCegarLoop]: 3391 mSDtfsCounter, 6462 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6462 SdHoareTripleChecker+Valid, 5977 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:35,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6462 Valid, 5977 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:25:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-02-05 16:25:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3687. [2025-02-05 16:25:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3007 states have (on average 1.2174925174592617) internal successors, (3661), 3052 states have internal predecessors, (3661), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-02-05 16:25:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 4782 transitions. [2025-02-05 16:25:36,026 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 4782 transitions. Word has length 220 [2025-02-05 16:25:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:36,026 INFO L471 AbstractCegarLoop]: Abstraction has 3687 states and 4782 transitions. [2025-02-05 16:25:36,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 16:25:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4782 transitions. [2025-02-05 16:25:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 16:25:36,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:36,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:36,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:25:36,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:36,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1511329187, now seen corresponding path program 1 times [2025-02-05 16:25:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492101110] [2025-02-05 16:25:36,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:36,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 16:25:36,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 16:25:36,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:36,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:25:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492101110] [2025-02-05 16:25:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492101110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:36,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466522213] [2025-02-05 16:25:36,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:36,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:36,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:36,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:36,878 INFO L87 Difference]: Start difference. First operand 3687 states and 4782 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 16:25:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:39,292 INFO L93 Difference]: Finished difference Result 7503 states and 9713 transitions. [2025-02-05 16:25:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:39,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 223 [2025-02-05 16:25:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:39,311 INFO L225 Difference]: With dead ends: 7503 [2025-02-05 16:25:39,311 INFO L226 Difference]: Without dead ends: 3821 [2025-02-05 16:25:39,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:39,330 INFO L435 NwaCegarLoop]: 3624 mSDtfsCounter, 4979 mSDsluCounter, 3766 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4979 SdHoareTripleChecker+Valid, 7390 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:39,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4979 Valid, 7390 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 16:25:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2025-02-05 16:25:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3685. [2025-02-05 16:25:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 3006 states have (on average 1.2172322022621425) internal successors, (3659), 3051 states have internal predecessors, (3659), 560 states have call successors, (560), 118 states have call predecessors, (560), 118 states have return successors, (559), 539 states have call predecessors, (559), 559 states have call successors, (559) [2025-02-05 16:25:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4778 transitions. [2025-02-05 16:25:39,633 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4778 transitions. Word has length 223 [2025-02-05 16:25:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:39,634 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4778 transitions. [2025-02-05 16:25:39,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 16:25:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4778 transitions. [2025-02-05 16:25:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 16:25:39,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:39,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:39,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:25:39,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:39,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 302123942, now seen corresponding path program 1 times [2025-02-05 16:25:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734190155] [2025-02-05 16:25:39,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:40,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 16:25:40,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 16:25:40,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:40,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:25:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734190155] [2025-02-05 16:25:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734190155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:40,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930840182] [2025-02-05 16:25:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:40,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:40,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:40,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:40,847 INFO L87 Difference]: Start difference. First operand 3685 states and 4778 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 16:25:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:42,537 INFO L93 Difference]: Finished difference Result 7499 states and 9705 transitions. [2025-02-05 16:25:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 224 [2025-02-05 16:25:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:42,553 INFO L225 Difference]: With dead ends: 7499 [2025-02-05 16:25:42,554 INFO L226 Difference]: Without dead ends: 3819 [2025-02-05 16:25:42,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:42,565 INFO L435 NwaCegarLoop]: 3502 mSDtfsCounter, 4675 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4675 SdHoareTripleChecker+Valid, 7090 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:42,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4675 Valid, 7090 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:25:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3819 states. [2025-02-05 16:25:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3819 to 3681. [2025-02-05 16:25:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3004 states have (on average 1.216711051930759) internal successors, (3655), 3049 states have internal predecessors, (3655), 558 states have call successors, (558), 118 states have call predecessors, (558), 118 states have return successors, (557), 537 states have call predecessors, (557), 557 states have call successors, (557) [2025-02-05 16:25:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4770 transitions. [2025-02-05 16:25:42,669 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4770 transitions. Word has length 224 [2025-02-05 16:25:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:42,670 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4770 transitions. [2025-02-05 16:25:42,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 16:25:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4770 transitions. [2025-02-05 16:25:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 16:25:42,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:42,673 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:42,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:25:42,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:42,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:42,674 INFO L85 PathProgramCache]: Analyzing trace with hash -369574871, now seen corresponding path program 1 times [2025-02-05 16:25:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:42,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414689456] [2025-02-05 16:25:42,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:42,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 16:25:42,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 16:25:42,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:42,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 16:25:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414689456] [2025-02-05 16:25:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414689456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071922346] [2025-02-05 16:25:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:43,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:43,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:43,352 INFO L87 Difference]: Start difference. First operand 3681 states and 4770 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 16:25:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:44,907 INFO L93 Difference]: Finished difference Result 7359 states and 9541 transitions. [2025-02-05 16:25:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:44,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 225 [2025-02-05 16:25:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:44,926 INFO L225 Difference]: With dead ends: 7359 [2025-02-05 16:25:44,926 INFO L226 Difference]: Without dead ends: 3683 [2025-02-05 16:25:44,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:44,939 INFO L435 NwaCegarLoop]: 3378 mSDtfsCounter, 4408 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4408 SdHoareTripleChecker+Valid, 6681 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:44,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4408 Valid, 6681 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:25:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2025-02-05 16:25:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3681. [2025-02-05 16:25:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3004 states have (on average 1.2163781624500665) internal successors, (3654), 3049 states have internal predecessors, (3654), 558 states have call successors, (558), 118 states have call predecessors, (558), 118 states have return successors, (557), 537 states have call predecessors, (557), 557 states have call successors, (557) [2025-02-05 16:25:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4769 transitions. [2025-02-05 16:25:45,048 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4769 transitions. Word has length 225 [2025-02-05 16:25:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:45,048 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4769 transitions. [2025-02-05 16:25:45,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 16:25:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4769 transitions. [2025-02-05 16:25:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 16:25:45,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:45,051 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:45,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:25:45,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:45,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash -340874455, now seen corresponding path program 1 times [2025-02-05 16:25:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722205631] [2025-02-05 16:25:45,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:45,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 16:25:45,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 16:25:45,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:45,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 16:25:45,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:45,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722205631] [2025-02-05 16:25:45,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722205631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:45,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:45,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260356698] [2025-02-05 16:25:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:45,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:45,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:45,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:45,654 INFO L87 Difference]: Start difference. First operand 3681 states and 4769 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 16:25:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:47,566 INFO L93 Difference]: Finished difference Result 7491 states and 9687 transitions. [2025-02-05 16:25:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:47,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 228 [2025-02-05 16:25:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:47,583 INFO L225 Difference]: With dead ends: 7491 [2025-02-05 16:25:47,583 INFO L226 Difference]: Without dead ends: 3815 [2025-02-05 16:25:47,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:47,594 INFO L435 NwaCegarLoop]: 3611 mSDtfsCounter, 4961 mSDsluCounter, 3757 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4961 SdHoareTripleChecker+Valid, 7368 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:47,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4961 Valid, 7368 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:25:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2025-02-05 16:25:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3679. [2025-02-05 16:25:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 3003 states have (on average 1.216117216117216) internal successors, (3652), 3048 states have internal predecessors, (3652), 557 states have call successors, (557), 118 states have call predecessors, (557), 118 states have return successors, (556), 536 states have call predecessors, (556), 556 states have call successors, (556) [2025-02-05 16:25:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4765 transitions. [2025-02-05 16:25:47,691 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4765 transitions. Word has length 228 [2025-02-05 16:25:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:47,692 INFO L471 AbstractCegarLoop]: Abstraction has 3679 states and 4765 transitions. [2025-02-05 16:25:47,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 16:25:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4765 transitions. [2025-02-05 16:25:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 16:25:47,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:47,696 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:47,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:25:47,696 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:47,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 796445981, now seen corresponding path program 1 times [2025-02-05 16:25:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:47,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783301355] [2025-02-05 16:25:47,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 16:25:48,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 16:25:48,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:48,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 16:25:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:48,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783301355] [2025-02-05 16:25:48,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783301355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:48,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:48,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7973927] [2025-02-05 16:25:48,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:48,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:48,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:48,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:48,356 INFO L87 Difference]: Start difference. First operand 3679 states and 4765 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 16:25:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:50,371 INFO L93 Difference]: Finished difference Result 7487 states and 9679 transitions. [2025-02-05 16:25:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:50,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 229 [2025-02-05 16:25:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:50,389 INFO L225 Difference]: With dead ends: 7487 [2025-02-05 16:25:50,389 INFO L226 Difference]: Without dead ends: 3813 [2025-02-05 16:25:50,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:50,401 INFO L435 NwaCegarLoop]: 3498 mSDtfsCounter, 3719 mSDsluCounter, 5434 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3719 SdHoareTripleChecker+Valid, 8932 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:50,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3719 Valid, 8932 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 16:25:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2025-02-05 16:25:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3675. [2025-02-05 16:25:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 3001 states have (on average 1.2155948017327558) internal successors, (3648), 3046 states have internal predecessors, (3648), 555 states have call successors, (555), 118 states have call predecessors, (555), 118 states have return successors, (554), 534 states have call predecessors, (554), 554 states have call successors, (554) [2025-02-05 16:25:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4757 transitions. [2025-02-05 16:25:50,501 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4757 transitions. Word has length 229 [2025-02-05 16:25:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:50,502 INFO L471 AbstractCegarLoop]: Abstraction has 3675 states and 4757 transitions. [2025-02-05 16:25:50,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 16:25:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4757 transitions. [2025-02-05 16:25:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:25:50,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:50,504 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:25:50,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1962629398, now seen corresponding path program 1 times [2025-02-05 16:25:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723108964] [2025-02-05 16:25:50,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:25:50,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:25:50,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:50,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 16:25:51,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723108964] [2025-02-05 16:25:51,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723108964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:51,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:51,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:51,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705777946] [2025-02-05 16:25:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:51,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:51,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:51,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:51,246 INFO L87 Difference]: Start difference. First operand 3675 states and 4757 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 16:25:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:53,293 INFO L93 Difference]: Finished difference Result 7343 states and 9511 transitions. [2025-02-05 16:25:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:53,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 230 [2025-02-05 16:25:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:53,309 INFO L225 Difference]: With dead ends: 7343 [2025-02-05 16:25:53,309 INFO L226 Difference]: Without dead ends: 3673 [2025-02-05 16:25:53,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:53,320 INFO L435 NwaCegarLoop]: 3472 mSDtfsCounter, 3725 mSDsluCounter, 5277 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3725 SdHoareTripleChecker+Valid, 8749 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:53,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3725 Valid, 8749 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2490 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 16:25:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2025-02-05 16:25:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3671. [2025-02-05 16:25:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 2999 states have (on average 1.2150716905635213) internal successors, (3644), 3044 states have internal predecessors, (3644), 553 states have call successors, (553), 118 states have call predecessors, (553), 118 states have return successors, (552), 532 states have call predecessors, (552), 552 states have call successors, (552) [2025-02-05 16:25:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4749 transitions. [2025-02-05 16:25:53,422 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4749 transitions. Word has length 230 [2025-02-05 16:25:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:53,423 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 4749 transitions. [2025-02-05 16:25:53,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 16:25:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4749 transitions. [2025-02-05 16:25:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:25:53,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:53,425 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:53,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:25:53,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:53,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash -180427826, now seen corresponding path program 1 times [2025-02-05 16:25:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:53,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066253768] [2025-02-05 16:25:53,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:53,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:25:53,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:25:53,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:53,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 16:25:54,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:54,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066253768] [2025-02-05 16:25:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066253768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:54,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397843219] [2025-02-05 16:25:54,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:54,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:54,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:54,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:54,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:54,029 INFO L87 Difference]: Start difference. First operand 3671 states and 4749 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 16:25:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:54,542 INFO L93 Difference]: Finished difference Result 7339 states and 9498 transitions. [2025-02-05 16:25:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:25:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 230 [2025-02-05 16:25:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:54,559 INFO L225 Difference]: With dead ends: 7339 [2025-02-05 16:25:54,559 INFO L226 Difference]: Without dead ends: 3673 [2025-02-05 16:25:54,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:54,569 INFO L435 NwaCegarLoop]: 2934 mSDtfsCounter, 1789 mSDsluCounter, 5336 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 8270 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:54,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 8270 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:25:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2025-02-05 16:25:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3671. [2025-02-05 16:25:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 2999 states have (on average 1.2147382460820273) internal successors, (3643), 3044 states have internal predecessors, (3643), 553 states have call successors, (553), 118 states have call predecessors, (553), 118 states have return successors, (552), 532 states have call predecessors, (552), 552 states have call successors, (552) [2025-02-05 16:25:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4748 transitions. [2025-02-05 16:25:54,662 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4748 transitions. Word has length 230 [2025-02-05 16:25:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:54,662 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 4748 transitions. [2025-02-05 16:25:54,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 16:25:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4748 transitions. [2025-02-05 16:25:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 16:25:54,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:54,665 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:54,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:25:54,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:54,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash 713256080, now seen corresponding path program 1 times [2025-02-05 16:25:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457162584] [2025-02-05 16:25:54,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:54,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 16:25:54,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 16:25:54,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:54,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 16:25:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457162584] [2025-02-05 16:25:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457162584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015449215] [2025-02-05 16:25:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:55,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:55,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:55,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:55,216 INFO L87 Difference]: Start difference. First operand 3671 states and 4748 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 16:25:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:55,692 INFO L93 Difference]: Finished difference Result 7471 states and 9644 transitions. [2025-02-05 16:25:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2025-02-05 16:25:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:55,706 INFO L225 Difference]: With dead ends: 7471 [2025-02-05 16:25:55,706 INFO L226 Difference]: Without dead ends: 3805 [2025-02-05 16:25:55,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:55,715 INFO L435 NwaCegarLoop]: 3010 mSDtfsCounter, 2384 mSDsluCounter, 5669 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 8679 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:55,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 8679 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:25:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2025-02-05 16:25:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3669. [2025-02-05 16:25:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3669 states, 2998 states have (on average 1.21447631754503) internal successors, (3641), 3043 states have internal predecessors, (3641), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-02-05 16:25:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 4744 transitions. [2025-02-05 16:25:55,841 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 4744 transitions. Word has length 233 [2025-02-05 16:25:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:55,842 INFO L471 AbstractCegarLoop]: Abstraction has 3669 states and 4744 transitions. [2025-02-05 16:25:55,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 16:25:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4744 transitions. [2025-02-05 16:25:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-05 16:25:55,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:55,844 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:25:55,844 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:55,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1046014061, now seen corresponding path program 1 times [2025-02-05 16:25:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563512426] [2025-02-05 16:25:55,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:56,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-05 16:25:56,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-05 16:25:56,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:56,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 16:25:56,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:56,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563512426] [2025-02-05 16:25:56,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563512426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:56,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:56,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:56,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507685326] [2025-02-05 16:25:56,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:56,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:56,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:56,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:56,470 INFO L87 Difference]: Start difference. First operand 3669 states and 4744 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 16:25:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:57,320 INFO L93 Difference]: Finished difference Result 7469 states and 9637 transitions. [2025-02-05 16:25:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234 [2025-02-05 16:25:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:57,338 INFO L225 Difference]: With dead ends: 7469 [2025-02-05 16:25:57,338 INFO L226 Difference]: Without dead ends: 3805 [2025-02-05 16:25:57,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:57,349 INFO L435 NwaCegarLoop]: 2911 mSDtfsCounter, 4516 mSDsluCounter, 4007 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4516 SdHoareTripleChecker+Valid, 6918 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:57,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4516 Valid, 6918 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:25:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2025-02-05 16:25:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3667. [2025-02-05 16:25:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3667 states, 2997 states have (on average 1.2142142142142143) internal successors, (3639), 3042 states have internal predecessors, (3639), 551 states have call successors, (551), 118 states have call predecessors, (551), 118 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550) [2025-02-05 16:25:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 4740 transitions. [2025-02-05 16:25:57,441 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 4740 transitions. Word has length 234 [2025-02-05 16:25:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:57,441 INFO L471 AbstractCegarLoop]: Abstraction has 3667 states and 4740 transitions. [2025-02-05 16:25:57,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 16:25:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 4740 transitions. [2025-02-05 16:25:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 16:25:57,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:57,443 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:57,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:25:57,444 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:57,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash -123307215, now seen corresponding path program 1 times [2025-02-05 16:25:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:57,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848403171] [2025-02-05 16:25:57,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:57,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:57,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 16:25:57,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 16:25:57,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:57,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 16:25:58,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:58,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848403171] [2025-02-05 16:25:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848403171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:58,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:58,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093742266] [2025-02-05 16:25:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:58,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:58,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:58,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:58,055 INFO L87 Difference]: Start difference. First operand 3667 states and 4740 transitions. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 16:25:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:58,894 INFO L93 Difference]: Finished difference Result 7329 states and 9477 transitions. [2025-02-05 16:25:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:58,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 235 [2025-02-05 16:25:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:58,909 INFO L225 Difference]: With dead ends: 7329 [2025-02-05 16:25:58,909 INFO L226 Difference]: Without dead ends: 3667 [2025-02-05 16:25:58,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:58,919 INFO L435 NwaCegarLoop]: 3038 mSDtfsCounter, 4426 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4426 SdHoareTripleChecker+Valid, 7199 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:58,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4426 Valid, 7199 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:25:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states. [2025-02-05 16:25:58,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 3665. [2025-02-05 16:25:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 2996 states have (on average 1.2139519359145527) internal successors, (3637), 3041 states have internal predecessors, (3637), 550 states have call successors, (550), 118 states have call predecessors, (550), 118 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-02-05 16:25:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 4736 transitions. [2025-02-05 16:25:59,008 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 4736 transitions. Word has length 235 [2025-02-05 16:25:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:59,008 INFO L471 AbstractCegarLoop]: Abstraction has 3665 states and 4736 transitions. [2025-02-05 16:25:59,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 16:25:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 4736 transitions. [2025-02-05 16:25:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 16:25:59,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:59,011 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:25:59,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:25:59,011 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:59,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1643619882, now seen corresponding path program 1 times [2025-02-05 16:25:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197635647] [2025-02-05 16:25:59,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:59,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 16:25:59,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 16:25:59,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:59,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 16:25:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197635647] [2025-02-05 16:25:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197635647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:59,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:59,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531330445] [2025-02-05 16:25:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:59,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:59,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:59,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:59,628 INFO L87 Difference]: Start difference. First operand 3665 states and 4736 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 16:26:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:00,171 INFO L93 Difference]: Finished difference Result 7327 states and 9472 transitions. [2025-02-05 16:26:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:26:00,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 235 [2025-02-05 16:26:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:00,186 INFO L225 Difference]: With dead ends: 7327 [2025-02-05 16:26:00,186 INFO L226 Difference]: Without dead ends: 3667 [2025-02-05 16:26:00,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:00,195 INFO L435 NwaCegarLoop]: 2921 mSDtfsCounter, 982 mSDsluCounter, 7732 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 10653 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:00,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 10653 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:26:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states. [2025-02-05 16:26:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 3665. [2025-02-05 16:26:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 2996 states have (on average 1.213618157543391) internal successors, (3636), 3041 states have internal predecessors, (3636), 550 states have call successors, (550), 118 states have call predecessors, (550), 118 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-02-05 16:26:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 4735 transitions. [2025-02-05 16:26:00,284 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 4735 transitions. Word has length 235 [2025-02-05 16:26:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:00,284 INFO L471 AbstractCegarLoop]: Abstraction has 3665 states and 4735 transitions. [2025-02-05 16:26:00,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 16:26:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 4735 transitions. [2025-02-05 16:26:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-05 16:26:00,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:00,286 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:26:00,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:26:00,287 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:00,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1491146302, now seen corresponding path program 1 times [2025-02-05 16:26:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:00,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723594932] [2025-02-05 16:26:00,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:00,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 16:26:00,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 16:26:00,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:00,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat