./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1e7a931f8678a52ab26f5a1b74bb59e33ef4ed9c03430a4d28342e1a824b13d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:58:59,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:58:59,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:58:59,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:58:59,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:58:59,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:58:59,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:58:59,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:58:59,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:58:59,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:58:59,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:58:59,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:58:59,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:58:59,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:58:59,496 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:58:59,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:58:59,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:58:59,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:58:59,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:58:59,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:58:59,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:58:59,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:58:59,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:58:59,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:58:59,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:58:59,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:58:59,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:58:59,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:58:59,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:58:59,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:58:59,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:58:59,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:58:59,499 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1e7a931f8678a52ab26f5a1b74bb59e33ef4ed9c03430a4d28342e1a824b13d [2025-03-03 14:58:59,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:58:59,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:58:59,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:58:59,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:58:59,746 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:58:59,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-2.c [2025-03-03 14:59:00,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35656726/fff620729cc2413b9194d078913db484/FLAG49bfe8ad7 [2025-03-03 14:59:01,276 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:59:01,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-2.c [2025-03-03 14:59:01,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35656726/fff620729cc2413b9194d078913db484/FLAG49bfe8ad7 [2025-03-03 14:59:01,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35656726/fff620729cc2413b9194d078913db484 [2025-03-03 14:59:01,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:59:01,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:59:01,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:59:01,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:59:01,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:59:01,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:59:01" (1/1) ... [2025-03-03 14:59:01,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99c01a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:01, skipping insertion in model container [2025-03-03 14:59:01,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:59:01" (1/1) ... [2025-03-03 14:59:01,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:59:01,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-2.c[1870,1883] [2025-03-03 14:59:01,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:59:01,977 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:59:01,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.ok2.i","-S") [42] [2025-03-03 14:59:01,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-2.c[1870,1883] [2025-03-03 14:59:02,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:59:02,236 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:59:02,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02 WrapperNode [2025-03-03 14:59:02,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:59:02,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:59:02,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:59:02,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:59:02,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,476 INFO L138 Inliner]: procedures = 99, calls = 2725, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 8471 [2025-03-03 14:59:02,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:59:02,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:59:02,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:59:02,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:59:02,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,592 INFO L175 MemorySlicer]: Split 2332 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46]. 4 percent of accesses are in the largest equivalence class. The 338 initializations are split as follows [2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]. The 402 writes are split as follows [0, 7, 7, 7, 7, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6]. [2025-03-03 14:59:02,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:59:02,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:59:02,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:59:02,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:59:02,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (1/1) ... [2025-03-03 14:59:02,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:59:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:02,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:59:02,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:59:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-03-03 14:59:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-03-03 14:59:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-03-03 14:59:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-03-03 14:59:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:59:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:59:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:59:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:59:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:59:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 14:59:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 14:59:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 14:59:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 14:59:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 14:59:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 14:59:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-03 14:59:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-03 14:59:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-03 14:59:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-03 14:59:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-03 14:59:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-03-03 14:59:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-03-03 14:59:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-03-03 14:59:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-03-03 14:59:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-03-03 14:59:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-03-03 14:59:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-03-03 14:59:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-03-03 14:59:02,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-03-03 14:59:02,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-03 14:59:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-03-03 14:59:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-03-03 14:59:02,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-03-03 14:59:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-03-03 14:59:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-03-03 14:59:02,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-03-03 14:59:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_nxtcolorsensor_mode [2025-03-03 14:59:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_nxtcolorsensor_mode [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-03-03 14:59:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-03-03 14:59:02,913 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-03-03 14:59:02,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:59:02,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:59:03,434 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:59:03,437 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:59:12,429 INFO L? ?]: Removed 939 outVars from TransFormulas that were not future-live. [2025-03-03 14:59:12,430 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:59:12,480 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:59:12,482 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:59:12,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:12 BoogieIcfgContainer [2025-03-03 14:59:12,482 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:59:12,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:59:12,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:59:12,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:59:12,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:59:01" (1/3) ... [2025-03-03 14:59:12,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f432ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:12, skipping insertion in model container [2025-03-03 14:59:12,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:02" (2/3) ... [2025-03-03 14:59:12,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f432ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:12, skipping insertion in model container [2025-03-03 14:59:12,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:12" (3/3) ... [2025-03-03 14:59:12,491 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.2-2.c [2025-03-03 14:59:12,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:59:12,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.2-2.c that has 46 procedures, 2460 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:59:12,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:59:12,605 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;@131739b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:59:12,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:59:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 2460 states, 2109 states have (on average 1.4803224276908487) internal successors, (3122), 2133 states have internal predecessors, (3122), 304 states have call successors, (304), 45 states have call predecessors, (304), 45 states have return successors, (304), 294 states have call predecessors, (304), 304 states have call successors, (304) [2025-03-03 14:59:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:59:12,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:12,635 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-03-03 14:59:12,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:12,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1771111513, now seen corresponding path program 1 times [2025-03-03 14:59:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017000594] [2025-03-03 14:59:12,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:13,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:59:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:59:13,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:13,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:59:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017000594] [2025-03-03 14:59:13,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017000594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:13,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:13,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:59:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519166871] [2025-03-03 14:59:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:13,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:59:13,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:13,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:59:13,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:59:13,710 INFO L87 Difference]: Start difference. First operand has 2460 states, 2109 states have (on average 1.4803224276908487) internal successors, (3122), 2133 states have internal predecessors, (3122), 304 states have call successors, (304), 45 states have call predecessors, (304), 45 states have return successors, (304), 294 states have call predecessors, (304), 304 states have call successors, (304) 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-03-03 14:59:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:13,919 INFO L93 Difference]: Finished difference Result 4911 states and 7706 transitions. [2025-03-03 14:59:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:59:13,921 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-03-03 14:59:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:13,951 INFO L225 Difference]: With dead ends: 4911 [2025-03-03 14:59:13,952 INFO L226 Difference]: Without dead ends: 2447 [2025-03-03 14:59:13,977 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-03-03 14:59:13,979 INFO L435 NwaCegarLoop]: 3034 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, 3034 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-03-03 14:59:13,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3034 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:59:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-03-03 14:59:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2447. [2025-03-03 14:59:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2097 states have (on average 1.1530758226037197) internal successors, (2418), 2121 states have internal predecessors, (2418), 304 states have call successors, (304), 45 states have call predecessors, (304), 45 states have return successors, (303), 293 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-03 14:59:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3025 transitions. [2025-03-03 14:59:14,154 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3025 transitions. Word has length 148 [2025-03-03 14:59:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:14,155 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3025 transitions. [2025-03-03 14:59:14,156 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-03-03 14:59:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3025 transitions. [2025-03-03 14:59:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:59:14,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:14,170 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-03-03 14:59:14,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:59:14,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:14,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash -372894925, now seen corresponding path program 1 times [2025-03-03 14:59:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:14,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536027527] [2025-03-03 14:59:14,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:14,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:14,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:14,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:59:15,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:15,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536027527] [2025-03-03 14:59:15,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536027527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:15,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:15,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814242802] [2025-03-03 14:59:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:15,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:15,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:15,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:15,678 INFO L87 Difference]: Start difference. First operand 2447 states and 3025 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-03-03 14:59:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:18,388 INFO L93 Difference]: Finished difference Result 5548 states and 6959 transitions. [2025-03-03 14:59:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:18,388 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-03-03 14:59:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:18,406 INFO L225 Difference]: With dead ends: 5548 [2025-03-03 14:59:18,407 INFO L226 Difference]: Without dead ends: 3106 [2025-03-03 14:59:18,422 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-03-03 14:59:18,423 INFO L435 NwaCegarLoop]: 3639 mSDtfsCounter, 5804 mSDsluCounter, 4588 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5804 SdHoareTripleChecker+Valid, 8227 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:18,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5804 Valid, 8227 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 14:59:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-03 14:59:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2970. [2025-03-03 14:59:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2970 states, 2472 states have (on average 1.186084142394822) internal successors, (2932), 2502 states have internal predecessors, (2932), 419 states have call successors, (419), 78 states have call predecessors, (419), 78 states have return successors, (418), 404 states have call predecessors, (418), 418 states have call successors, (418) [2025-03-03 14:59:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 3769 transitions. [2025-03-03 14:59:18,571 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 3769 transitions. Word has length 208 [2025-03-03 14:59:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:18,571 INFO L471 AbstractCegarLoop]: Abstraction has 2970 states and 3769 transitions. [2025-03-03 14:59:18,572 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-03-03 14:59:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 3769 transitions. [2025-03-03 14:59:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:59:18,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:18,576 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-03-03 14:59:18,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:59:18,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:18,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash -728444218, now seen corresponding path program 1 times [2025-03-03 14:59:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:18,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346508499] [2025-03-03 14:59:18,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:19,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:19,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:19,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:19,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:59:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:19,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346508499] [2025-03-03 14:59:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346508499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:19,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473113488] [2025-03-03 14:59:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:19,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:19,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:19,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:19,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:19,773 INFO L87 Difference]: Start difference. First operand 2970 states and 3769 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-03-03 14:59:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:22,227 INFO L93 Difference]: Finished difference Result 6447 states and 8240 transitions. [2025-03-03 14:59:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:22,228 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-03-03 14:59:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:22,250 INFO L225 Difference]: With dead ends: 6447 [2025-03-03 14:59:22,250 INFO L226 Difference]: Without dead ends: 3482 [2025-03-03 14:59:22,267 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-03-03 14:59:22,269 INFO L435 NwaCegarLoop]: 3516 mSDtfsCounter, 5708 mSDsluCounter, 4570 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5708 SdHoareTripleChecker+Valid, 8086 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:22,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5708 Valid, 8086 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 14:59:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2025-03-03 14:59:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 3344. [2025-03-03 14:59:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3344 states, 2748 states have (on average 1.205604075691412) internal successors, (3313), 2787 states have internal predecessors, (3313), 496 states have call successors, (496), 99 states have call predecessors, (496), 99 states have return successors, (495), 477 states have call predecessors, (495), 495 states have call successors, (495) [2025-03-03 14:59:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 4304 transitions. [2025-03-03 14:59:22,429 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 4304 transitions. Word has length 209 [2025-03-03 14:59:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:22,430 INFO L471 AbstractCegarLoop]: Abstraction has 3344 states and 4304 transitions. [2025-03-03 14:59:22,430 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-03-03 14:59:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 4304 transitions. [2025-03-03 14:59:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 14:59:22,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:22,440 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-03-03 14:59:22,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:59:22,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:22,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1344426843, now seen corresponding path program 1 times [2025-03-03 14:59:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785789139] [2025-03-03 14:59:22,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:22,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 14:59:22,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 14:59:22,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:22,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:59:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785789139] [2025-03-03 14:59:24,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785789139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:24,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:24,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:59:24,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116566670] [2025-03-03 14:59:24,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:24,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:24,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:24,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:59:24,127 INFO L87 Difference]: Start difference. First operand 3344 states and 4304 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-03-03 14:59:26,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:26,135 INFO L93 Difference]: Finished difference Result 7057 states and 9144 transitions. [2025-03-03 14:59:26,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:26,135 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-03-03 14:59:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:26,160 INFO L225 Difference]: With dead ends: 7057 [2025-03-03 14:59:26,160 INFO L226 Difference]: Without dead ends: 3718 [2025-03-03 14:59:26,175 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-03-03 14:59:26,176 INFO L435 NwaCegarLoop]: 3410 mSDtfsCounter, 3656 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3656 SdHoareTripleChecker+Valid, 6748 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:26,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3656 Valid, 6748 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:59:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2025-03-03 14:59:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2025-03-03 14:59:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 3023 states have (on average 1.2216341382732385) internal successors, (3693), 3068 states have internal predecessors, (3693), 573 states have call successors, (573), 119 states have call predecessors, (573), 119 states have return successors, (572), 552 states have call predecessors, (572), 572 states have call successors, (572) [2025-03-03 14:59:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 4838 transitions. [2025-03-03 14:59:26,305 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 4838 transitions. Word has length 205 [2025-03-03 14:59:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:26,305 INFO L471 AbstractCegarLoop]: Abstraction has 3716 states and 4838 transitions. [2025-03-03 14:59:26,306 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-03-03 14:59:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 4838 transitions. [2025-03-03 14:59:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:59:26,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:26,311 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-03-03 14:59:26,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:59:26,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:26,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 972434935, now seen corresponding path program 1 times [2025-03-03 14:59:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431658833] [2025-03-03 14:59:26,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:26,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:26,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:26,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:26,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:59:27,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:27,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431658833] [2025-03-03 14:59:27,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431658833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:27,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641867065] [2025-03-03 14:59:27,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:27,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:27,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:27,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:27,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:59:27,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:28,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:28,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:28,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:28,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:59:28,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:59:28,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641867065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:28,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015368239] [2025-03-03 14:59:28,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:28,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:28,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:28,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:28,373 INFO L87 Difference]: Start difference. First operand 3716 states and 4838 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-03-03 14:59:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:30,069 INFO L93 Difference]: Finished difference Result 7664 states and 9961 transitions. [2025-03-03 14:59:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:30,072 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-03-03 14:59:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:30,095 INFO L225 Difference]: With dead ends: 7664 [2025-03-03 14:59:30,096 INFO L226 Difference]: Without dead ends: 3839 [2025-03-03 14:59:30,112 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-03-03 14:59:30,113 INFO L435 NwaCegarLoop]: 3588 mSDtfsCounter, 1465 mSDsluCounter, 8380 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 11968 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:30,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 11968 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 14:59:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2025-03-03 14:59:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3703. [2025-03-03 14:59:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3703 states, 3015 states have (on average 1.2202321724709784) internal successors, (3679), 3060 states have internal predecessors, (3679), 568 states have call successors, (568), 119 states have call predecessors, (568), 119 states have return successors, (567), 547 states have call predecessors, (567), 567 states have call successors, (567) [2025-03-03 14:59:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 4814 transitions. [2025-03-03 14:59:30,244 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 4814 transitions. Word has length 208 [2025-03-03 14:59:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:30,245 INFO L471 AbstractCegarLoop]: Abstraction has 3703 states and 4814 transitions. [2025-03-03 14:59:30,245 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-03-03 14:59:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 4814 transitions. [2025-03-03 14:59:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:59:30,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:30,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:30,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:59:30,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:30,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:30,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:30,450 INFO L85 PathProgramCache]: Analyzing trace with hash 163357529, now seen corresponding path program 1 times [2025-03-03 14:59:30,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571121994] [2025-03-03 14:59:30,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:30,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:30,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:30,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:30,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:30,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:59:31,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571121994] [2025-03-03 14:59:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571121994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102428664] [2025-03-03 14:59:31,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:31,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:31,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:31,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:31,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:59:31,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:32,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:32,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:32,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:32,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:32,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:59:32,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:32,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102428664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:32,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415115853] [2025-03-03 14:59:32,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:32,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:32,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:32,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:32,253 INFO L87 Difference]: Start difference. First operand 3703 states and 4814 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-03-03 14:59:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:33,283 INFO L93 Difference]: Finished difference Result 7595 states and 9856 transitions. [2025-03-03 14:59:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:33,283 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-03-03 14:59:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:33,303 INFO L225 Difference]: With dead ends: 7595 [2025-03-03 14:59:33,303 INFO L226 Difference]: Without dead ends: 3831 [2025-03-03 14:59:33,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:33,316 INFO L435 NwaCegarLoop]: 3566 mSDtfsCounter, 1170 mSDsluCounter, 6431 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 9997 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:33,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 9997 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:59:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2025-03-03 14:59:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3693. [2025-03-03 14:59:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3009 states have (on average 1.2190096377534065) internal successors, (3668), 3054 states have internal predecessors, (3668), 564 states have call successors, (564), 119 states have call predecessors, (564), 119 states have return successors, (563), 543 states have call predecessors, (563), 563 states have call successors, (563) [2025-03-03 14:59:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 4795 transitions. [2025-03-03 14:59:33,425 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 4795 transitions. Word has length 209 [2025-03-03 14:59:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:33,426 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 4795 transitions. [2025-03-03 14:59:33,426 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-03-03 14:59:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 4795 transitions. [2025-03-03 14:59:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:59:33,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:33,430 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-03-03 14:59:33,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:59:33,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 14:59:33,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:33,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1100471382, now seen corresponding path program 1 times [2025-03-03 14:59:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:33,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987271621] [2025-03-03 14:59:33,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:33,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:33,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:33,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:33,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:59:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987271621] [2025-03-03 14:59:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987271621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142898284] [2025-03-03 14:59:34,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:34,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:34,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:34,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:34,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:59:35,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:35,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:35,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:35,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:35,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 2850 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:35,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:59:35,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:35,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142898284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:35,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:35,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586750488] [2025-03-03 14:59:35,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:35,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:35,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:35,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:35,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:35,351 INFO L87 Difference]: Start difference. First operand 3693 states and 4795 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-03-03 14:59:36,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:36,583 INFO L93 Difference]: Finished difference Result 8184 states and 10623 transitions. [2025-03-03 14:59:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:36,584 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-03-03 14:59:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:36,603 INFO L225 Difference]: With dead ends: 8184 [2025-03-03 14:59:36,603 INFO L226 Difference]: Without dead ends: 4496 [2025-03-03 14:59:36,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:36,616 INFO L435 NwaCegarLoop]: 3773 mSDtfsCounter, 1737 mSDsluCounter, 8851 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 12624 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:36,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 12624 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:59:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2025-03-03 14:59:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4167. [2025-03-03 14:59:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4167 states, 3351 states have (on average 1.23455684870188) internal successors, (4137), 3407 states have internal predecessors, (4137), 672 states have call successors, (672), 142 states have call predecessors, (672), 143 states have return successors, (672), 647 states have call predecessors, (672), 671 states have call successors, (672) [2025-03-03 14:59:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 5481 transitions. [2025-03-03 14:59:36,734 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 5481 transitions. Word has length 210 [2025-03-03 14:59:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:36,734 INFO L471 AbstractCegarLoop]: Abstraction has 4167 states and 5481 transitions. [2025-03-03 14:59:36,735 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-03-03 14:59:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 5481 transitions. [2025-03-03 14:59:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:59:36,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:36,740 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-03-03 14:59:36,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:59:36,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:36,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:36,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1087478560, now seen corresponding path program 1 times [2025-03-03 14:59:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693306995] [2025-03-03 14:59:36,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:37,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:37,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:37,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:37,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:59:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693306995] [2025-03-03 14:59:37,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693306995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054463619] [2025-03-03 14:59:37,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:37,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:37,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:37,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:37,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:59:38,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:38,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:38,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:38,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:38,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:38,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:59:38,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054463619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:38,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:38,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833857475] [2025-03-03 14:59:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:38,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:38,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:38,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:38,812 INFO L87 Difference]: Start difference. First operand 4167 states and 5481 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-03-03 14:59:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:39,697 INFO L93 Difference]: Finished difference Result 8331 states and 10964 transitions. [2025-03-03 14:59:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:39,698 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-03-03 14:59:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:39,718 INFO L225 Difference]: With dead ends: 8331 [2025-03-03 14:59:39,718 INFO L226 Difference]: Without dead ends: 4169 [2025-03-03 14:59:39,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:39,730 INFO L435 NwaCegarLoop]: 2937 mSDtfsCounter, 1039 mSDsluCounter, 5737 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 8674 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:39,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 8674 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:59:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2025-03-03 14:59:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 4167. [2025-03-03 14:59:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4167 states, 3351 states have (on average 1.2342584303193076) internal successors, (4136), 3407 states have internal predecessors, (4136), 672 states have call successors, (672), 142 states have call predecessors, (672), 143 states have return successors, (672), 647 states have call predecessors, (672), 671 states have call successors, (672) [2025-03-03 14:59:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 5480 transitions. [2025-03-03 14:59:39,837 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 5480 transitions. Word has length 210 [2025-03-03 14:59:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:39,837 INFO L471 AbstractCegarLoop]: Abstraction has 4167 states and 5480 transitions. [2025-03-03 14:59:39,837 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-03-03 14:59:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 5480 transitions. [2025-03-03 14:59:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:39,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:39,843 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-03-03 14:59:39,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:59:40,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:40,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash 249515766, now seen corresponding path program 1 times [2025-03-03 14:59:40,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:40,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974133829] [2025-03-03 14:59:40,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:40,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:40,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:40,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:40,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:59:40,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:40,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974133829] [2025-03-03 14:59:40,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974133829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:40,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:40,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:40,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962298625] [2025-03-03 14:59:40,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:40,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:40,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:40,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:40,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:40,692 INFO L87 Difference]: Start difference. First operand 4167 states and 5480 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-03-03 14:59:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:42,506 INFO L93 Difference]: Finished difference Result 7849 states and 10260 transitions. [2025-03-03 14:59:42,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:42,507 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-03-03 14:59:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:42,524 INFO L225 Difference]: With dead ends: 7849 [2025-03-03 14:59:42,524 INFO L226 Difference]: Without dead ends: 3687 [2025-03-03 14:59:42,537 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-03-03 14:59:42,537 INFO L435 NwaCegarLoop]: 3480 mSDtfsCounter, 6644 mSDsluCounter, 2639 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6644 SdHoareTripleChecker+Valid, 6119 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:42,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6644 Valid, 6119 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 14:59:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2025-03-03 14:59:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3685. [2025-03-03 14:59:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 3004 states have (on average 1.2173768308921438) internal successors, (3657), 3049 states have internal predecessors, (3657), 561 states have call successors, (561), 119 states have call predecessors, (561), 119 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-03-03 14:59:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4778 transitions. [2025-03-03 14:59:42,637 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4778 transitions. Word has length 220 [2025-03-03 14:59:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:42,637 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4778 transitions. [2025-03-03 14:59:42,638 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-03-03 14:59:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4778 transitions. [2025-03-03 14:59:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:42,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:42,641 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-03-03 14:59:42,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:59:42,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:42,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1408801088, now seen corresponding path program 1 times [2025-03-03 14:59:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439681650] [2025-03-03 14:59:42,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:42,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:42,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:42,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:42,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:59:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439681650] [2025-03-03 14:59:43,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439681650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968562463] [2025-03-03 14:59:43,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:43,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:43,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:43,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:43,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:59:44,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:44,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:44,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:44,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:44,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 2876 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:44,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:59:44,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:44,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968562463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:44,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:44,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 14:59:44,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488377582] [2025-03-03 14:59:44,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:44,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:44,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:44,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:44,423 INFO L87 Difference]: Start difference. First operand 3685 states and 4778 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-03-03 14:59:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:45,550 INFO L93 Difference]: Finished difference Result 7365 states and 9555 transitions. [2025-03-03 14:59:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:45,554 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-03-03 14:59:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:45,573 INFO L225 Difference]: With dead ends: 7365 [2025-03-03 14:59:45,573 INFO L226 Difference]: Without dead ends: 3685 [2025-03-03 14:59:45,584 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-03-03 14:59:45,584 INFO L435 NwaCegarLoop]: 3054 mSDtfsCounter, 2498 mSDsluCounter, 4052 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2498 SdHoareTripleChecker+Valid, 7106 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:45,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2498 Valid, 7106 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:59:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2025-03-03 14:59:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3683. [2025-03-03 14:59:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3683 states, 3003 states have (on average 1.217116217116217) internal successors, (3655), 3048 states have internal predecessors, (3655), 560 states have call successors, (560), 119 states have call predecessors, (560), 119 states have return successors, (559), 539 states have call predecessors, (559), 559 states have call successors, (559) [2025-03-03 14:59:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4774 transitions. [2025-03-03 14:59:45,687 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4774 transitions. Word has length 220 [2025-03-03 14:59:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:45,688 INFO L471 AbstractCegarLoop]: Abstraction has 3683 states and 4774 transitions. [2025-03-03 14:59:45,689 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-03-03 14:59:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4774 transitions. [2025-03-03 14:59:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:45,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:45,693 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-03-03 14:59:45,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:59:45,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:59:45,894 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:45,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1590993722, now seen corresponding path program 1 times [2025-03-03 14:59:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:45,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997236159] [2025-03-03 14:59:45,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:46,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:46,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:46,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:46,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:59:46,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:46,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997236159] [2025-03-03 14:59:46,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997236159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:46,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:46,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:46,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536059231] [2025-03-03 14:59:46,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:46,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:46,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:46,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:46,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:46,691 INFO L87 Difference]: Start difference. First operand 3683 states and 4774 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-03-03 14:59:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:48,076 INFO L93 Difference]: Finished difference Result 7363 states and 9549 transitions. [2025-03-03 14:59:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:48,077 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-03-03 14:59:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:48,090 INFO L225 Difference]: With dead ends: 7363 [2025-03-03 14:59:48,090 INFO L226 Difference]: Without dead ends: 3685 [2025-03-03 14:59:48,099 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-03-03 14:59:48,100 INFO L435 NwaCegarLoop]: 3382 mSDtfsCounter, 4422 mSDsluCounter, 3308 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 6690 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:48,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 6690 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:59:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2025-03-03 14:59:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3683. [2025-03-03 14:59:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3683 states, 3003 states have (on average 1.2167832167832169) internal successors, (3654), 3048 states have internal predecessors, (3654), 560 states have call successors, (560), 119 states have call predecessors, (560), 119 states have return successors, (559), 539 states have call predecessors, (559), 559 states have call successors, (559) [2025-03-03 14:59:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4773 transitions. [2025-03-03 14:59:48,191 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4773 transitions. Word has length 220 [2025-03-03 14:59:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:48,192 INFO L471 AbstractCegarLoop]: Abstraction has 3683 states and 4773 transitions. [2025-03-03 14:59:48,192 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-03-03 14:59:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4773 transitions. [2025-03-03 14:59:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 14:59:48,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:48,195 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-03-03 14:59:48,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:59:48,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:48,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1907858860, now seen corresponding path program 1 times [2025-03-03 14:59:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:48,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647903135] [2025-03-03 14:59:48,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:48,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:48,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 14:59:48,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 14:59:48,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:48,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:59:48,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647903135] [2025-03-03 14:59:48,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647903135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:48,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:48,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:48,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899215204] [2025-03-03 14:59:48,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:48,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:48,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:48,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:48,798 INFO L87 Difference]: Start difference. First operand 3683 states and 4773 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-03-03 14:59:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:50,489 INFO L93 Difference]: Finished difference Result 7495 states and 9695 transitions. [2025-03-03 14:59:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:50,489 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-03-03 14:59:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:50,507 INFO L225 Difference]: With dead ends: 7495 [2025-03-03 14:59:50,507 INFO L226 Difference]: Without dead ends: 3817 [2025-03-03 14:59:50,518 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-03-03 14:59:50,519 INFO L435 NwaCegarLoop]: 3615 mSDtfsCounter, 5806 mSDsluCounter, 4568 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5806 SdHoareTripleChecker+Valid, 8183 SdHoareTripleChecker+Invalid, 2511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:50,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5806 Valid, 8183 Invalid, 2511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:59:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2025-03-03 14:59:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3681. [2025-03-03 14:59:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3002 states have (on average 1.2165223184543636) internal successors, (3652), 3047 states have internal predecessors, (3652), 559 states have call successors, (559), 119 states have call predecessors, (559), 119 states have return successors, (558), 538 states have call predecessors, (558), 558 states have call successors, (558) [2025-03-03 14:59:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4769 transitions. [2025-03-03 14:59:50,626 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4769 transitions. Word has length 223 [2025-03-03 14:59:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:50,627 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4769 transitions. [2025-03-03 14:59:50,627 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-03-03 14:59:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4769 transitions. [2025-03-03 14:59:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 14:59:50,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:50,630 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-03-03 14:59:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:59:50,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:50,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1205632504, now seen corresponding path program 1 times [2025-03-03 14:59:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:50,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762856018] [2025-03-03 14:59:50,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:50,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:50,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 14:59:50,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 14:59:50,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:50,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:59:51,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762856018] [2025-03-03 14:59:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762856018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:51,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:51,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552535519] [2025-03-03 14:59:51,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:51,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:51,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:51,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:51,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:51,281 INFO L87 Difference]: Start difference. First operand 3681 states and 4769 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (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-03-03 14:59:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:52,860 INFO L93 Difference]: Finished difference Result 7491 states and 9687 transitions. [2025-03-03 14:59:52,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:52,861 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-03-03 14:59:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:52,875 INFO L225 Difference]: With dead ends: 7491 [2025-03-03 14:59:52,875 INFO L226 Difference]: Without dead ends: 3815 [2025-03-03 14:59:52,886 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-03-03 14:59:52,886 INFO L435 NwaCegarLoop]: 3493 mSDtfsCounter, 3717 mSDsluCounter, 5424 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3717 SdHoareTripleChecker+Valid, 8917 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:52,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3717 Valid, 8917 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 14:59:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2025-03-03 14:59:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3677. [2025-03-03 14:59:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3000 states have (on average 1.216) internal successors, (3648), 3045 states have internal predecessors, (3648), 557 states have call successors, (557), 119 states have call predecessors, (557), 119 states have return successors, (556), 536 states have call predecessors, (556), 556 states have call successors, (556) [2025-03-03 14:59:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4761 transitions. [2025-03-03 14:59:52,985 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4761 transitions. Word has length 224 [2025-03-03 14:59:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:52,986 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 4761 transitions. [2025-03-03 14:59:52,986 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-03-03 14:59:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4761 transitions. [2025-03-03 14:59:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 14:59:52,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:52,989 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-03-03 14:59:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:59:52,989 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -97683213, now seen corresponding path program 1 times [2025-03-03 14:59:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434881472] [2025-03-03 14:59:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:53,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 14:59:53,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 14:59:53,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:53,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:59:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434881472] [2025-03-03 14:59:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434881472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:53,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268880639] [2025-03-03 14:59:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:53,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:53,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:53,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:53,640 INFO L87 Difference]: Start difference. First operand 3677 states and 4761 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-03-03 14:59:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:55,066 INFO L93 Difference]: Finished difference Result 7347 states and 9519 transitions. [2025-03-03 14:59:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:55,066 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-03-03 14:59:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:55,079 INFO L225 Difference]: With dead ends: 7347 [2025-03-03 14:59:55,079 INFO L226 Difference]: Without dead ends: 3675 [2025-03-03 14:59:55,090 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-03-03 14:59:55,090 INFO L435 NwaCegarLoop]: 3467 mSDtfsCounter, 4651 mSDsluCounter, 3448 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4651 SdHoareTripleChecker+Valid, 6915 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:55,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4651 Valid, 6915 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:59:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2025-03-03 14:59:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3673. [2025-03-03 14:59:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3673 states, 2998 states have (on average 1.2154769846564377) internal successors, (3644), 3043 states have internal predecessors, (3644), 555 states have call successors, (555), 119 states have call predecessors, (555), 119 states have return successors, (554), 534 states have call predecessors, (554), 554 states have call successors, (554) [2025-03-03 14:59:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4753 transitions. [2025-03-03 14:59:55,189 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4753 transitions. Word has length 225 [2025-03-03 14:59:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:55,190 INFO L471 AbstractCegarLoop]: Abstraction has 3673 states and 4753 transitions. [2025-03-03 14:59:55,190 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-03-03 14:59:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4753 transitions. [2025-03-03 14:59:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 14:59:55,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:55,192 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-03-03 14:59:55,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:59:55,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:55,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash 857538093, now seen corresponding path program 1 times [2025-03-03 14:59:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211896237] [2025-03-03 14:59:55,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:55,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 14:59:55,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 14:59:55,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:55,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:59:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211896237] [2025-03-03 14:59:55,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211896237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:55,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:55,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367458801] [2025-03-03 14:59:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:55,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:55,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:55,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:55,843 INFO L87 Difference]: Start difference. First operand 3673 states and 4753 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-03-03 14:59:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:57,318 INFO L93 Difference]: Finished difference Result 7343 states and 9507 transitions. [2025-03-03 14:59:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:57,319 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-03-03 14:59:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:57,333 INFO L225 Difference]: With dead ends: 7343 [2025-03-03 14:59:57,333 INFO L226 Difference]: Without dead ends: 3675 [2025-03-03 14:59:57,343 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-03-03 14:59:57,344 INFO L435 NwaCegarLoop]: 3361 mSDtfsCounter, 4389 mSDsluCounter, 3290 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4389 SdHoareTripleChecker+Valid, 6651 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:57,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4389 Valid, 6651 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:59:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2025-03-03 14:59:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3673. [2025-03-03 14:59:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3673 states, 2998 states have (on average 1.215143428952635) internal successors, (3643), 3043 states have internal predecessors, (3643), 555 states have call successors, (555), 119 states have call predecessors, (555), 119 states have return successors, (554), 534 states have call predecessors, (554), 554 states have call successors, (554) [2025-03-03 14:59:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4752 transitions. [2025-03-03 14:59:57,440 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4752 transitions. Word has length 225 [2025-03-03 14:59:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:57,441 INFO L471 AbstractCegarLoop]: Abstraction has 3673 states and 4752 transitions. [2025-03-03 14:59:57,441 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-03-03 14:59:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4752 transitions. [2025-03-03 14:59:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 14:59:57,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:57,443 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-03-03 14:59:57,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:59:57,444 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:57,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash 875728409, now seen corresponding path program 1 times [2025-03-03 14:59:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:57,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802710608] [2025-03-03 14:59:57,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:57,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:57,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 14:59:57,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 14:59:57,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:57,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:59:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:58,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802710608] [2025-03-03 14:59:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802710608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691636708] [2025-03-03 14:59:58,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:58,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:58,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:58,069 INFO L87 Difference]: Start difference. First operand 3673 states and 4752 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-03-03 14:59:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:59,577 INFO L93 Difference]: Finished difference Result 7475 states and 9653 transitions. [2025-03-03 14:59:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:59,578 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-03-03 14:59:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:59,592 INFO L225 Difference]: With dead ends: 7475 [2025-03-03 14:59:59,592 INFO L226 Difference]: Without dead ends: 3807 [2025-03-03 14:59:59,602 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-03-03 14:59:59,603 INFO L435 NwaCegarLoop]: 3594 mSDtfsCounter, 6872 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6872 SdHoareTripleChecker+Valid, 6357 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:59,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6872 Valid, 6357 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:59:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2025-03-03 14:59:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3671. [2025-03-03 14:59:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 2997 states have (on average 1.2148815482148816) internal successors, (3641), 3042 states have internal predecessors, (3641), 554 states have call successors, (554), 119 states have call predecessors, (554), 119 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553) [2025-03-03 14:59:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4748 transitions. [2025-03-03 14:59:59,754 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4748 transitions. Word has length 228 [2025-03-03 14:59:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:59,755 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 4748 transitions. [2025-03-03 14:59:59,755 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-03-03 14:59:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4748 transitions. [2025-03-03 14:59:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 14:59:59,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:59,758 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-03-03 14:59:59,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:59:59,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:59,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:59,760 INFO L85 PathProgramCache]: Analyzing trace with hash -926588913, now seen corresponding path program 1 times [2025-03-03 14:59:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:59,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770915239] [2025-03-03 14:59:59,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:00,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 15:00:00,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 15:00:00,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:00,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 15:00:00,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770915239] [2025-03-03 15:00:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770915239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:00,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:00,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:00,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908026356] [2025-03-03 15:00:00,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:00,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:00,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:00,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:00,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:00,412 INFO L87 Difference]: Start difference. First operand 3671 states and 4748 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-03-03 15:00:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:01,771 INFO L93 Difference]: Finished difference Result 7471 states and 9645 transitions. [2025-03-03 15:00:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:01,771 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-03-03 15:00:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:01,787 INFO L225 Difference]: With dead ends: 7471 [2025-03-03 15:00:01,787 INFO L226 Difference]: Without dead ends: 3805 [2025-03-03 15:00:01,797 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-03-03 15:00:01,798 INFO L435 NwaCegarLoop]: 3485 mSDtfsCounter, 4655 mSDsluCounter, 3577 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 7062 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:01,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 7062 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:00:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2025-03-03 15:00:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3667. [2025-03-03 15:00:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3667 states, 2995 states have (on average 1.214357262103506) internal successors, (3637), 3040 states have internal predecessors, (3637), 552 states have call successors, (552), 119 states have call predecessors, (552), 119 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-03-03 15:00:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 4740 transitions. [2025-03-03 15:00:01,940 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 4740 transitions. Word has length 229 [2025-03-03 15:00:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:01,941 INFO L471 AbstractCegarLoop]: Abstraction has 3667 states and 4740 transitions. [2025-03-03 15:00:01,941 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-03-03 15:00:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 4740 transitions. [2025-03-03 15:00:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 15:00:01,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:01,943 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-03-03 15:00:01,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:00:01,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:01,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash -325154278, now seen corresponding path program 1 times [2025-03-03 15:00:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:01,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553764199] [2025-03-03 15:00:01,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:02,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:00:02,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:00:02,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:02,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 15:00:02,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:02,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553764199] [2025-03-03 15:00:02,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553764199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:02,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:02,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245175159] [2025-03-03 15:00:02,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:02,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:02,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:02,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:02,569 INFO L87 Difference]: Start difference. First operand 3667 states and 4740 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-03-03 15:00:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:04,144 INFO L93 Difference]: Finished difference Result 7327 states and 9477 transitions. [2025-03-03 15:00:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:04,144 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-03-03 15:00:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:04,157 INFO L225 Difference]: With dead ends: 7327 [2025-03-03 15:00:04,158 INFO L226 Difference]: Without dead ends: 3665 [2025-03-03 15:00:04,169 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-03-03 15:00:04,169 INFO L435 NwaCegarLoop]: 3459 mSDtfsCounter, 4640 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4640 SdHoareTripleChecker+Valid, 6903 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:04,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4640 Valid, 6903 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:00:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2025-03-03 15:00:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3663. [2025-03-03 15:00:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3663 states, 2993 states have (on average 1.2138322753090545) internal successors, (3633), 3038 states have internal predecessors, (3633), 550 states have call successors, (550), 119 states have call predecessors, (550), 119 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-03-03 15:00:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3663 states and 4732 transitions. [2025-03-03 15:00:04,328 INFO L78 Accepts]: Start accepts. Automaton has 3663 states and 4732 transitions. Word has length 230 [2025-03-03 15:00:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:04,328 INFO L471 AbstractCegarLoop]: Abstraction has 3663 states and 4732 transitions. [2025-03-03 15:00:04,329 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-03-03 15:00:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3663 states and 4732 transitions. [2025-03-03 15:00:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 15:00:04,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:04,332 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-03-03 15:00:04,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:00:04,332 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:04,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1641796048, now seen corresponding path program 1 times [2025-03-03 15:00:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:04,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743818020] [2025-03-03 15:00:04,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:04,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:04,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:00:04,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:00:04,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:04,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:05,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:05,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743818020] [2025-03-03 15:00:05,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743818020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:05,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:05,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319422296] [2025-03-03 15:00:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:05,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:05,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:05,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:05,018 INFO L87 Difference]: Start difference. First operand 3663 states and 4732 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-03-03 15:00:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:05,556 INFO L93 Difference]: Finished difference Result 7323 states and 9464 transitions. [2025-03-03 15:00:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:05,556 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-03-03 15:00:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:05,572 INFO L225 Difference]: With dead ends: 7323 [2025-03-03 15:00:05,572 INFO L226 Difference]: Without dead ends: 3665 [2025-03-03 15:00:05,582 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-03-03 15:00:05,583 INFO L435 NwaCegarLoop]: 2921 mSDtfsCounter, 1783 mSDsluCounter, 5310 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 8231 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:05,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 8231 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:00:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2025-03-03 15:00:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3663. [2025-03-03 15:00:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3663 states, 2993 states have (on average 1.213498162378884) internal successors, (3632), 3038 states have internal predecessors, (3632), 550 states have call successors, (550), 119 states have call predecessors, (550), 119 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-03-03 15:00:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3663 states and 4731 transitions. [2025-03-03 15:00:05,684 INFO L78 Accepts]: Start accepts. Automaton has 3663 states and 4731 transitions. Word has length 230 [2025-03-03 15:00:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:05,684 INFO L471 AbstractCegarLoop]: Abstraction has 3663 states and 4731 transitions. [2025-03-03 15:00:05,684 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-03-03 15:00:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3663 states and 4731 transitions. [2025-03-03 15:00:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 15:00:05,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:05,686 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-03-03 15:00:05,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:00:05,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:05,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1512708940, now seen corresponding path program 1 times [2025-03-03 15:00:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:05,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083261593] [2025-03-03 15:00:05,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:05,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:05,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 15:00:06,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 15:00:06,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:06,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:06,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083261593] [2025-03-03 15:00:06,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083261593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:06,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:06,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599408221] [2025-03-03 15:00:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:06,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:06,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:06,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:06,276 INFO L87 Difference]: Start difference. First operand 3663 states and 4731 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-03-03 15:00:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:06,761 INFO L93 Difference]: Finished difference Result 7455 states and 9610 transitions. [2025-03-03 15:00:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:06,761 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-03-03 15:00:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:06,777 INFO L225 Difference]: With dead ends: 7455 [2025-03-03 15:00:06,777 INFO L226 Difference]: Without dead ends: 3797 [2025-03-03 15:00:06,787 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-03-03 15:00:06,788 INFO L435 NwaCegarLoop]: 2997 mSDtfsCounter, 2371 mSDsluCounter, 5648 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 8645 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:06,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 8645 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:00:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2025-03-03 15:00:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3661. [2025-03-03 15:00:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 2992 states have (on average 1.213235294117647) internal successors, (3630), 3037 states have internal predecessors, (3630), 549 states have call successors, (549), 119 states have call predecessors, (549), 119 states have return successors, (548), 528 states have call predecessors, (548), 548 states have call successors, (548) [2025-03-03 15:00:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 4727 transitions. [2025-03-03 15:00:06,880 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 4727 transitions. Word has length 233 [2025-03-03 15:00:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:06,881 INFO L471 AbstractCegarLoop]: Abstraction has 3661 states and 4727 transitions. [2025-03-03 15:00:06,881 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-03-03 15:00:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 4727 transitions. [2025-03-03 15:00:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 15:00:06,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:06,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, 1, 1, 1, 1] [2025-03-03 15:00:06,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:00:06,883 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:06,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:06,883 INFO L85 PathProgramCache]: Analyzing trace with hash -348781694, now seen corresponding path program 1 times [2025-03-03 15:00:06,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:06,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027102711] [2025-03-03 15:00:06,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:06,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:07,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 15:00:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 15:00:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:07,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:07,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027102711] [2025-03-03 15:00:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027102711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:07,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474839669] [2025-03-03 15:00:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:07,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:07,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:07,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:07,505 INFO L87 Difference]: Start difference. First operand 3661 states and 4727 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-03-03 15:00:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:07,938 INFO L93 Difference]: Finished difference Result 7453 states and 9603 transitions. [2025-03-03 15:00:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:07,939 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-03-03 15:00:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:07,953 INFO L225 Difference]: With dead ends: 7453 [2025-03-03 15:00:07,953 INFO L226 Difference]: Without dead ends: 3797 [2025-03-03 15:00:07,963 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-03-03 15:00:07,963 INFO L435 NwaCegarLoop]: 2898 mSDtfsCounter, 2510 mSDsluCounter, 5094 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2510 SdHoareTripleChecker+Valid, 7992 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:07,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2510 Valid, 7992 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:00:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2025-03-03 15:00:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3659. [2025-03-03 15:00:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 2991 states have (on average 1.212972250083584) internal successors, (3628), 3036 states have internal predecessors, (3628), 548 states have call successors, (548), 119 states have call predecessors, (548), 119 states have return successors, (547), 527 states have call predecessors, (547), 547 states have call successors, (547) [2025-03-03 15:00:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 4723 transitions. [2025-03-03 15:00:08,053 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 4723 transitions. Word has length 234 [2025-03-03 15:00:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:08,054 INFO L471 AbstractCegarLoop]: Abstraction has 3659 states and 4723 transitions. [2025-03-03 15:00:08,054 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-03-03 15:00:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 4723 transitions. [2025-03-03 15:00:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 15:00:08,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:08,056 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-03-03 15:00:08,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:00:08,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:08,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1367684645, now seen corresponding path program 1 times [2025-03-03 15:00:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:08,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703899254] [2025-03-03 15:00:08,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:08,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 15:00:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 15:00:08,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:08,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 15:00:08,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:08,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703899254] [2025-03-03 15:00:08,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703899254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:08,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:08,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412309854] [2025-03-03 15:00:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:08,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:08,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:08,687 INFO L87 Difference]: Start difference. First operand 3659 states and 4723 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-03-03 15:00:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:09,288 INFO L93 Difference]: Finished difference Result 7315 states and 9446 transitions. [2025-03-03 15:00:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:09,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 235 [2025-03-03 15:00:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:09,307 INFO L225 Difference]: With dead ends: 7315 [2025-03-03 15:00:09,307 INFO L226 Difference]: Without dead ends: 3661 [2025-03-03 15:00:09,317 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-03-03 15:00:09,318 INFO L435 NwaCegarLoop]: 2912 mSDtfsCounter, 1754 mSDsluCounter, 5300 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 8212 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:09,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 8212 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:00:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3661 states. [2025-03-03 15:00:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3661 to 3659. [2025-03-03 15:00:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 2991 states have (on average 1.2126379137412238) internal successors, (3627), 3036 states have internal predecessors, (3627), 548 states have call successors, (548), 119 states have call predecessors, (548), 119 states have return successors, (547), 527 states have call predecessors, (547), 547 states have call successors, (547) [2025-03-03 15:00:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 4722 transitions. [2025-03-03 15:00:09,415 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 4722 transitions. Word has length 235 [2025-03-03 15:00:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:09,415 INFO L471 AbstractCegarLoop]: Abstraction has 3659 states and 4722 transitions. [2025-03-03 15:00:09,415 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-03-03 15:00:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 4722 transitions. [2025-03-03 15:00:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 15:00:09,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:09,417 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:09,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:00:09,417 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:09,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1548251379, now seen corresponding path program 1 times [2025-03-03 15:00:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134223210] [2025-03-03 15:00:09,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:09,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 15:00:09,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 15:00:09,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:09,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 15:00:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134223210] [2025-03-03 15:00:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134223210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:09,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:09,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:09,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399094200] [2025-03-03 15:00:09,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:09,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:09,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:09,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:09,991 INFO L87 Difference]: Start difference. First operand 3659 states and 4722 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 15:00:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:10,528 INFO L93 Difference]: Finished difference Result 7447 states and 9592 transitions. [2025-03-03 15:00:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:10,529 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 238 [2025-03-03 15:00:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:10,543 INFO L225 Difference]: With dead ends: 7447 [2025-03-03 15:00:10,543 INFO L226 Difference]: Without dead ends: 3793 [2025-03-03 15:00:10,551 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-03-03 15:00:10,552 INFO L435 NwaCegarLoop]: 2988 mSDtfsCounter, 2354 mSDsluCounter, 5638 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 8626 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:10,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 8626 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:00:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3793 states. [2025-03-03 15:00:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3793 to 3657. [2025-03-03 15:00:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 2990 states have (on average 1.2123745819397993) internal successors, (3625), 3035 states have internal predecessors, (3625), 547 states have call successors, (547), 119 states have call predecessors, (547), 119 states have return successors, (546), 526 states have call predecessors, (546), 546 states have call successors, (546) [2025-03-03 15:00:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4718 transitions. [2025-03-03 15:00:10,643 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4718 transitions. Word has length 238 [2025-03-03 15:00:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:10,643 INFO L471 AbstractCegarLoop]: Abstraction has 3657 states and 4718 transitions. [2025-03-03 15:00:10,643 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 15:00:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4718 transitions. [2025-03-03 15:00:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 15:00:10,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:10,645 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:00:10,645 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:10,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1790988090, now seen corresponding path program 1 times [2025-03-03 15:00:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821833959] [2025-03-03 15:00:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:10,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 15:00:10,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 15:00:10,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:10,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 15:00:11,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:11,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821833959] [2025-03-03 15:00:11,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821833959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:11,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:11,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:11,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061607956] [2025-03-03 15:00:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:11,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:11,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:11,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:11,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:11,241 INFO L87 Difference]: Start difference. First operand 3657 states and 4718 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 15:00:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:12,086 INFO L93 Difference]: Finished difference Result 7445 states and 9585 transitions. [2025-03-03 15:00:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:12,087 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 239 [2025-03-03 15:00:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:12,105 INFO L225 Difference]: With dead ends: 7445 [2025-03-03 15:00:12,105 INFO L226 Difference]: Without dead ends: 3793 [2025-03-03 15:00:12,115 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-03-03 15:00:12,115 INFO L435 NwaCegarLoop]: 2889 mSDtfsCounter, 4465 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4465 SdHoareTripleChecker+Valid, 6873 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:12,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4465 Valid, 6873 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:00:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3793 states. [2025-03-03 15:00:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3793 to 3655. [2025-03-03 15:00:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 2989 states have (on average 1.2121110739377718) internal successors, (3623), 3034 states have internal predecessors, (3623), 546 states have call successors, (546), 119 states have call predecessors, (546), 119 states have return successors, (545), 525 states have call predecessors, (545), 545 states have call successors, (545) [2025-03-03 15:00:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 4714 transitions. [2025-03-03 15:00:12,207 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 4714 transitions. Word has length 239 [2025-03-03 15:00:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:12,207 INFO L471 AbstractCegarLoop]: Abstraction has 3655 states and 4714 transitions. [2025-03-03 15:00:12,207 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 15:00:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 4714 transitions. [2025-03-03 15:00:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-03 15:00:12,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:12,209 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:12,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:00:12,210 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash 899572116, now seen corresponding path program 1 times [2025-03-03 15:00:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837525754] [2025-03-03 15:00:12,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:12,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-03 15:00:12,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-03 15:00:12,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:12,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 15:00:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:12,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837525754] [2025-03-03 15:00:12,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837525754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:12,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:12,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:12,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377502067] [2025-03-03 15:00:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:12,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:12,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:12,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:12,804 INFO L87 Difference]: Start difference. First operand 3655 states and 4714 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 15:00:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:13,265 INFO L93 Difference]: Finished difference Result 7305 states and 9425 transitions. [2025-03-03 15:00:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:13,265 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 240 [2025-03-03 15:00:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:13,281 INFO L225 Difference]: With dead ends: 7305 [2025-03-03 15:00:13,281 INFO L226 Difference]: Without dead ends: 3655 [2025-03-03 15:00:13,291 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-03-03 15:00:13,291 INFO L435 NwaCegarLoop]: 3016 mSDtfsCounter, 2447 mSDsluCounter, 5246 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2447 SdHoareTripleChecker+Valid, 8262 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:13,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2447 Valid, 8262 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:00:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2025-03-03 15:00:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3653. [2025-03-03 15:00:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3653 states, 2988 states have (on average 1.211847389558233) internal successors, (3621), 3033 states have internal predecessors, (3621), 545 states have call successors, (545), 119 states have call predecessors, (545), 119 states have return successors, (544), 524 states have call predecessors, (544), 544 states have call successors, (544) [2025-03-03 15:00:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 4710 transitions. [2025-03-03 15:00:13,383 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 4710 transitions. Word has length 240 [2025-03-03 15:00:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:13,383 INFO L471 AbstractCegarLoop]: Abstraction has 3653 states and 4710 transitions. [2025-03-03 15:00:13,384 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 15:00:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 4710 transitions. [2025-03-03 15:00:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-03 15:00:13,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:13,386 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:13,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:00:13,386 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash -334396947, now seen corresponding path program 1 times [2025-03-03 15:00:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305622424] [2025-03-03 15:00:13,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:13,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:13,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-03 15:00:13,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-03 15:00:13,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:13,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 15:00:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305622424] [2025-03-03 15:00:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305622424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:14,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943492262] [2025-03-03 15:00:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:14,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:14,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:14,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:14,265 INFO L87 Difference]: Start difference. First operand 3653 states and 4710 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 15:00:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:14,452 INFO L93 Difference]: Finished difference Result 6170 states and 7920 transitions. [2025-03-03 15:00:14,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 240 [2025-03-03 15:00:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:14,479 INFO L225 Difference]: With dead ends: 6170 [2025-03-03 15:00:14,479 INFO L226 Difference]: Without dead ends: 6168 [2025-03-03 15:00:14,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:14,485 INFO L435 NwaCegarLoop]: 3092 mSDtfsCounter, 2976 mSDsluCounter, 8671 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2978 SdHoareTripleChecker+Valid, 11763 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:14,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2978 Valid, 11763 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2025-03-03 15:00:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 3931. [2025-03-03 15:00:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3194 states have (on average 1.2204132748904195) internal successors, (3898), 3240 states have internal predecessors, (3898), 602 states have call successors, (602), 134 states have call predecessors, (602), 134 states have return successors, (601), 580 states have call predecessors, (601), 601 states have call successors, (601) [2025-03-03 15:00:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 5101 transitions. [2025-03-03 15:00:14,630 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 5101 transitions. Word has length 240 [2025-03-03 15:00:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:14,630 INFO L471 AbstractCegarLoop]: Abstraction has 3931 states and 5101 transitions. [2025-03-03 15:00:14,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 15:00:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5101 transitions. [2025-03-03 15:00:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 15:00:14,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:14,637 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:14,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:00:14,638 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:14,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash -767142473, now seen corresponding path program 1 times [2025-03-03 15:00:14,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:14,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655011200] [2025-03-03 15:00:14,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms