./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-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.3-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 0c11dfbc24d8e2936a0720b93d6e580e096b076c7149ef4cbc8369f1ef818941 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:25:00,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:25:00,624 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:25:00,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:25:00,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:25:00,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:25:00,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:25:00,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:25:00,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:25:00,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:25:00,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:25:00,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:25:00,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:25:00,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:25:00,662 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:25:00,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:25:00,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:25:00,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:25:00,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:25:00,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:25:00,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:25:00,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:25:00,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:25:00,665 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 -> 0c11dfbc24d8e2936a0720b93d6e580e096b076c7149ef4cbc8369f1ef818941 [2025-02-05 16:25:00,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:25:00,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:25:00,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:25:00,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:25:00,949 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:25:00,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-1.c [2025-02-05 16:25:02,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4700a666/0154bae46628419e926b36ef672ad6e4/FLAG5046ae397 [2025-02-05 16:25:02,520 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:25:02,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-1.c [2025-02-05 16:25:02,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4700a666/0154bae46628419e926b36ef672ad6e4/FLAG5046ae397 [2025-02-05 16:25:02,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4700a666/0154bae46628419e926b36ef672ad6e4 [2025-02-05 16:25:02,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:25:02,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:25:02,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:25:02,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:25:02,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:25:02,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:25:02" (1/1) ... [2025-02-05 16:25:02,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458529a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:02, skipping insertion in model container [2025-02-05 16:25:02,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:25:02" (1/1) ... [2025-02-05 16:25:02,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:25:02,758 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.3-1.c[1870,1883] [2025-02-05 16:25:03,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:25:03,229 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:25:03,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.ok3.i","-S") [42] [2025-02-05 16:25:03,241 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.3-1.c[1870,1883] [2025-02-05 16:25:03,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:25:03,493 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:25:03,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03 WrapperNode [2025-02-05 16:25:03,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:25:03,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:25:03,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:25:03,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:25:03,501 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:25:03" (1/1) ... [2025-02-05 16:25:03,557 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:25:03" (1/1) ... [2025-02-05 16:25:03,724 INFO L138 Inliner]: procedures = 99, calls = 2816, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8627 [2025-02-05 16:25:03,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:25:03,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:25:03,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:25:03,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:25:03,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:03,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:03,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:03,926 INFO L175 MemorySlicer]: Split 2420 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 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 446 writes are split as follows [0, 7, 7, 7, 7, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6]. [2025-02-05 16:25:03,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:03,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:04,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:04,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:04,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:04,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:04,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:25:04,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:25:04,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:25:04,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:25:04,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (1/1) ... [2025-02-05 16:25:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:25:04,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:04,180 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:25:04,182 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:25:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-02-05 16:25:04,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-02-05 16:25:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-02-05 16:25:04,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-02-05 16:25:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:25:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-05 16:25:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-02-05 16:25:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-02-05 16:25:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-02-05 16:25:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-02-05 16:25:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-02-05 16:25:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-02-05 16:25:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-02-05 16:25:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-02-05 16:25:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-05 16:25:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-02-05 16:25:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-02-05 16:25:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-02-05 16:25:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-02-05 16:25:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-02-05 16:25:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-02-05 16:25:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:25:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-02-05 16:25:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-02-05 16:25:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-02-05 16:25:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-05 16:25:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-02-05 16:25:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-02-05 16:25:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:25:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:25:04,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-05 16:25:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-02-05 16:25:04,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-02-05 16:25:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:25:04,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:25:04,727 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:25:04,729 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:25:14,381 INFO L? ?]: Removed 946 outVars from TransFormulas that were not future-live. [2025-02-05 16:25:14,381 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:25:14,436 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:25:14,436 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:25:14,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:25:14 BoogieIcfgContainer [2025-02-05 16:25:14,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:25:14,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:25:14,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:25:14,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:25:14,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:25:02" (1/3) ... [2025-02-05 16:25:14,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fb6813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:25:14, skipping insertion in model container [2025-02-05 16:25:14,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:03" (2/3) ... [2025-02-05 16:25:14,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fb6813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:25:14, skipping insertion in model container [2025-02-05 16:25:14,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:25:14" (3/3) ... [2025-02-05 16:25:14,446 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.3-1.c [2025-02-05 16:25:14,459 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:25:14,464 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.3-1.c that has 45 procedures, 2465 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:25:14,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:25:14,577 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;@e2bf600, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:25:14,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:25:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 2465 states, 2113 states have (on average 1.4803596781826787) internal successors, (3128), 2137 states have internal predecessors, (3128), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (306), 296 states have call predecessors, (306), 306 states have call successors, (306) [2025-02-05 16:25:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:25:14,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:14,608 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:25:14,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -743057840, now seen corresponding path program 1 times [2025-02-05 16:25:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943352642] [2025-02-05 16:25:14,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:15,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:25:15,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:25:15,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:15,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:15,809 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:25:15,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:15,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943352642] [2025-02-05 16:25:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943352642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:25:15,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798206418] [2025-02-05 16:25:15,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:15,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:25:15,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:15,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:25:15,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:25:15,870 INFO L87 Difference]: Start difference. First operand has 2465 states, 2113 states have (on average 1.4803596781826787) internal successors, (3128), 2137 states have internal predecessors, (3128), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (306), 296 states have call predecessors, (306), 306 states have call successors, (306) 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:25:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:16,158 INFO L93 Difference]: Finished difference Result 4921 states and 7728 transitions. [2025-02-05 16:25:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:25:16,160 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:25:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:16,188 INFO L225 Difference]: With dead ends: 4921 [2025-02-05 16:25:16,188 INFO L226 Difference]: Without dead ends: 2452 [2025-02-05 16:25:16,219 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:25:16,221 INFO L435 NwaCegarLoop]: 3044 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, 3044 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:25:16,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3044 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:25:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-02-05 16:25:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2452. [2025-02-05 16:25:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2101 states have (on average 1.153736316039981) internal successors, (2424), 2125 states have internal predecessors, (2424), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) [2025-02-05 16:25:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3035 transitions. [2025-02-05 16:25:16,411 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3035 transitions. Word has length 148 [2025-02-05 16:25:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:16,411 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3035 transitions. [2025-02-05 16:25:16,411 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:25:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3035 transitions. [2025-02-05 16:25:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 16:25:16,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:16,418 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:25:16,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:25:16,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:16,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1532724394, now seen corresponding path program 1 times [2025-02-05 16:25:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:16,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277557768] [2025-02-05 16:25:16,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:16,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:16,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 16:25:16,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 16:25:16,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:16,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:17,934 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:25:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277557768] [2025-02-05 16:25:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277557768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124035411] [2025-02-05 16:25:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:17,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:17,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:17,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:17,938 INFO L87 Difference]: Start difference. First operand 2452 states and 3035 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:25:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:20,857 INFO L93 Difference]: Finished difference Result 5558 states and 6981 transitions. [2025-02-05 16:25:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:20,858 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:25:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:20,875 INFO L225 Difference]: With dead ends: 5558 [2025-02-05 16:25:20,875 INFO L226 Difference]: Without dead ends: 3111 [2025-02-05 16:25:20,894 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:20,895 INFO L435 NwaCegarLoop]: 3649 mSDtfsCounter, 3885 mSDsluCounter, 5592 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3885 SdHoareTripleChecker+Valid, 9241 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:20,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3885 Valid, 9241 Invalid, 2561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 16:25:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-02-05 16:25:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 2975. [2025-02-05 16:25:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2476 states have (on average 1.1865912762520194) internal successors, (2938), 2506 states have internal predecessors, (2938), 421 states have call successors, (421), 77 states have call predecessors, (421), 77 states have return successors, (420), 406 states have call predecessors, (420), 420 states have call successors, (420) [2025-02-05 16:25:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 3779 transitions. [2025-02-05 16:25:20,998 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 3779 transitions. Word has length 208 [2025-02-05 16:25:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:20,999 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 3779 transitions. [2025-02-05 16:25:20,999 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:25:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3779 transitions. [2025-02-05 16:25:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 16:25:21,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:21,003 INFO L218 NwaCegarLoop]: trace histogram [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:21,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:25:21,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -7794052, now seen corresponding path program 1 times [2025-02-05 16:25:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199543115] [2025-02-05 16:25:21,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:21,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 16:25:21,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 16:25:21,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:21,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:25:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199543115] [2025-02-05 16:25:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199543115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020204377] [2025-02-05 16:25:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:22,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:22,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:22,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:22,011 INFO L87 Difference]: Start difference. First operand 2975 states and 3779 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:25:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:25,011 INFO L93 Difference]: Finished difference Result 6457 states and 8262 transitions. [2025-02-05 16:25:25,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:25,011 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 209 [2025-02-05 16:25:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:25,031 INFO L225 Difference]: With dead ends: 6457 [2025-02-05 16:25:25,032 INFO L226 Difference]: Without dead ends: 3487 [2025-02-05 16:25:25,049 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:25,050 INFO L435 NwaCegarLoop]: 3526 mSDtfsCounter, 3728 mSDsluCounter, 5461 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3728 SdHoareTripleChecker+Valid, 8987 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:25,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3728 Valid, 8987 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 16:25:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2025-02-05 16:25:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3349. [2025-02-05 16:25:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3349 states, 2752 states have (on average 1.206031976744186) internal successors, (3319), 2791 states have internal predecessors, (3319), 498 states have call successors, (498), 98 states have call predecessors, (498), 98 states have return successors, (497), 479 states have call predecessors, (497), 497 states have call successors, (497) [2025-02-05 16:25:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 4314 transitions. [2025-02-05 16:25:25,195 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 4314 transitions. Word has length 209 [2025-02-05 16:25:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:25,195 INFO L471 AbstractCegarLoop]: Abstraction has 3349 states and 4314 transitions. [2025-02-05 16:25:25,196 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:25:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 4314 transitions. [2025-02-05 16:25:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 16:25:25,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:25,200 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:25:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:25:25,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:25,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1414813080, now seen corresponding path program 1 times [2025-02-05 16:25:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745110030] [2025-02-05 16:25:25,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:25,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:25,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 16:25:25,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 16:25:25,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:25,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:27,026 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:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:27,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745110030] [2025-02-05 16:25:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745110030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:27,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:27,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:25:27,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541117976] [2025-02-05 16:25:27,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:27,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:27,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:27,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:25:27,028 INFO L87 Difference]: Start difference. First operand 3349 states and 4314 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:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:29,553 INFO L93 Difference]: Finished difference Result 7067 states and 9166 transitions. [2025-02-05 16:25:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:29,553 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:29,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:29,572 INFO L225 Difference]: With dead ends: 7067 [2025-02-05 16:25:29,572 INFO L226 Difference]: Without dead ends: 3723 [2025-02-05 16:25:29,584 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:29,585 INFO L435 NwaCegarLoop]: 3420 mSDtfsCounter, 5685 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5685 SdHoareTripleChecker+Valid, 6025 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:29,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5685 Valid, 6025 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 16:25:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2025-02-05 16:25:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2025-02-05 16:25:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3027 states have (on average 1.222001982160555) internal successors, (3699), 3072 states have internal predecessors, (3699), 575 states have call successors, (575), 118 states have call predecessors, (575), 118 states have return successors, (574), 554 states have call predecessors, (574), 574 states have call successors, (574) [2025-02-05 16:25:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4848 transitions. [2025-02-05 16:25:29,703 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4848 transitions. Word has length 205 [2025-02-05 16:25:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:29,704 INFO L471 AbstractCegarLoop]: Abstraction has 3721 states and 4848 transitions. [2025-02-05 16:25:29,704 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:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4848 transitions. [2025-02-05 16:25:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 16:25:29,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:29,707 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:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:25:29,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:29,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 972951326, now seen corresponding path program 1 times [2025-02-05 16:25:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:29,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706924107] [2025-02-05 16:25:29,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:30,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 16:25:30,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 16:25:30,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:30,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:30,463 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:30,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:30,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706924107] [2025-02-05 16:25:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706924107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:30,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825471466] [2025-02-05 16:25:30,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:30,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:30,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:30,470 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:30,473 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:31,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 16:25:31,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 16:25:31,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:31,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:31,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 2862 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 16:25:31,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:31,634 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:31,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825471466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:31,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:31,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 16:25:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611926831] [2025-02-05 16:25:31,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:31,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:31,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:31,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:31,636 INFO L87 Difference]: Start difference. First operand 3721 states and 4848 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:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:33,164 INFO L93 Difference]: Finished difference Result 7674 states and 9983 transitions. [2025-02-05 16:25:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:33,164 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:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:33,184 INFO L225 Difference]: With dead ends: 7674 [2025-02-05 16:25:33,185 INFO L226 Difference]: Without dead ends: 3844 [2025-02-05 16:25:33,199 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:33,200 INFO L435 NwaCegarLoop]: 3598 mSDtfsCounter, 1465 mSDsluCounter, 6334 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 9932 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:33,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 9932 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:25:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2025-02-05 16:25:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3708. [2025-02-05 16:25:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3019 states have (on average 1.2206028486253726) internal successors, (3685), 3064 states have internal predecessors, (3685), 570 states have call successors, (570), 118 states have call predecessors, (570), 118 states have return successors, (569), 549 states have call predecessors, (569), 569 states have call successors, (569) [2025-02-05 16:25:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 4824 transitions. [2025-02-05 16:25:33,419 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 4824 transitions. Word has length 208 [2025-02-05 16:25:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:33,419 INFO L471 AbstractCegarLoop]: Abstraction has 3708 states and 4824 transitions. [2025-02-05 16:25:33,420 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:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 4824 transitions. [2025-02-05 16:25:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 16:25:33,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:33,424 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:33,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:25:33,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:33,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:33,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash -292046140, now seen corresponding path program 1 times [2025-02-05 16:25:33,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:33,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949885781] [2025-02-05 16:25:33,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:33,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:34,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 16:25:34,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 16:25:34,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:34,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:34,438 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:34,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:34,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949885781] [2025-02-05 16:25:34,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949885781] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:34,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187734012] [2025-02-05 16:25:34,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:34,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:34,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:34,445 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:34,446 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:35,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 16:25:35,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 16:25:35,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:35,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:35,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:35,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:35,748 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:35,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187734012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 16:25:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674485932] [2025-02-05 16:25:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:35,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:35,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:35,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:35,752 INFO L87 Difference]: Start difference. First operand 3708 states and 4824 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:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:37,332 INFO L93 Difference]: Finished difference Result 7605 states and 9878 transitions. [2025-02-05 16:25:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:37,333 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:37,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:37,365 INFO L225 Difference]: With dead ends: 7605 [2025-02-05 16:25:37,365 INFO L226 Difference]: Without dead ends: 3836 [2025-02-05 16:25:37,394 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:37,398 INFO L435 NwaCegarLoop]: 3576 mSDtfsCounter, 1176 mSDsluCounter, 8739 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 12315 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:37,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 12315 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:25:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2025-02-05 16:25:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 3698. [2025-02-05 16:25:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3698 states, 3013 states have (on average 1.2193826750746763) internal successors, (3674), 3058 states have internal predecessors, (3674), 566 states have call successors, (566), 118 states have call predecessors, (566), 118 states have return successors, (565), 545 states have call predecessors, (565), 565 states have call successors, (565) [2025-02-05 16:25:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 4805 transitions. [2025-02-05 16:25:37,627 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 4805 transitions. Word has length 209 [2025-02-05 16:25:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:37,628 INFO L471 AbstractCegarLoop]: Abstraction has 3698 states and 4805 transitions. [2025-02-05 16:25:37,629 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:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 4805 transitions. [2025-02-05 16:25:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 16:25:37,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:37,632 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:37,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:25:37,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:37,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:37,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:37,833 INFO L85 PathProgramCache]: Analyzing trace with hash -603552259, now seen corresponding path program 1 times [2025-02-05 16:25:37,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:37,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263180314] [2025-02-05 16:25:37,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:37,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:38,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 16:25:38,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 16:25:38,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:38,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:38,505 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:38,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263180314] [2025-02-05 16:25:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263180314] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483725826] [2025-02-05 16:25:38,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:38,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:38,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:38,508 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:38,510 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:39,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 16:25:39,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 16:25:39,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:39,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:39,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:39,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:39,703 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:39,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:39,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483725826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:39,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:39,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 16:25:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009623516] [2025-02-05 16:25:39,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:39,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:39,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:39,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:39,704 INFO L87 Difference]: Start difference. First operand 3698 states and 4805 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:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:40,975 INFO L93 Difference]: Finished difference Result 8208 states and 10668 transitions. [2025-02-05 16:25:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:40,976 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:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:40,995 INFO L225 Difference]: With dead ends: 8208 [2025-02-05 16:25:40,995 INFO L226 Difference]: Without dead ends: 4515 [2025-02-05 16:25:41,007 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:41,008 INFO L435 NwaCegarLoop]: 3806 mSDtfsCounter, 1741 mSDsluCounter, 6895 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 10701 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:41,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 10701 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:25:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2025-02-05 16:25:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4186. [2025-02-05 16:25:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 3367 states have (on average 1.236115236115236) internal successors, (4162), 3423 states have internal predecessors, (4162), 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:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5514 transitions. [2025-02-05 16:25:41,112 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5514 transitions. Word has length 210 [2025-02-05 16:25:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:41,112 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5514 transitions. [2025-02-05 16:25:41,113 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:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5514 transitions. [2025-02-05 16:25:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 16:25:41,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:41,117 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:41,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:25:41,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:41,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:41,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash 916495161, now seen corresponding path program 1 times [2025-02-05 16:25:41,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:41,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769226340] [2025-02-05 16:25:41,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:41,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 16:25:41,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 16:25:41,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:41,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:42,003 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:42,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:42,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769226340] [2025-02-05 16:25:42,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769226340] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:42,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299541623] [2025-02-05 16:25:42,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:42,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:42,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:42,006 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:42,007 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:42,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 16:25:43,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 16:25:43,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:43,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:43,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:43,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:43,210 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:43,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299541623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:43,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:43,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-02-05 16:25:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088020978] [2025-02-05 16:25:43,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:43,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:43,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:43,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:25:43,212 INFO L87 Difference]: Start difference. First operand 4186 states and 5514 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:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:44,166 INFO L93 Difference]: Finished difference Result 8369 states and 11032 transitions. [2025-02-05 16:25:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:44,167 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:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:44,189 INFO L225 Difference]: With dead ends: 8369 [2025-02-05 16:25:44,190 INFO L226 Difference]: Without dead ends: 4188 [2025-02-05 16:25:44,203 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:44,204 INFO L435 NwaCegarLoop]: 2943 mSDtfsCounter, 1062 mSDsluCounter, 5749 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 8692 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:44,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 8692 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:25:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2025-02-05 16:25:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4186. [2025-02-05 16:25:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 3367 states have (on average 1.235818235818236) internal successors, (4161), 3423 states have internal predecessors, (4161), 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:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5513 transitions. [2025-02-05 16:25:44,320 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5513 transitions. Word has length 210 [2025-02-05 16:25:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:44,320 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5513 transitions. [2025-02-05 16:25:44,320 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:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5513 transitions. [2025-02-05 16:25:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 16:25:44,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:44,325 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:44,338 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:44,529 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,SelfDestructingSolverStorable7 [2025-02-05 16:25:44,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:44,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1278122663, now seen corresponding path program 1 times [2025-02-05 16:25:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:44,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725990703] [2025-02-05 16:25:44,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:44,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:25:44,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:25:44,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:44,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:45,195 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:45,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:45,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725990703] [2025-02-05 16:25:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725990703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:45,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001557084] [2025-02-05 16:25:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:45,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:45,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:45,197 INFO L87 Difference]: Start difference. First operand 4186 states and 5513 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:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:47,395 INFO L93 Difference]: Finished difference Result 7873 states and 10305 transitions. [2025-02-05 16:25:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:47,396 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:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:47,420 INFO L225 Difference]: With dead ends: 7873 [2025-02-05 16:25:47,420 INFO L226 Difference]: Without dead ends: 3692 [2025-02-05 16:25:47,435 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:47,435 INFO L435 NwaCegarLoop]: 3490 mSDtfsCounter, 6660 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 849 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6660 SdHoareTripleChecker+Valid, 6135 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 849 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:47,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6660 Valid, 6135 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [849 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 16:25:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2025-02-05 16:25:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3690. [2025-02-05 16:25:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3008 states have (on average 1.217752659574468) internal successors, (3663), 3053 states have internal predecessors, (3663), 563 states have call successors, (563), 118 states have call predecessors, (563), 118 states have return successors, (562), 542 states have call predecessors, (562), 562 states have call successors, (562) [2025-02-05 16:25:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4788 transitions. [2025-02-05 16:25:47,595 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 4788 transitions. Word has length 220 [2025-02-05 16:25:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:47,596 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 4788 transitions. [2025-02-05 16:25:47,596 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:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4788 transitions. [2025-02-05 16:25:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 16:25:47,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:47,600 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:47,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:25:47,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1104207979, now seen corresponding path program 1 times [2025-02-05 16:25:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498234624] [2025-02-05 16:25:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:47,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:25:48,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:25:48,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:48,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:48,413 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:48,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:48,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498234624] [2025-02-05 16:25:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498234624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:25:48,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108845861] [2025-02-05 16:25:48,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:48,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:25:48,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:48,418 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:48,419 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:49,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:25:49,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:25:49,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:49,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:49,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:25:49,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:25:49,791 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:49,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:25:49,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108845861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:49,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:25:49,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-02-05 16:25:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998110358] [2025-02-05 16:25:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:49,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:25:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:49,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:25:49,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:25:49,792 INFO L87 Difference]: Start difference. First operand 3690 states and 4788 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:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:51,177 INFO L93 Difference]: Finished difference Result 7375 states and 9577 transitions. [2025-02-05 16:25:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:51,177 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:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:51,226 INFO L225 Difference]: With dead ends: 7375 [2025-02-05 16:25:51,227 INFO L226 Difference]: Without dead ends: 3690 [2025-02-05 16:25:51,256 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:51,261 INFO L435 NwaCegarLoop]: 3060 mSDtfsCounter, 4522 mSDsluCounter, 2937 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 5997 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:51,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 5997 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:25:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-02-05 16:25:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-02-05 16:25:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3007 states have (on average 1.2174925174592617) internal successors, (3661), 3052 states have internal predecessors, (3661), 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:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4784 transitions. [2025-02-05 16:25:51,402 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4784 transitions. Word has length 220 [2025-02-05 16:25:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:51,402 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4784 transitions. [2025-02-05 16:25:51,403 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:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4784 transitions. [2025-02-05 16:25:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 16:25:51,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:51,408 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:51,425 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:51,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 16:25:51,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:51,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash 900710429, now seen corresponding path program 1 times [2025-02-05 16:25:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004886131] [2025-02-05 16:25:51,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:51,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:25:52,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:25:52,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:52,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:52,512 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:52,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:52,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004886131] [2025-02-05 16:25:52,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004886131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:52,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:52,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137746508] [2025-02-05 16:25:52,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:52,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:52,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:52,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:52,520 INFO L87 Difference]: Start difference. First operand 3688 states and 4784 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:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:54,605 INFO L93 Difference]: Finished difference Result 7373 states and 9571 transitions. [2025-02-05 16:25:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:25:54,606 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:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:54,633 INFO L225 Difference]: With dead ends: 7373 [2025-02-05 16:25:54,633 INFO L226 Difference]: Without dead ends: 3690 [2025-02-05 16:25:54,650 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:54,651 INFO L435 NwaCegarLoop]: 3392 mSDtfsCounter, 3626 mSDsluCounter, 5178 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3626 SdHoareTripleChecker+Valid, 8570 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:54,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3626 Valid, 8570 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:25:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-02-05 16:25:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-02-05 16:25:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3007 states have (on average 1.217159960093116) internal successors, (3660), 3052 states have internal predecessors, (3660), 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:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4783 transitions. [2025-02-05 16:25:54,793 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4783 transitions. Word has length 220 [2025-02-05 16:25:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:54,794 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4783 transitions. [2025-02-05 16:25:54,794 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:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4783 transitions. [2025-02-05 16:25:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 16:25:54,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:54,797 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:54,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:25:54,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:54,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1019062079, now seen corresponding path program 1 times [2025-02-05 16:25:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:54,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271917757] [2025-02-05 16:25:54,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:55,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 16:25:55,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 16:25:55,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:55,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:55,588 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:55,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:55,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271917757] [2025-02-05 16:25:55,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271917757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:55,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:55,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:55,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113040163] [2025-02-05 16:25:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:55,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:55,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:55,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:55,591 INFO L87 Difference]: Start difference. First operand 3688 states and 4783 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:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:25:57,720 INFO L93 Difference]: Finished difference Result 7505 states and 9717 transitions. [2025-02-05 16:25:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:25:57,721 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:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:25:57,747 INFO L225 Difference]: With dead ends: 7505 [2025-02-05 16:25:57,747 INFO L226 Difference]: Without dead ends: 3822 [2025-02-05 16:25:57,763 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:57,764 INFO L435 NwaCegarLoop]: 3625 mSDtfsCounter, 3877 mSDsluCounter, 5565 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3877 SdHoareTripleChecker+Valid, 9190 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:25:57,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3877 Valid, 9190 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:25:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2025-02-05 16:25:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3686. [2025-02-05 16:25:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3006 states have (on average 1.2168995342648037) internal successors, (3658), 3051 states have internal predecessors, (3658), 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:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4779 transitions. [2025-02-05 16:25:57,896 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4779 transitions. Word has length 223 [2025-02-05 16:25:57,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:25:57,897 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4779 transitions. [2025-02-05 16:25:57,897 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:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4779 transitions. [2025-02-05 16:25:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 16:25:57,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:25:57,900 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:57,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:25:57,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:25:57,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:25:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash 922640830, now seen corresponding path program 1 times [2025-02-05 16:25:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:25:57,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864873618] [2025-02-05 16:25:57,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:25:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:25:58,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 16:25:58,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 16:25:58,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:25:58,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:25:58,693 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:58,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:25:58,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864873618] [2025-02-05 16:25:58,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864873618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:25:58,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:25:58,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:25:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132052700] [2025-02-05 16:25:58,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:25:58,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:25:58,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:25:58,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:25:58,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:25:58,695 INFO L87 Difference]: Start difference. First operand 3686 states and 4779 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:26:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:00,542 INFO L93 Difference]: Finished difference Result 7501 states and 9709 transitions. [2025-02-05 16:26:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:26:00,543 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:26:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:00,566 INFO L225 Difference]: With dead ends: 7501 [2025-02-05 16:26:00,566 INFO L226 Difference]: Without dead ends: 3820 [2025-02-05 16:26:00,590 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:26:00,591 INFO L435 NwaCegarLoop]: 3503 mSDtfsCounter, 6683 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6683 SdHoareTripleChecker+Valid, 6218 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:00,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6683 Valid, 6218 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:26:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2025-02-05 16:26:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3682. [2025-02-05 16:26:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3004 states have (on average 1.2163781624500665) internal successors, (3654), 3049 states have internal predecessors, (3654), 559 states have call successors, (559), 118 states have call predecessors, (559), 118 states have return successors, (558), 538 states have call predecessors, (558), 558 states have call successors, (558) [2025-02-05 16:26:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4771 transitions. [2025-02-05 16:26:00,700 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4771 transitions. Word has length 224 [2025-02-05 16:26:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:00,701 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4771 transitions. [2025-02-05 16:26:00,701 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:26:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4771 transitions. [2025-02-05 16:26:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 16:26:00,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:00,703 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, 1] [2025-02-05 16:26:00,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:26:00,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:00,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1252649154, now seen corresponding path program 1 times [2025-02-05 16:26:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:00,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191682452] [2025-02-05 16:26:00,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:00,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 16:26:01,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 16:26:01,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:01,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:01,363 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:26:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191682452] [2025-02-05 16:26:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191682452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:01,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:01,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:26:01,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409661361] [2025-02-05 16:26:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:01,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:26:01,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:01,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:26:01,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:01,365 INFO L87 Difference]: Start difference. First operand 3682 states and 4771 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, (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:26:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:03,546 INFO L93 Difference]: Finished difference Result 7357 states and 9541 transitions. [2025-02-05 16:26:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:26:03,547 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, (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 225 [2025-02-05 16:26:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:03,563 INFO L225 Difference]: With dead ends: 7357 [2025-02-05 16:26:03,563 INFO L226 Difference]: Without dead ends: 3680 [2025-02-05 16:26:03,579 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:26:03,580 INFO L435 NwaCegarLoop]: 3477 mSDtfsCounter, 5728 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5728 SdHoareTripleChecker+Valid, 7950 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:03,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5728 Valid, 7950 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 16:26:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-02-05 16:26:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3678. [2025-02-05 16:26:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3002 states have (on average 1.2158560959360427) internal successors, (3650), 3047 states have internal predecessors, (3650), 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:26:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4763 transitions. [2025-02-05 16:26:03,667 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4763 transitions. Word has length 225 [2025-02-05 16:26:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4763 transitions. [2025-02-05 16:26:03,667 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, (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:26:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4763 transitions. [2025-02-05 16:26:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 16:26:03,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:03,670 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:26:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:26:03,670 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 649721093, now seen corresponding path program 1 times [2025-02-05 16:26:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324315515] [2025-02-05 16:26:03,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:03,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 16:26:03,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 16:26:03,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:03,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:04,367 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:26:04,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:04,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324315515] [2025-02-05 16:26:04,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324315515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:04,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:26:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081318078] [2025-02-05 16:26:04,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:04,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:26:04,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:04,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:26:04,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:04,373 INFO L87 Difference]: Start difference. First operand 3678 states and 4763 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:26:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:06,246 INFO L93 Difference]: Finished difference Result 7353 states and 9529 transitions. [2025-02-05 16:26:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:06,246 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:26:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:06,261 INFO L225 Difference]: With dead ends: 7353 [2025-02-05 16:26:06,261 INFO L226 Difference]: Without dead ends: 3680 [2025-02-05 16:26:06,274 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:26:06,275 INFO L435 NwaCegarLoop]: 3371 mSDtfsCounter, 6425 mSDsluCounter, 2574 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6425 SdHoareTripleChecker+Valid, 5945 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:06,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6425 Valid, 5945 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:26:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-02-05 16:26:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3678. [2025-02-05 16:26:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3002 states have (on average 1.215522984676882) internal successors, (3649), 3047 states have internal predecessors, (3649), 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:26:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4762 transitions. [2025-02-05 16:26:06,374 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4762 transitions. Word has length 225 [2025-02-05 16:26:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:06,374 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4762 transitions. [2025-02-05 16:26:06,375 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:26:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4762 transitions. [2025-02-05 16:26:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 16:26:06,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:06,377 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:26:06,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:26:06,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:06,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1765688453, now seen corresponding path program 1 times [2025-02-05 16:26:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599449329] [2025-02-05 16:26:06,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:06,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 16:26:06,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 16:26:06,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:06,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:07,038 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:26:07,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:07,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599449329] [2025-02-05 16:26:07,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599449329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:26:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324733461] [2025-02-05 16:26:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:07,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:26:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:07,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:26:07,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:07,040 INFO L87 Difference]: Start difference. First operand 3678 states and 4762 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:26:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:09,100 INFO L93 Difference]: Finished difference Result 7485 states and 9675 transitions. [2025-02-05 16:26:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:26:09,100 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:26:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:09,115 INFO L225 Difference]: With dead ends: 7485 [2025-02-05 16:26:09,115 INFO L226 Difference]: Without dead ends: 3812 [2025-02-05 16:26:09,127 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:26:09,128 INFO L435 NwaCegarLoop]: 3604 mSDtfsCounter, 5789 mSDsluCounter, 4562 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5789 SdHoareTripleChecker+Valid, 8166 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:09,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5789 Valid, 8166 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:26:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2025-02-05 16:26:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3676. [2025-02-05 16:26:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3676 states, 3001 states have (on average 1.2152615794735089) internal successors, (3647), 3046 states have internal predecessors, (3647), 556 states have call successors, (556), 118 states have call predecessors, (556), 118 states have return successors, (555), 535 states have call predecessors, (555), 555 states have call successors, (555) [2025-02-05 16:26:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 4758 transitions. [2025-02-05 16:26:09,227 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 4758 transitions. Word has length 228 [2025-02-05 16:26:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:09,228 INFO L471 AbstractCegarLoop]: Abstraction has 3676 states and 4758 transitions. [2025-02-05 16:26:09,228 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:26:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 4758 transitions. [2025-02-05 16:26:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 16:26:09,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:09,230 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:26:09,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:26:09,230 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:09,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1737631225, now seen corresponding path program 1 times [2025-02-05 16:26:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791496726] [2025-02-05 16:26:09,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:09,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 16:26:09,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 16:26:09,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:09,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:09,943 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:26:09,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791496726] [2025-02-05 16:26:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791496726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:09,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:26:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324531836] [2025-02-05 16:26:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:09,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:26:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:09,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:26:09,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:09,945 INFO L87 Difference]: Start difference. First operand 3676 states and 4758 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:26:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:11,850 INFO L93 Difference]: Finished difference Result 7481 states and 9667 transitions. [2025-02-05 16:26:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:26:11,850 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:26:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:11,870 INFO L225 Difference]: With dead ends: 7481 [2025-02-05 16:26:11,870 INFO L226 Difference]: Without dead ends: 3810 [2025-02-05 16:26:11,888 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:26:11,888 INFO L435 NwaCegarLoop]: 3495 mSDtfsCounter, 4667 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 7080 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:11,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 7080 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:26:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2025-02-05 16:26:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3672. [2025-02-05 16:26:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 2999 states have (on average 1.2147382460820273) internal successors, (3643), 3044 states have internal predecessors, (3643), 554 states have call successors, (554), 118 states have call predecessors, (554), 118 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553) [2025-02-05 16:26:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4750 transitions. [2025-02-05 16:26:12,006 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 4750 transitions. Word has length 229 [2025-02-05 16:26:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:12,007 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 4750 transitions. [2025-02-05 16:26:12,007 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:26:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 4750 transitions. [2025-02-05 16:26:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:26:12,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:12,009 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:26:12,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:26:12,010 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:12,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1506553926, now seen corresponding path program 1 times [2025-02-05 16:26:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:12,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921259268] [2025-02-05 16:26:12,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:12,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:26:12,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:26:12,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:12,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:12,607 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:26:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921259268] [2025-02-05 16:26:12,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921259268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:12,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:26:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540409595] [2025-02-05 16:26:12,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:26:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:12,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:26:12,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:12,609 INFO L87 Difference]: Start difference. First operand 3672 states and 4750 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:26:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:14,753 INFO L93 Difference]: Finished difference Result 7337 states and 9499 transitions. [2025-02-05 16:26:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:26:14,754 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:26:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:14,774 INFO L225 Difference]: With dead ends: 7337 [2025-02-05 16:26:14,774 INFO L226 Difference]: Without dead ends: 3670 [2025-02-05 16:26:14,785 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:26:14,786 INFO L435 NwaCegarLoop]: 3469 mSDtfsCounter, 6624 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6624 SdHoareTripleChecker+Valid, 6102 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:14,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6624 Valid, 6102 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:26:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-02-05 16:26:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-02-05 16:26:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2997 states have (on average 1.2142142142142143) internal successors, (3639), 3042 states have internal predecessors, (3639), 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:26:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4742 transitions. [2025-02-05 16:26:14,880 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4742 transitions. Word has length 230 [2025-02-05 16:26:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:14,880 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4742 transitions. [2025-02-05 16:26:14,881 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:26:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4742 transitions. [2025-02-05 16:26:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:26:14,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:14,883 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:26:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:26:14,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1006211798, now seen corresponding path program 1 times [2025-02-05 16:26:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:14,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792172907] [2025-02-05 16:26:14,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:14,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:15,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:26:15,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:26:15,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:15,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:15,482 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:26:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792172907] [2025-02-05 16:26:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792172907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497821411] [2025-02-05 16:26:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:15,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:15,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:15,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:15,484 INFO L87 Difference]: Start difference. First operand 3668 states and 4742 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:26:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:16,005 INFO L93 Difference]: Finished difference Result 7333 states and 9486 transitions. [2025-02-05 16:26:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:26:16,006 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:26:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:16,019 INFO L225 Difference]: With dead ends: 7333 [2025-02-05 16:26:16,019 INFO L226 Difference]: Without dead ends: 3670 [2025-02-05 16:26:16,029 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:16,030 INFO L435 NwaCegarLoop]: 2927 mSDtfsCounter, 1022 mSDsluCounter, 7695 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 10622 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:16,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 10622 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:26:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-02-05 16:26:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-02-05 16:26:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2997 states have (on average 1.2138805472138805) internal successors, (3638), 3042 states have internal predecessors, (3638), 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:26:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4741 transitions. [2025-02-05 16:26:16,114 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4741 transitions. Word has length 230 [2025-02-05 16:26:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:16,114 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4741 transitions. [2025-02-05 16:26:16,114 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:26:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4741 transitions. [2025-02-05 16:26:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 16:26:16,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:16,116 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:26:16,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:26:16,116 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:16,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash 541198440, now seen corresponding path program 1 times [2025-02-05 16:26:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:16,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884562827] [2025-02-05 16:26:16,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:16,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 16:26:16,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 16:26:16,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:16,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:16,700 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:26:16,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:16,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884562827] [2025-02-05 16:26:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884562827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:16,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779073501] [2025-02-05 16:26:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:16,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:16,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:16,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:16,702 INFO L87 Difference]: Start difference. First operand 3668 states and 4741 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:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:17,628 INFO L93 Difference]: Finished difference Result 7465 states and 9632 transitions. [2025-02-05 16:26:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:17,629 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:26:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:17,641 INFO L225 Difference]: With dead ends: 7465 [2025-02-05 16:26:17,641 INFO L226 Difference]: Without dead ends: 3802 [2025-02-05 16:26:17,651 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:17,652 INFO L435 NwaCegarLoop]: 3007 mSDtfsCounter, 4307 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4307 SdHoareTripleChecker+Valid, 7337 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:17,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4307 Valid, 7337 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:26:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-02-05 16:26:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3666. [2025-02-05 16:26:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2996 states have (on average 1.213618157543391) internal successors, (3636), 3041 states have internal predecessors, (3636), 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:26:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4737 transitions. [2025-02-05 16:26:17,733 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4737 transitions. Word has length 233 [2025-02-05 16:26:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:17,734 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 4737 transitions. [2025-02-05 16:26:17,734 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:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4737 transitions. [2025-02-05 16:26:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-05 16:26:17,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:17,736 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:26:17,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:26:17,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:17,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 728584291, now seen corresponding path program 1 times [2025-02-05 16:26:17,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:17,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094016935] [2025-02-05 16:26:17,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:18,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-05 16:26:18,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-05 16:26:18,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:18,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:18,390 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:26:18,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:18,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094016935] [2025-02-05 16:26:18,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094016935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:18,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:18,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884840781] [2025-02-05 16:26:18,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:18,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:18,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:18,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:18,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:18,392 INFO L87 Difference]: Start difference. First operand 3666 states and 4737 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:26:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:19,296 INFO L93 Difference]: Finished difference Result 7463 states and 9625 transitions. [2025-02-05 16:26:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:19,296 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:26:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:19,312 INFO L225 Difference]: With dead ends: 7463 [2025-02-05 16:26:19,312 INFO L226 Difference]: Without dead ends: 3802 [2025-02-05 16:26:19,325 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:19,325 INFO L435 NwaCegarLoop]: 2908 mSDtfsCounter, 4502 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 6918 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:19,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 6918 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:26:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-02-05 16:26:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3664. [2025-02-05 16:26:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3664 states, 2995 states have (on average 1.213355592654424) internal successors, (3634), 3040 states have internal predecessors, (3634), 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:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4733 transitions. [2025-02-05 16:26:19,422 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 4733 transitions. Word has length 234 [2025-02-05 16:26:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:19,423 INFO L471 AbstractCegarLoop]: Abstraction has 3664 states and 4733 transitions. [2025-02-05 16:26:19,423 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:26:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 4733 transitions. [2025-02-05 16:26:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 16:26:19,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:19,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, 1, 1, 1, 1, 1] [2025-02-05 16:26:19,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:26:19,425 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:19,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash -652305719, now seen corresponding path program 1 times [2025-02-05 16:26:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:19,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279016387] [2025-02-05 16:26:19,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:19,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 16:26:19,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 16:26:19,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:19,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:20,106 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:26:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279016387] [2025-02-05 16:26:20,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279016387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:20,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:20,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576195389] [2025-02-05 16:26:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:20,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:20,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:20,108 INFO L87 Difference]: Start difference. First operand 3664 states and 4733 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:26:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:20,649 INFO L93 Difference]: Finished difference Result 7323 states and 9465 transitions. [2025-02-05 16:26:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:20,652 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:26:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:20,673 INFO L225 Difference]: With dead ends: 7323 [2025-02-05 16:26:20,673 INFO L226 Difference]: Without dead ends: 3664 [2025-02-05 16:26:20,689 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:20,690 INFO L435 NwaCegarLoop]: 3031 mSDtfsCounter, 2493 mSDsluCounter, 5232 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 8263 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:20,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2493 Valid, 8263 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:26:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-02-05 16:26:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3662. [2025-02-05 16:26:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2994 states have (on average 1.2130928523714095) internal successors, (3632), 3039 states have internal predecessors, (3632), 549 states have call successors, (549), 118 states have call predecessors, (549), 118 states have return successors, (548), 528 states have call predecessors, (548), 548 states have call successors, (548) [2025-02-05 16:26:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4729 transitions. [2025-02-05 16:26:20,798 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4729 transitions. Word has length 235 [2025-02-05 16:26:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:20,798 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 4729 transitions. [2025-02-05 16:26:20,798 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:26:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4729 transitions. [2025-02-05 16:26:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 16:26:20,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:20,800 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:26:20,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:26:20,801 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:20,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1843572456, now seen corresponding path program 1 times [2025-02-05 16:26:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:20,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645998774] [2025-02-05 16:26:20,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms